id:A014388 - OEIS Search Results

Search: id:A014388

Displaying 1-1 of 1 results found.

page 1

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

+0
6

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

	OFFSET	`1,1`
	CROSSREFS	`Cf. A000916, A001166, A014388, A045494, A045495.` `Sequence in context: A125608 A099813 A141300 this_sequence A117374 A021322 A036412` `Adjacent sequences: A014385 A014386 A014387 this_sequence A014389 A014390 A014391`
	KEYWORD	`nonn,word,easy`
	AUTHOR	`Jacques Haubrich (jhaubrich(AT)freeler.nl)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research