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 A133885 #11 Apr 26 2023 19:16:52
%S A133885 1,6,21,6,1,2,12,17,12,2,3,18,13,18,3,4,24,9,24,4,5,5,5,5,5,6,11,1,11,
%T A133885 6,7,17,22,17,7,8,23,18,23,8,9,4,14,4,9,10,10,10,10,10,11,16,6,16,11,
%U A133885 12,22,2,22,12,13,3,23,3,13,14,9,19,9,14,15,15,15,15,15,16,21,11,21,16,17
%N A133885 Binomial(n+5,n) mod 5^2.
%C A133885 Periodic with length 5^3=125.
%H A133885 Ray Chandler, <a href="/A133885/b133885.txt">Table of n, a(n) for n = 0..1000</a>
%H A133885 <a href="/index/Rec#order_121">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 1).
%F A133885 a(n)=binomial(n+5,5) mod 5^2.
%F A133885 G.f. g(x)=sum{0<=k<125, a(k)*x^k}/(1-x^125).
%t A133885 Table[Mod[Binomial[n+5,n],25],{n,0,90}] (* _Harvey P. Dale_, Jan 12 2023 *)
%Y A133885 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
%Y A133885 Cf. A133875, A133880, A133890, A133900, A133910.
%Y A133885 For the sequence regarding binomial(n+5, n) mod 5 see A133875.
%K A133885 nonn
%O A133885 0,2
%A A133885 _Hieronymus Fischer_, Oct 10 2007