This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A061504 a(n+1) = le nombre des lettres dans a(n). 2
 1, 2, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4, 6, 3, 5, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(1) = 1; for n>1, a(n) = numbers of letters in French name for a(n-1). The English (1, 3, 5, 4, 4, 4, ...) and German (1, 4, 4, 4, ...) versions are less interesting. Memo: 13847/1111 = 12.4635463546354635... - Eric Angelini, Sep 17 2006 LINKS EXAMPLE Un, deux, quatre, six, trois, cinq, quatre, ... UN (2 letters), DEUX (4 letters), QUATRE (6 letters), SIX (3 letters), TROIS (5 letters), CINQ (4 letters), QUATRE (6 letters), ... CROSSREFS Cf. A000655 (English), A101432 (Spanish). Sequence in context: A085593 A220336 A021410 * A077179 A076179 A175213 Adjacent sequences:  A061501 A061502 A061503 * A061505 A061506 A061507 KEYWORD nonn,word,easy AUTHOR N. J. A. Sloane, Jun 14 2001 EXTENSIONS Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jun 08 2007 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 April 20 16:17 EDT 2019. Contains 322310 sequences. (Running on oeis4.)