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
Examples
Jeden, pięć, cztery, sześć, pięć, ...
Links
- Robert Bilinski, Table of n, a(n) for n = 1..99
- Index entries for linear recurrences with constant coefficients, signature (0,0,1).
Crossrefs
Formula
a(n) = a(n-3) for n > 4. - Elmo R. Oliveira, May 05 2024
Comments