login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291556 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) = (n!)^k * Sum_{i=1..n} 1/i^k. 12

%I #26 May 11 2019 10:10:57

%S 0,0,1,0,1,2,0,1,3,3,0,1,5,11,4,0,1,9,49,50,5,0,1,17,251,820,274,6,0,

%T 1,33,1393,16280,21076,1764,7,0,1,65,8051,357904,2048824,773136,13068,

%U 8,0,1,129,47449,8252000,224021776,444273984,38402064,109584,9

%N Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) = (n!)^k * Sum_{i=1..n} 1/i^k.

%H Seiichi Manyama, <a href="/A291556/b291556.txt">Antidiagonals n = 0..59, flattened</a>

%F A(0, k) = 0, A(1, k) = 1, A(n+1, k) = (n^k+(n+1)^k)*A(n, k) - n^(2*k)*A(n-1, k).

%e Square array begins:

%e 0, 0, 0, 0, 0, ...

%e 1, 1, 1, 1, 1, ...

%e 2, 3, 5, 9, 17, ...

%e 3, 11, 49, 251, 1393, ...

%e 4, 50, 820, 16280, 357904, ...

%p A:= (n, k)-> n!^k * add(1/i^k, i=1..n):

%p seq(seq(A(n, d-n), n=0..d), d=0..10); # _Alois P. Heinz_, Aug 26 2017

%t A[0, _] = 0; A[1, _] = 1; A[n_, k_] := A[n, k] = ((n-1)^k + n^k) A[n-1, k] - (n-1)^(2k) A[n-2, k];

%t Table[A[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* _Jean-François Alcover_, May 11 2019 *)

%Y Columns k=0-10 give: A001477, A000254, A001819, A066989, A203229, A099827, A291456, A291505, A291506, A291507, A291508.

%Y Rows n=0-3 give: A000004, A000012, A000051, A074528.

%Y Main diagonal gives A060943.

%K nonn,tabl

%O 0,6

%A _Seiichi Manyama_, Aug 26 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)