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 A053201 #17 Oct 27 2023 22:00:45 %S A053201 0,0,0,0,2,0,0,0,0,0,0,3,2,3,0,0,0,0,0,0,0,0,4,0,6,0,4,0,0,0,3,0,0,3, %T A053201 0,0,0,5,0,0,2,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,6,4,3,0,0,0,3,4,6,0,0,0, %U A053201 0,0,0,0,0,0,0,0,0,0,0,7,0,7,0,7,2,7,0,7,0,7,0,0,0,5,0,3,10,0,0,10,3,0,5,0 %N A053201 Pascal's triangle (excluding first, last element of each row) read by rows, row n read mod n. %C A053201 Prime numbered rows contain all zeros. %H A053201 T. D. Noe, <a href="/A053201/b053201.txt">Rows n=2..100 of triangle, flattened</a> %F A053201 T(n,k) = A014410(n,k) mod n, k=1..n-1. %e A053201 0; 0,0; 0,2,0; 0,0,0,0; 0,3,2,3,0; ... %e A053201 row 6 = 6 mod 6, 15 mod 6, 20 mod 6, 15 mod 6, 6 mod 6 = 0, 3, 2, 3, 0 %t A053201 row[n_] := Table[ Mod[ Binomial[n, k], n], {k, 1, n-1}]; Table[row[n], {n, 2, 15}] // Flatten (* _Jean-François Alcover_, Aug 12 2013 *) %o A053201 (Haskell) %o A053201 a053201 n k = a053201_tabl !! (n-2) !! (k-1) %o A053201 a053201_row n = a053201_tabl !! (n-2) %o A053201 a053201_tabl = zipWith (map . (flip mod)) [2..] a014410_tabl %o A053201 -- _Reinhard Zumkeller_, Aug 17 2013 %Y A053201 Row sums give A053205. Cf. A053200, A053202, A053203, A007318 (Pascal's triangle) %Y A053201 Cf. A053214 (central terms). %K A053201 nonn,nice,tabl,look %O A053201 2,5 %A A053201 _Asher Auel_, Dec 12 1999 %E A053201 a(62) and a(68) corrected by _T. D. Noe_, Feb 08 2008