Period 2: repeat (1,2); a(n) = 1+n mod 2.
1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2
6 seqfan posts
Sun Mar 25 20:43:42 CEST 2012 [seqfan] Re: Sequences that need b-files
Sun Mar 25 18:52:36 CEST 2012 [seqfan] Re: Sequences that need b-files
Sun Mar 25 17:23:41 CEST 2012 [seqfan] Re: Sequences that need b-files
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java
Fri Mar 13 10:51:32 CET 2009 [seqfan] Kolakoski, Golomb, and transforms
Thu Feb 5 17:23:06 CET 2009 [seqfan] More conjectures on sequence products
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.