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

%I #18 May 05 2024 20:30:55

%S 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,

%T 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,

%U 4,6,5,4,6,5,4,6,5,4,6,5,4,6,5,4,6

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

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

%C Decimal expansion of 515/333. - _Elmo R. Oliveira_, May 05 2024

%H Robert Bilinski, <a href="/A328263/b328263.txt">Table of n, a(n) for n = 1..99</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).

%F a(n) = a(n-3) for n > 4. - _Elmo R. Oliveira_, May 05 2024

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

%Y Cf. A008962 (number of letters).

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

%K nonn,word,easy

%O 1,2

%A _Robert Bilinski_, Oct 09 2019