Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107417
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107417 C(n+2,2)*C(n+5,5). +0
1
1, 18, 126, 560, 1890, 5292, 12936, 28512, 57915, 110110, 198198, 340704, 563108, 899640, 1395360, 2108544, 3113397, 4503114, 6393310, 8925840, 12273030, 16642340, 22281480, 29484000, 38595375, 50019606, 64226358, 81758656 (list; graph; listen)
OFFSET

0,2

EXAMPLE

If n=0 then C(0+2,2)*C(0+5,5)= C(2,2)*C(5,5)=1*1=1

If n=3 then C(3+2,2)*C(3+5,5)=C(5,2)*C(8,5)=10*56=560

PROGRAM

(PARI) for(n=0, 29, print1(binomial(n+2, 2)*binomial(n+5, 5), ", "))

CROSSREFS

Cf. A062145.

Adjacent sequences: A107414 A107415 A107416 this_sequence A107418 A107419 A107420

Sequence in context: A107971 A002424 A101378 this_sequence A056125 A027566 A041620

KEYWORD

easy,nonn

AUTHOR

Zerinvary Lajos (zlaja(AT)freemail.hu), May 26 2005

EXTENSIONS

More terms from Ricky L. Shepherd (rshepherd2(AT)hotmail.com), May 27 2005

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 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research