login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A010283 A134699 A003636 * A030728 A138291 A201681

Adjacent sequences:  A078926 A078927 A078928 * A078930 A078931 A078932

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 15 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:48 EST 2012. Contains 205978 sequences.