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 A094497 #13 Oct 07 2017 21:53:55
%S A094497 1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A094497 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A094497 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2744,2744,2744,0,0,0,0,0,0,0,0,0,0,0,0,3375,3375,3375,3375,0,0,0,0,0,0,0,0,0,0,0,4096,4096,8192,12288,8192,4096,4096
%N A094497 Triangular table A(n,j) = C(n,j) - C(n,j) mod n^3, difference of binomial coefficient and its residue mod n^3, read by rows.
%C A094497 a(0) = 1 by convention.
%H A094497 Antti Karttunen, <a href="/A094497/b094497.txt">Table of n, a(n) for n = 0..10439; the first 144 rows of triangle</a>
%H A094497 <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%e A094497 Out of a(1)=1 and a(2)=1, the first deviation from A007318 is at a(111) because C(14,6) = 3003, 3003 mod 2744 = 259, a(111) = 2744.
%t A094497 Flatten[Table[Table[Binomial[n, j]-Mod[Binomial[n, j], n^3], {j, 0, n}], {n, 1, 14}], 1]
%Y A094497 Cf. A007318, A053200, A094495, A094496.
%K A094497 easy,nonn,tabl
%O A094497 0,112
%A A094497 _Labos Elemer_, Jun 02 2004