A078929 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..105.

CROSSREFS

Sequence in context: A272880 A003636 A353415 * A030728 A237712 A227920

Adjacent sequences: A078926 A078927 A078928 * A078930 A078931 A078932

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Dec 15 2002

STATUS

approved