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 A010889 #34 Jul 08 2025 01:47:37
%S A010889 1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,
%T A010889 4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,
%U A010889 7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1
%N A010889 Simple periodic sequence: repeat 1,2,3,4,5,6,7,8,9,10.
%C A010889 Partial sums are given by A130488(n)+n+1. - _Hieronymus Fischer_, Jun 08 2007
%C A010889 Continued fraction expansion of (232405+sqrt(71216963807))/348378. [From _Klaus Brockhaus_, May 15 2010]
%H A010889 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,1).
%F A010889 a(n) = 1 + (n mod 10) - _Paolo P. Lava_, Nov 21 2006
%F A010889 From _Hieronymus Fischer_, Jun 08 2007: (Start)
%F A010889 a(n) = A010879(n)+1.
%F A010889 G.f.: (Sum_{k=0..9} (k+1)*x^k)/(1-x^10).
%F A010889 G.f.: (10x^11-11x^10+1)/((1-x^10)(1-x)^2). (End)
%t A010889 PadRight[{},120,Range[10]] (* _Harvey P. Dale_, Feb 22 2015 *)
%o A010889 (Python) def a(n): return n % 10 + 1 # _Paul Muljadi_, Aug 06 2024
%Y A010889 Cf. A010872, A010873, A010874, A010875, A010876, A010877, A010878, A004526, A002264, A002265, A002266.
%Y A010889 Cf. A177933 (decimal expansion of (232405+sqrt(71216963807))/348378). [From _Klaus Brockhaus_, May 15 2010]
%K A010889 nonn,easy
%O A010889 0,2
%A A010889 _N. J. A. Sloane_
%E A010889 More terms from _Klaus Brockhaus_, May 15 2010