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 A053202 #18 Oct 27 2023 22:00:45 %S A053202 2,0,0,3,2,3,0,0,0,0,4,0,6,0,4,0,3,0,0,3,0,5,0,0,2,0,0,5,0,0,0,0,0,0, %T A053202 0,0,6,4,3,0,0,0,3,4,6,0,0,0,0,0,0,0,0,0,0,7,0,7,0,7,2,7,0,7,0,7,0,5, %U A053202 0,3,10,0,0,10,3,0,5,0,8,0,12,0,8,0,6,0,8,0,12,0,8,0,0,0,0,0,0,0,0,0,0,0,0 %N A053202 Pascal's triangle (excluding first, last two elements of each row) read by rows, row n read mod n. %C A053202 Prime numbered rows contain all zeros. %H A053202 T. D. Noe, <a href="/A053202/b053202.txt">Rows n = 4..100 of triangle, flattened</a> %e A053202 Triangle begins: %e A053202 2; %e A053202 0, 0; %e A053202 3, 2, 3; %e A053202 0, 0, 0, 0; %e A053202 4, 0, 6, 0, 4; %e A053202 ... %e A053202 row 8 = 28 mod 8, 56 mod 8, 70 mod 8, 56 mod 8, 28 mod 8 = 4, 0, 6, 0, 4. %t A053202 Table[Mod[Binomial[n, k], n], {n, 4, 18}, {k, 2, n-2}] // Flatten (* _Jean-François Alcover_, Jun 06 2017 *) %o A053202 (Haskell) %o A053202 a053202 n k = a053202_tabl !! (n - 4) !! k %o A053202 a053202_row n = a053202_tabl !! (n - 4) %o A053202 a053202_tabl = zipWith (\k row -> take (k - 3) $ drop 2 row) %o A053202 [4..] $ drop 4 a053200_tabl %o A053202 -- _Reinhard Zumkeller_, Jan 24 2014 %Y A053202 Sum of row n = A053205(n). Cf. A053200, A053201, A053203, A007318 (Pascal's triangle). %K A053202 nonn,nice,tabl %O A053202 4,1 %A A053202 _Asher Auel_, Dec 12 1999 %E A053202 a(44) corrected by _T. D. Noe_, Feb 08 2008