Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088957
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088957 Hyperbinomial transform of the sequence of 1's. +0
6
1, 2, 6, 29, 212, 2117, 26830, 412015, 7433032, 154076201, 3608522954, 94238893883, 2715385121740, 85574061070045, 2928110179818478, 108110945014584623, 4284188833355367440, 181370804507130015569 (list; graph; listen)
OFFSET

0,2

COMMENT

See A088956 for the definition of the hyperbinomial transform.

FORMULA

a(n) = sum(k=0, n, (n-k+1)^(n-k-1)*C(n, k)). E.g.f. A(x) = exp(x+sum(n>=1, n^(n-1)*x^n/n!)).

E.g.f.: -LambertW(-x)*exp(x)/x. - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 27 2003

EXAMPLE

a(5) = 1296+625+160+30+5+1 = sum of row 5 of triangle A088956.

CROSSREFS

Cf. A088956 (triangle).

Row sums of A144289. [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jun 01 2009]

Sequence in context: A107375 A020126 A124529 this_sequence A030538 A076978 A079615

Adjacent sequences: A088954 A088955 A088956 this_sequence A088958 A088959 A088960

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 26 2003

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research