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”).

Least k > 0 such that A000002(n+k) = A000002(n).
2

%I #7 Apr 11 2022 12:08:47

%S 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,

%T 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,

%U 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

%N Least k > 0 such that A000002(n+k) = A000002(n).

%Y Cf. A000002.

%K nonn

%O 1,1

%A _Benoit Cloitre_, Dec 15 2002