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 A099907 #17 Sep 08 2022 08:45:15
%S A099907 0,3,10,35,1,30,1,291,253,378,1,782,1,2404,1260,291,1,3378,1,410,7899,
%T A099907 3996,1,6030,126,10988,11188,5180,1,19712,1,8483,5334,34394,1841,
%U A099907 21410,1,20580,39556,38810,1,64260,1,35972,66060,36504,1,61326,1716,123628
%N A099907 a(n) = C(2n-1,n-1) mod n^3.
%C A099907 For p prime > 3, Joseph Wolstenholme showed in 1862 that a(p)=1. - corrected by _Jonathan Sondow_, Jan 24 2016
%H A099907 Robert Israel, <a href="/A099907/b099907.txt">Table of n, a(n) for n = 1..10000</a>
%e A099907 a(11) = 352716 mod 1331 = 1.
%p A099907 seq(binomial(2*n-1,n-1) mod n^3, n=1..100); # _Robert Israel_, Jan 24 2016
%t A099907 Table[Mod[Binomial[2 n - 1, n - 1], n^3], {n, 1, 50}] (* _Vincenzo Librandi_, Jan 24 2016 *)
%o A099907 (PARI) a(n) = binomial(2*n-1, n-1) % n^3; \\ _Michel Marcus_, Jan 24 2016
%o A099907 (Magma) [Binomial(2*n-1, n-1) mod n^3: n in [1..50]]; // _Vincenzo Librandi_, Jan 24 2016
%Y A099907 Cf. A088218, A099905, A099906, A099908, A244214.
%K A099907 nonn
%O A099907 1,2
%A A099907 _Henry Bottomley_, Oct 29 2004