  Sequences with {\em perfect linear complexity profile} were defined more than
thirty years ago in the study of measures of randomness for binary sequences.
More recently {\em apwenian sequences}, first with values $\pm 1$, then with
values in $\{0, 1\}$, were introduced in the study of Hankel determinants of
automatic sequences. We explain that these two families of sequences are the
same up to indexing, and give consequences and questions that this implies. We
hope that this will help gathering two distinct communities of researchers.
