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 A362689 #4 Apr 29 2023 20:55:32
%S A362689 0,1,1,3,2,1,2,6,2,8,1,2,1,10,14,15,1,3,1,5,18,1,1,12,6,14,4,12,1,22,
%T A362689 1,13,1,1,13,23,1,1,14,34,1,14,1,34,15,24,1,27,8,11,18,1,1,7,12,16,1,
%U A362689 30,1,28,1,32,17,25,14,23,1,35,47,25,1,54,1,38,66
%N A362689 Binomial(n+p, n) mod n where p=9.
%H A362689 Ray Chandler, <a href="/A362689/b362689.txt">Table of n, a(n) for n = 1..1000</a>
%H A362689 <a href="/index/Rec#order_5806080">Index entries for linear recurrences with constant coefficients</a>, order 5806080.
%F A362689 a(n)=binomial(n+9,n) mod n.
%F A362689 For n > 5806081, a(n) = 2*a(n-2903040) - a(n-5806080).
%t A362689 Table[Mod[Binomial[n+9,n],n],{n,90}]
%Y A362689 Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
%Y A362689 Cf. A133875, A133885, A133880, A133890, A133900, A133910, A362686, A362687, A362688.
%K A362689 nonn
%O A362689 1,4
%A A362689 _Ray Chandler_, Apr 29 2023