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.

A293202 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of g.f. Product_{i>0} Sum_{j=0..k} j!*x^(j*i).

This page as a plain text file.
%I A293202 #24 Dec 06 2019 08:37:30
%S A293202 1,1,0,1,1,0,1,1,1,0,1,1,3,2,0,1,1,3,2,2,0,1,1,3,8,6,3,0,1,1,3,8,6,7,
%T A293202 4,0,1,1,3,8,30,13,12,5,0,1,1,3,8,30,13,24,13,6,0,1,1,3,8,30,133,48,
%U A293202 37,22,8,0,1,1,3,8,30,133,48,61,46,26,10,0,1,1,3,8,30,133,768,181,142,98,42,12,0
%N A293202 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of g.f. Product_{i>0} Sum_{j=0..k} j!*x^(j*i).
%H A293202 Seiichi Manyama, <a href="/A293202/b293202.txt">Antidiagonals n = 0..139, flattened</a>
%e A293202 Square array begins:
%e A293202    1, 1, 1,  1,  1, ...
%e A293202    0, 1, 1,  1,  1, ...
%e A293202    0, 1, 3,  3,  3, ...
%e A293202    0, 2, 2,  8,  8, ...
%e A293202    0, 2, 6,  6, 30, ...
%e A293202    0, 3, 7, 13, 13, ...
%p A293202 b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A293202       add(b(n-i*j, i-1, k)*j!, j=0..min(k, n/i))))
%p A293202     end:
%p A293202 A:= (n, k)-> b(n$2, k):
%p A293202 seq(seq(A(n, d-n), n=0..d), d=0..12);  # _Alois P. Heinz_, Oct 02 2017
%t A293202 b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, Sum[b[n - i j, i - 1, k] j!, {j, 0, Min[k, n/i]}]]];
%t A293202 A [n_, k_] := b[n, n, k];
%t A293202 Table[Table[A[n, d-n], {n, 0, d}], {d, 0, 12}] // Flatten (* _Jean-François Alcover_, Dec 06 2019, after _Alois P. Heinz_ *)
%Y A293202 Columns k=0..5 give A000007, A000009, A293204, A289485, A289486, A293250.
%Y A293202 Rows n=0..1 give A000012, A057427.
%Y A293202 Main diagonal gives A161779.
%K A293202 nonn,tabl
%O A293202 0,13
%A A293202 _Seiichi Manyama_, Oct 02 2017