This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A328263 #18 May 05 2024 20:30:55 %S A328263 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 A328263 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 A328263 4,6,5,4,6,5,4,6,5,4,6,5,4,6,5,4,6 %N A328263 a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1. %C A328263 a(1) = 1; for n>1, a(n) = numbers of letters in Polish name for a(n-1). %C A328263 Decimal expansion of 515/333. - _Elmo R. Oliveira_, May 05 2024 %H A328263 Robert Bilinski, <a href="/A328263/b328263.txt">Table of n, a(n) for n = 1..99</a> %H A328263 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1). %F A328263 a(n) = a(n-3) for n > 4. - _Elmo R. Oliveira_, May 05 2024 %e A328263 Jeden, pięć, cztery, sześć, pięć, ... %Y A328263 Cf. A008962 (number of letters). %Y A328263 Cf. A000655 (English), A061504 (French), A101432 (Spanish). %K A328263 nonn,word,easy %O A328263 1,2 %A A328263 _Robert Bilinski_, Oct 09 2019