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 A053203 #15 Oct 27 2023 22:00:45 %S A053203 2,0,0,0,6,0,3,0,0,3,0,0,2,0,0,0,0,0,0,0,0,4,3,0,0,0,3,4,0,0,0,0,0,0, %T A053203 0,0,0,7,0,7,2,7,0,7,0,5,0,3,10,0,0,10,3,0,5,0,12,0,8,0,6,0,8,0,12,0, %U A053203 0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,6,0,0,2,0,0,6,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0 %N A053203 Pascal's triangle (excluding first, last three elements of each row) read by rows, row n read mod n. %C A053203 Prime numbered rows contain all zeros. %H A053203 T. D. Noe, <a href="/A053203/b053203.txt">Rows n=6..100 of triangle, flattened</a> %e A053203 Triangle begins: %e A053203 2; %e A053203 0,0; %e A053203 0,6,0; %e A053203 3,0,0,3; %e A053203 0,0,2,0,0; %e A053203 ... %e A053203 row 9 = 84 mod 9, 126 mod 9, 126 mod 9, 84 mod 9, = 3, 0, 0, 3. %t A053203 Table[Mod[Binomial[n, k], n], {n, 6, 20}, {k, 3, n-3}] // Flatten (* _Jean-François Alcover_, Jan 17 2014 *) %o A053203 (Haskell) %o A053203 a053203 n k = a053203_tabl !! (n - 6) !! k %o A053203 a053203_row n = a053203_tabl !! (n - 6) %o A053203 a053203_tabl = zipWith (\k row -> take (k - 5) $ drop 3 row) %o A053203 [6..] $ drop 6 a053200_tabl %o A053203 -- _Reinhard Zumkeller_, Jan 24 2014 %Y A053203 Row sums give A053206. %Y A053203 Cf. A053200, A053201, A053203, A007318 (Pascal's triangle). %K A053203 nonn,nice,tabl %O A053203 6,1 %A A053203 _Asher Auel_, Dec 12 1999 %E A053203 a(30) corrected by _T. D. Noe_, Feb 08 2008