cp's OEIS Frontend

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.

A358146 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(k*j,j).

This page as a plain text file.
%I A358146 #17 Mar 18 2023 08:07:45
%S A358146 1,1,1,1,2,1,1,3,3,1,1,4,9,4,1,1,5,19,29,5,1,1,6,33,103,99,6,1,1,7,51,
%T A358146 253,598,351,7,1,1,8,73,506,2073,3601,1275,8,1,1,9,99,889,5351,17577,
%U A358146 22165,4707,9,1,1,10,129,1429,11515,58481,152173,138445,17577,10,1
%N A358146 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(k*j,j).
%H A358146 Seiichi Manyama, <a href="/A358146/b358146.txt">Antidiagonals n = 0..139, flattened</a>
%e A358146 Square array begins:
%e A358146   1, 1,   1,    1,     1,     1, ...
%e A358146   1, 2,   3,    4,     5,     6, ...
%e A358146   1, 3,   9,   19,    33,    51, ...
%e A358146   1, 4,  29,  103,   253,   506, ...
%e A358146   1, 5,  99,  598,  2073,  5351, ...
%e A358146   1, 6, 351, 3601, 17577, 58481, ...
%o A358146 (PARI) T(n, k) = sum(j=0, n, binomial(k*j, j));
%Y A358146 Columns k=0-5 give: A000012, A001477(n+1), A006134, A188675, A225612, A225615.
%Y A358146 Main diagonal gives A226391.
%Y A358146 Cf. A358050.
%K A358146 nonn,tabl
%O A358146 0,5
%A A358146 _Seiichi Manyama_, Oct 31 2022