Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121673
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121673 a(n) = [x^n] (1 + x*(1+x)^(n-1) )^n. +0
9
1, 1, 3, 16, 131, 1306, 15257, 203967, 3047907, 50115310, 896746169, 17308420306, 357767229778, 7872926416538, 183537476164902, 4513828442107368, 116688468769638435, 3160881019508153238, 89471871451166037425 (list; graph; listen)
OFFSET

0,3

FORMULA

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

EXAMPLE

At n=4, a(4) = [x^4] (1 + x*(1+x)^3 )^4 = 131, since

(1 + x*(1+x)^3 )^4 = 1 + 4*x + 18*x^2 + 52*x^3 + 131*x^4 +...

PROGRAM

(PARI) a(n)=sum(k=0, n, binomial(n, k)*binomial((n-1)*k, n-k))

CROSSREFS

Cf. variants: A121674-A121680.

Adjacent sequences: A121670 A121671 A121672 this_sequence A121674 A121675 A121676

Sequence in context: A135752 A120021 A131490 this_sequence A051921 A023998 A141628

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 15 2006

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 October 12 11:50 EDT 2008. Contains 144830 sequences.


AT&T Labs Research