A061504 a(n+1) = le nombre des lettres dans a(n).

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

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

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

Index entries for linear recurrences with constant coefficients, signature (0,0,0,1).

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. A007005 (number of letters).

Cf. A000655 (English), A101432 (Spanish), A328263 (Polish).

Sequence in context: A021410 A356216 A336843 * 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