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.

A177274 Periodic sequence: Repeat 1, 2, 3, 4, 5, 6, 7, 8, 9.

This page as a plain text file.
%I A177274 #15 Jan 08 2024 10:55:10
%S A177274 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,
%T A177274 8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,
%U A177274 6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6
%N A177274 Periodic sequence: Repeat 1, 2, 3, 4, 5, 6, 7, 8, 9.
%C A177274 Interleaving of A131669 and A131669 without first five terms.
%C A177274 Continued fraction expansion of (684125+sqrt(635918528029))/1033802.
%C A177274 Decimal expansion of 13717421/111111111.
%C A177274 a(n) = A010888(n+1) = A010878(n)+1 = A117230(n+2)-1.
%C A177274 a(n) = A064806(n+1)-n-1.
%C A177274 Essentially first differences of A037123.
%H A177274 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,1).
%F A177274 a(n) = (n mod 9)+1.
%F A177274 a(n) = a(n-9) for n > 8; 1; a(n) = n+1 for n <= 8.
%F A177274 G.f.: (1+2*x+3*x^2+4*x^3+5*x^4+6*x^5+7*x^6+8*x^7+9*x^8)/(1-x^9). [corrected by _Georg Fischer_, May 11 2019]
%t A177274 PadRight[{},120,Range[9]] (* _Paolo Xausa_, Jan 08 2024 *)
%o A177274 (Magma) &cat[ [1, 2, 3, 4, 5, 6, 7, 8, 9]: k in [1..12] ];
%Y A177274 Cf. A131669 (odd digits followed by positive even digits), A010888 (digital root of n), A010878 (n mod 9), A117230 (1 followed by (repeat 2, 3, 4, 5, 6, 7, 8, 9, 10), offset 1), A064806 (n + digital root of n), A037123, A177270 (decimal expansion of (684125+sqrt(635918528029))/1033802).
%K A177274 cofr,easy,nonn
%O A177274 0,2
%A A177274 _Klaus Brockhaus_, May 07 2010