A081361 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A081361

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

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; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..54.

EXAMPLE

First row: n+1 which has three letters, so we get 3 -> 5 -> 4 (-> 4, so stop).

CROSSREFS

Sequence in context: A354247 A349943 A243296 * A195132 A086181 A000655

Adjacent sequences: A081358 A081359 A081360 * A081362 A081363 A081364

KEYWORD

word,nonn,tabf

AUTHOR

Tom Harvey (tom_2097(AT)yahoo.com), Mar 18 2003

STATUS

approved