Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096078
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096078 Triangle read by rows: T(n,k) = (k+1)T(n-1,k)+(n-k+1)T(n,k-1). +0
1
1, 1, 1, 1, 4, 4, 1, 11, 34, 34, 1, 26, 180, 496, 496, 1, 57, 768, 4288, 11056, 11056, 1, 120, 2904, 28768, 141584, 349504, 349504, 1, 247, 10194, 166042, 1372088, 6213288, 14873104, 14873104, 1, 502, 34096, 868744, 11204160, 82096368, 350400832 (list; table; graph; listen)
OFFSET

0,5

FORMULA

T(n-1, 1) given by Eulerian numbers, 2^n - n - 1 (A000295). T(n-1, n-1) given by 2^n*(2^{2n} - 1)*|B_{2n}|/n, B_n = Bernoulli numbers (A002105).

EXAMPLE

Table begins:

1

1 1

1 4 4

1 11 34 34

1 26 180 496 496

1 57 768 4288 11056 11056

MATHEMATICA

T[n_, 0] := 1; T[n_, 1] := 2^(n+1) - n - 2; T[n_, n_] := 2^(n+1)*(2^(2n+2) - 1)*Abs[ BernoulliB[2n + 2]]/ (n + 1); T[n_, k_] := (j + 1)T[n - 1, j] + (n - j + 1)T[n, j - 1]); Flatten[ Table[ T[n, k], {n, 0, 8}, {k, 0, n}]] (from Robert G. Wilson v Jul 23 2004)

CROSSREFS

Cf. A000295, A002105.

Sequence in context: A080721 A123588 A106026 this_sequence A140313 A102323 A145902

Adjacent sequences: A096075 A096076 A096077 this_sequence A096079 A096080 A096081

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Boddington (psb(AT)maths.warwick.ac.uk), Jul 22 2004

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 23 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research