login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049612 a(n)=T(n,3), array T as in A049600. 8
0, 1, 5, 19, 63, 192, 552, 1520, 4048, 10496, 26624, 66304, 162560, 393216, 940032, 2224128, 5214208, 12124160, 27983872, 64159744, 146210816, 331350016, 747110400, 1676673024, 3746562048, 8338276352, 18488492032 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

If X_1,X_2,...,X_n are 2-blocks of a (2n+3)-set X then, for n>=1, a(n+1) is the number of (n+3)-subsets of X intersecting each X_i, (i=1,2,...,n). - Milan R. Janjic (agnus(AT)blic.net), Nov 18 2007

LINKS

Milan Janjic, Two Enumerative Functions

Index to sequences with linear recurrences with constant coefficients, signature (8,-24,32,-16)

FORMULA

G.f.: x*(1-x)^3 /(1-2*x)^4.

a(n)=sum{k=0..floor((n+3)/2), C(n+3, 2k)C(k+1, 3) } - Paul Barry (pbarry(AT)wit.ie), May 15 2003

a(n+1)= 2^n*n^3/48 +5*2^n*n^2/16 +7*2^n*n/6 +2^n, n=1,2,... - Milan R. Janjic (agnus(AT)blic.net), Nov 18 2007

Binomial transform of the tetrahedral numbers A000292 when omitting the initial 0 in both sequences. - Carl Najafi, 08 Sep 2011

CROSSREFS

Row sums of triangle A055252. a(n+1)= A055584(n, 0), n >= 0.

Sequence in context: A036677 A003296 A053545 * A001870 A025568 A001047

Adjacent sequences:  A049609 A049610 A049611 * A049613 A049614 A049615

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.