id:A078929 - OEIS Search Results

Search: id:A078929

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A010283 A134699 A003636 this_sequence A030728 A138291 A062174` `Adjacent sequences: A078926 A078927 A078928 this_sequence A078930 A078931 A078932`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 15 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research