Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089470
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089470 Self-convolution of this sequence is equal to its hyperbinomial transform, and results in A089471. +0
2
1, 1, 4, 29, 303, 4108, 68165, 1334403, 30056112, 764920823, 21694511367, 678288426792, 23173084581845, 858785085529061, 34311202499100416, 1470080434980994825, 67236889676684657943, 3269565144147886318168 (list; graph; listen)
OFFSET

0,3

COMMENT

See A088956 for the definition of the hyperbinomial transform.

FORMULA

A089471(n) = sum(k=1, n, a(k)*a(n-k)); A089471(n) = sum(k=0, n, (n-k+1)^(n-k-1)*binomial(n, k)*a(k)).

EXAMPLE

The self-convolution at n=4: 303*1+29*1+4*4+1*29+1*303 = 680 = A089471(4), and equals the hyperbinomial transform at n=4: 125*1+64*1+18*4+4*29+1*303 = 680 = A089471(4).

CROSSREFS

Cf. A089471, A088956.

Sequence in context: A083072 A127770 A121630 this_sequence A014622 A067146 A030019

Adjacent sequences: A089467 A089468 A089469 this_sequence A089471 A089472 A089473

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 07 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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research