login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A078929
Least k > 0 such that A000002(n+k) = A000002(n).
2
3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2
OFFSET
1,1
CROSSREFS
Cf. A000002.
Sequence in context: A272880 A003636 A353415 * A030728 A237712 A227920
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 15 2002
STATUS
approved