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

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,2

Comments

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

Links

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

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

Formula

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

Example

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

Crossrefs

Cf. A008962 (number of letters).

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

Sequence in context: A298513 A021187 A075194 * A138255 A153451 A190143

Adjacent sequences: A328260 A328261 A328262 * A328264 A328265 A328266

Keyword

nonn,word,easy

Author

Robert Bilinski, Oct 09 2019

Status

approved