cp's OEIS Frontend

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.

A061504 a(1) = 1; for n>1, a(n) = numbers of letters in French name for a(n-1).

This page as a plain text file.
%I A061504 #36 Jul 15 2024 19:27:25
%S A061504 1,2,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,
%T A061504 4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,
%U A061504 3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4,6,3,5,4
%N A061504 a(1) = 1; for n>1, a(n) = numbers of letters in French name for a(n-1).
%C A061504 a(n+1) = le nombre des lettres dans a(n), a(1) = 1 (in French).
%C A061504 The English (1, 3, 5, 4, 4, 4, ...) and German (1, 4, 4, 4, ...) versions are less interesting.
%C A061504 Decimal expansion of 13847/11110 = 1.24635463546354635... - _Eric Angelini_, Sep 17 2006; corrected by _Elmo R. Oliveira_, Jun 29 2024
%H A061504 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,1).
%F A061504 From _Elmo R. Oliveira_, Jun 29 2024: (Start)
%F A061504 G.f.: x*(1+2*x+4*x^2+6*x^3+2*x^4+3*x^5)/(1-x^4).
%F A061504 a(n) = a(n-4) for n > 6. (End)
%e A061504 Un, deux, quatre, six, trois, cinq, quatre, ...
%e A061504 UN (2 letters), DEUX (4 letters), QUATRE (6 letters), SIX (3 letters), TROIS (5 letters), CINQ (4 letters), QUATRE (6 letters), ...
%Y A061504 Cf. A007005 (number of letters).
%Y A061504 Cf. A000655 (English), A101432 (Spanish), A328263 (Polish).
%K A061504 nonn,word,easy
%O A061504 1,2
%A A061504 _N. J. A. Sloane_, Jun 14 2001
%E A061504 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 08 2007