login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000655 a(n) = number of letters in a(n-1), a(1) = 1 (in English). 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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
KEYWORD
nonn,word,easy
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 11:02 EDT 2024. Contains 371779 sequences. (Running on oeis4.)