Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Oct 04 2020 11:04:02
%S 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,
%T 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,
%U 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
%N Each term is the number of letters in the Spanish name of the previous term.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F a(n) = 5-(-1)^n for n>1, with a(0)=1 and a(1)=3. - _Wesley Ivan Hurt_, Oct 03 2020
%e Uno tres cuatro seis cuatro seis ...
%Y Cf. A011762 (number of letters).
%Y Cf. A000655 (English), A061504 (French), A328263 (Polish).
%K easy,nonn,word
%O 0,2
%A Kevin Langdon (kevin.langdon(AT)polymath-systems.com), Jan 17 2005; corrected May 24 2005
%E More terms from Kara A. Houck (kah979(AT)psu.edu), Apr 20 2006