login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215079 T(n,k) = k^n * sum(binomial(n,n-k-j),j=0..n-k) 2
1, 0, 1, 0, 3, 4, 0, 7, 32, 27, 0, 15, 176, 405, 256, 0, 31, 832, 3888, 6144, 3125, 0, 63, 3648, 30618, 90112, 109375, 46656, 0, 127, 15360, 216513, 1048576, 2265625, 2239488, 823543, 0, 255, 63232, 1436859, 10682368, 36328125, 62145792, 51883209, 16777216, 0, 511, 257024, 9172278, 100139008, 500000000, 1310100480, 1856265922, 1342177280, 387420489, 0, 1023, 1037312, 57159432, 889192448, 6230468750, 23339943936, 49715643824, 60129542144, 38354628411, 10000000000 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Initial term T(0,0) may be computed as 0, depending on formula and convention.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

FORMULA

T(n,k) = k^n * sum(binomial(n,n-k-j),j=0..n-k)

T(n,k) = k^n * binomial(n,n-k) * 2F1(1, k-n; k+1)(-1)

MATHEMATICA

Flatten[Table[Table[Sum[k^n*Binomial[n, n - k - j], {j, 0, n - k}],  {k, 0, n}], {n, 0, 10}], 1]

CROSSREFS

Row sums sequence is A215077.

Product of A055248 and A089072 (with an initial 0 in each row).

Sequence in context: A276563 A011338 A214024 * A049251 A308642 A158674

Adjacent sequences:  A215076 A215077 A215078 * A215080 A215081 A215082

KEYWORD

nonn,tabl

AUTHOR

Olivier Gérard, Aug 02 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 1 03:14 EDT 2020. Contains 334758 sequences. (Running on oeis4.)