id:A081361 - OEIS Search Results

Search: id:A081361

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,1) = number of letters in English name for n, T(n,k+1) = number of letters in T(n,k), but stop if T(n,k+1) would equal T(n,k).

+0
1

3, 5, 4, 3, 5, 4, 5, 4, 4, 3, 5, 4, 5, 4, 5, 4, 4, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 8, 5, 4, 8, 5, 4, 7, 5, 4, 7, 5, 4, 9, 4, 8, 5, 4, 8, 5, 4, 6, 3, 5, 4, 9, 4 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`First row: n+1 which has three letters, so we get 3 -> 5 -> 4 (-> 4, so stop).`
	CROSSREFS	`Sequence in context: A134892 A055266 A075077 this_sequence A086181 A000655 A130532` `Adjacent sequences: A081358 A081359 A081360 this_sequence A081362 A081363 A081364`
	KEYWORD	`word,nonn,tabf`
	AUTHOR	`Tom Harvey (tom_2097(AT)yahoo.com), Mar 18 2003`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research