login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095677 Triangle T(n,k), 0<=k<=n, read by rows, defined by Sum_{k = 0..n} T(n,k)*x^k = Sum_{k = 0..n} binomial(n,k)*(x+k)^n. 0
1, 1, 2, 6, 8, 4, 54, 72, 36, 8, 680, 896, 480, 128, 16, 11000, 14400, 8000, 2400, 400, 32, 217392, 283392, 161280, 51840, 10080, 1152, 64, 5076400, 6598144, 3819648, 1285760, 274400, 37632, 3136, 128, 136761984, 177373184, 103993344 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..38.

FORMULA

T(n, k) = binomial(n, k)*Sum_{j = 0..n} = binomial(n, j)*j^(n-k).

T(n, n) = 2^n, see A000079.

T(n+1, n) = (n+1)^2*2^n, see A014477.

T(n, 0) = n*Sum_{k = 0..n-1} T(n-1, k).

EXAMPLE

1; 1, 2; 6, 8, 4; 54, 72, 36, 8; 680, 896, 480, 128, 16; ...

CROSSREFS

Sequence in context: A117932 A073411 A121862 * A011045 A002210 A145500

Adjacent sequences:  A095674 A095675 A095676 * A095678 A095679 A095680

KEYWORD

nonn,tabl

AUTHOR

Philippe Deléham Jul 04 2004

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 October 15 03:04 EDT 2019. Contains 328025 sequences. (Running on oeis4.)