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 A085476 #22 Dec 08 2023 09:57:47 %S A085476 1,1,1,1,1,1,1,2,1,1,1,3,1,1,1,1,4,3,1,1,1,1,5,6,1,2,1,1,1,6,10,4,1,1, %T A085476 1,1,1,7,15,10,1,3,1,1,1,1,8,21,20,5,1,3,2,1,1,1,9,28,35,15,1,4,1,1,1, %U A085476 1,1,10,36,56,35,6,1,6,1,1,1,1 %N A085476 Periodic Pascal array, read by upward antidiagonals. %C A085476 G.f. of binomial transform of n-th row is given by 1/((1-x)^(n+1)-x^(n+1)). %H A085476 John Tyler Rascoe, <a href="/A085476/b085476.txt">Antidiagonals n = 0..139, flattened</a> %F A085476 Square array T(n, k) = C(n, k mod (n+1)). %e A085476 Rows begin: %e A085476 n\k | 0 1 2 3 4 5 %e A085476 ----+------------ %e A085476 0 | 1 1 1 1 1 1 ... %e A085476 1 | 1 1 1 1 1 1 ... %e A085476 2 | 1 2 1 1 2 1 ... %e A085476 3 | 1 3 3 1 1 3 ... %e A085476 4 | 1 4 6 4 1 1 ... %o A085476 (Python) %o A085476 from math import comb %o A085476 def A085476(n,k): return(comb(n,k%(n+1))) # _John Tyler Rascoe_, Dec 01 2023 %Y A085476 Cf. A007318, A000749, A049016, A006090, A049017. %K A085476 easy,nonn,tabl %O A085476 0,8 %A A085476 _Paul Barry_, Jul 02 2003