This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 EXAMPLE First row: n+1 which has three letters, so we get 3 -> 5 -> 4 (-> 4, so stop). CROSSREFS Sequence in context: A196771 A266121 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 25 22:28 EDT 2019. Contains 321477 sequences. (Running on oeis4.)