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).

3, 5, 4, 3, 5, 4, 5, 4, 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, 9, 4, 11, 6, 3, 5, 4, 10, 3, 5, 4, 10, 3, 5, 4, 9, 4, 11, 6, 3, 5, 4, 11, 6, 3, 5, 4, 10, 3, 5

Offset

1,1

Links

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

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,less

Author

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

Extensions

Missing a(10)=4 inserted and more terms from Sean A. Irvine, Oct 25 2025

Status

approved