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.

A182729 Square array T(n,k) = (n*k-1)*A000041(n) read by antidiagonals upwards.

This page as a plain text file.
%I A182729 #21 Nov 03 2017 03:44:13
%S A182729 0,2,1,6,6,2,15,15,10,3,28,35,24,14,4,55,63,55,33,18,5,90,121,98,75,
%T A182729 42,22,6,154,195,187,133,95,51,26,7,240,330,300,253,168,115,60,30,8,
%U A182729 378,510,506,405,319,203,135,69,34,9
%N A182729 Square array T(n,k) = (n*k-1)*A000041(n) read by antidiagonals upwards.
%F A182729 T(n,1) = A182724(n).
%F A182729 T(n,24) = A183011(n).
%e A182729 Square array T(n,k) begins:
%e A182729    0,   1,   2,   3,   4,   5, ...
%e A182729    2,   6,  10,  14,  18,  22, ...
%e A182729    6,  15,  24,  33,  42,  51, ...
%e A182729   15,  35,  55,  75,  95, 115, ...
%e A182729   28,  63,  98, 133, 168, 203, ...
%e A182729   55, 121, 187, 253, 319, 385, ...
%p A182729 T:= (n,k)-> (n*k-1)*combinat[numbpart](n):
%p A182729 seq (seq (T(d-k, k), k=1..d-1), d=2..11);
%t A182729 Table[With[{n = m - k + 1}, (n k - 1) PartitionsP[n]], {m, 10}, {k, m}] // Flatten (* _Michael De Vlieger_, Nov 02 2017 *)
%Y A182729 Cf. A000041, A135010, A182724, A182728, A183009, A183010, A183011.
%K A182729 nonn,easy,tabl
%O A182729 1,2
%A A182729 _Omar E. Pol_, Jan 22 2011