A000655 a(n) = number of letters in a(n-1), a(1) = 1 (in English).

1, 3, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4

Offset

1,2

Links

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

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

Formula

a(n) = 4 for n > 3, with a(1) = 1, a(2) = 3 and a(3) = 5. - Wesley Ivan Hurt, Oct 03 2020

E.g.f.: - 4 - 3*x - (1/2)*x^2 + (1/6)*x^3 + 4*exp(x). - Alejandro J. Becerra Jr., Feb 17 2021

Example

One, three, five, four, four, four, ...

Mathematica

Nest[Append[#, StringLength@ IntegerName[#[[-1]], "Words"]] &, {1}, 105] (* Michael De Vlieger, Feb 17 2021 *)

Crossrefs

Cf. A005589 (number of letters).

Cf. A061504 (French), A101432 (Spanish), A328263 (Polish).

Sequence in context: A081361 A195132 A086181 * A130532 A019707 A197825

Adjacent sequences: A000652 A000653 A000654 * A000656 A000657 A000658

Keyword

nonn,word,easy

Author

N. J. A. Sloane

Status

approved