A061504 -id:A061504 - cp's OEIS frontend

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

N. J. A. Sloane

Decimal expansion of 1219/900. - Elmo R. Oliveira, May 05 2024

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

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

Cf. A005589 (number of letters).

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

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

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
G.f.: x*(1+2*x+2*x^2-x^3)/(1-x). - Elmo R. Oliveira, Jun 25 2024

A101432 Each term is the number of letters in the Spanish name of the previous term.

Original entry on oeis.org

1, 3, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4

Offset: 0

Kevin Langdon (kevin.langdon(AT)polymath-systems.com), Jan 17 2005; corrected May 24 2005

			Uno tres cuatro seis cuatro seis ...

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

Cf. A011762 (number of letters).

Cf. A000655 (English), A061504 (French), A328263 (Polish).

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

More terms from Kara A. Houck (kah979(AT)psu.edu), Apr 20 2006

A328263 a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1.

Original entry on oeis.org

1, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6

Offset: 1

Robert Bilinski, Oct 09 2019

a(1) = 1; for n>1, a(n) = numbers of letters in Polish name for a(n-1).

Decimal expansion of 515/333. - Elmo R. Oliveira, May 05 2024

			Jeden, pięć, cztery, sześć, pięć, ...

Robert Bilinski, Table of n, a(n) for n = 1..99
Index entries for linear recurrences with constant coefficients, signature (0,0,1).

Cf. A008962 (number of letters).

Cf. A000655 (English), A061504 (French), A101432 (Spanish).

a(n) = a(n-3) for n > 4. - Elmo R. Oliveira, May 05 2024

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A101432 Each term is the number of letters in the Spanish name of the previous term.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

Extensions

A328263 a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula