id:A000916 - OEIS Search Results

Search: id:A000916

Displaying 1-1 of 1 results found.

page 1

a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.

+0
6

1, 3, 4, 4, 3, 5, 11, 6, 15, 7, 13, 8, 17, 9, 24, 10, 23, 11, 73, 12, 3000, 13, 11000, 14, 15000, 15, 101, 16, 104, 17, 103, 18, 111, 19, 115, 20 (list; graph; listen)

	OFFSET	`1,2`
	CROSSREFS	`Cf. A000916, A001166, A014388, A045494, A045495.` `Adjacent sequences: A000913 A000914 A000915 this_sequence A000917 A000918 A000919` `Sequence in context: A019917 A085005 A035004 this_sequence A014241 A007485 A018244`
	KEYWORD	`nonn,word,easy`
	AUTHOR	`Jacques Haubrich (jhaubrich(AT)freeler.nl)`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research