a(n) = number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage. E.g. for n=6 there are 6 such sequences.
1, 1, 1, 2, 2, 4, 6, 10, 16, 30, 52, 94, 172, 316, 586, 1096, 2048, 3856, 7286, 13798
2 seqfan posts
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java