id:A067017 - OEIS Search Results

Search: id:A067017

Displaying 1-1 of 1 results found.

page 1

Start with a(0)=1, a(1)=4, a(2)=3, a(3)=2; for n>=3, a(n+1) = mex_i (a(i)+a(n-i)), where mex means smallest nonnegative missing number.

+0
3

1, 4, 3, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0, 0, 0, 5, 1, 1, 1, 1, 1, 6, 2, 2, 0, 0, 0 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`R. K. Guy, Unsolved Problems in Number Theory, E27.`
	CROSSREFS	`Cf. A067016, A067018.` `Adjacent sequences: A067014 A067015 A067016 this_sequence A067018 A067019 A067020` `Sequence in context: A128320 A039621 A143543 this_sequence A067018 A100802 A022960`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Feb 17 2002`
	EXTENSIONS	`More terms from John W. Layman (layman(AT)math.vt.edu), Feb 20 2002`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research