|
|
A103438
|
|
Square array T(m,n) read by antidiagonals: Sum_{k=1..n} k^m.
|
|
40
|
|
|
0, 0, 1, 0, 1, 2, 0, 1, 3, 3, 0, 1, 5, 6, 4, 0, 1, 9, 14, 10, 5, 0, 1, 17, 36, 30, 15, 6, 0, 1, 33, 98, 100, 55, 21, 7, 0, 1, 65, 276, 354, 225, 91, 28, 8, 0, 1, 129, 794, 1300, 979, 441, 140, 36, 9, 0, 1, 257, 2316, 4890, 4425, 2275, 784, 204, 45, 10
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
For the o.g.f.s of the column sequences for this array, see A196837 and the link given there. - Wolfdieter Lang, Oct 15 2011
T(m,n)/n is the m-th moment of the discrete uniform distribution on {1,2,...,n}. - Geoffrey Critzer, Dec 31 2018
T(1,n) divides T(m,n) for odd m. - Franz Vrabec, Dec 23 2020
|
|
REFERENCES
|
J. Faulhaber, Academia Algebrae, Darinnen die miraculosische inventiones zu den höchsten Cossen weiters continuirt und profitirt werden, Augspurg, bey Johann Ulrich Schönigs, 1631.
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: e^x*(e^(x*y)-1)/(e^x-1).
T(m, n) = Zeta(-n, 1) - Zeta(-n, m + 1), for m>=0 and n>=0, where Zeta(z,v) is the Hurwitz zeta function. - Peter Luschny, Nov 16 2008
|
|
EXAMPLE
|
Square array begins:
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ... A001477;
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, ... A000217;
0, 1, 5, 14, 30, 55, 91, 140, 204, 285, ... A000330;
0, 1, 9, 36, 100, 225, 441, 784, 1296, 2025, ... A000537;
0, 1, 17, 98, 354, 979, 2275, 4676, 8772, 15333, ... A000538;
0, 1, 33, 276, 1300, 4425, 12201, 29008, 61776, 120825, ... A000539;
0, 1, 65, 794, 4890, 20515, 67171, 184820, 446964, 978405, ... A000540;
Antidiagonal triangle begins as:
0;
0, 1;
0, 1, 2;
0, 1, 3, 3;
0, 1, 5, 6, 4;
0, 1, 9, 14, 10, 5;
0, 1, 17, 36, 30, 15, 6;
|
|
MAPLE
|
seq(print(seq(Zeta(0, -k, 1)-Zeta(0, -k, n+1), n=0..9)), k=0..6);
# (Produces the square array from the example.) Peter Luschny, Nov 16 2008
# alternative
(bernoulli(m+1, n+1)-bernoulli(m+1))/(m+1) ;
if m = 0 then
%-1 ;
else
% ;
end if;
# simpler:
(bernoulli(m+1, n+1)-bernoulli(m+1, 1))/(m+1) ;
|
|
MATHEMATICA
|
T[m_, n_]:= HarmonicNumber[m, -n]; Flatten[Table[T[m-n, n], {m, 0, 11}, {n, m, 0, -1}]] (* Jean-François Alcover, May 11 2012 *)
|
|
PROG
|
(PARI) T(m, n)=sum(k=0, n, k^m)
(Magma)
T:= func< n, k | n eq 0 select k else (&+[j^n: j in [0..k]]) >;
[T(n-k, k): k in [0..n], n in [0..12]]; // G. C. Greubel, Dec 22 2021
(SageMath)
def T(n, k): return (bernoulli_polynomial(k+1, n+1) - bernoulli_polynomial(1, n+1)) /(n+1)
flatten([[T(n-k, k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Dec 22 2021
|
|
CROSSREFS
|
Rows include A000027, A000217, A000330, A000537, A000538, A000539, A000540, A000541, A000542, A007487, A023002.
Antidiagonals are the rows of triangle A192001.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|