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 A133880 #15 Apr 16 2023 22:14:09
%S A133880 1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,4,4,4,4,
%T A133880 4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,
%U A133880 7,7,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1
%N A133880 n modulo p repeated p times (where p=10).
%C A133880 Periodic with length p^2=100.
%C A133880 a(n) = A179051(n) for n < 90. - _Reinhard Zumkeller_, Jun 27 2010
%H A133880 <a href="/index/Rec#order_91">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1).
%F A133880 The following formulas are given for a general parameter p (p=10 for this sequence).
%F A133880 a(n)=(1+floor(n/p)) mod p.
%F A133880 a(n)=1+floor(n/p)-p*floor((n+p)/p^2).
%F A133880 a(n)=(((n+p) mod p^2)-(n mod p))/p.
%F A133880 a(n)=((n+p-(n mod p))/p) mod p.
%F A133880 G.f. g(x)=((p-1)x^(p^2)-px^(p(p-1))+1)/((1-x)(1-x^p)(1-x^(p^2))).
%F A133880 G.f. g(x)=(1-x^p)*sum{0<=k<(p-1), (k+1)*x^(k*p)}/((1-x)(1-x^(p^2))).
%t A133880 Flatten[Table[PadRight[{},10,Mod[n,10]],{n,11}]] (* _Harvey P. Dale_, May 10 2012 *)
%o A133880 (PARI) a(n)=(n\10+1)%10 \\ _Charles R Greathouse IV_, Nov 15 2022
%Y A133880 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
%Y A133880 Cf. A133890, A133900, A133910.
%K A133880 nonn,easy
%O A133880 0,11
%A A133880 _Hieronymus Fischer_, Oct 10 2007