Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006095
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006095 Gaussian binomial coefficient [n,2] for q=2.
(Formerly M4415)
+0
22
0, 0, 1, 7, 35, 155, 651, 2667, 10795, 43435, 174251, 698027, 2794155, 11180715, 44731051, 178940587, 715795115, 2863245995, 11453115051, 45812722347, 183251413675, 733006703275, 2932028910251, 11728119835307, 46912487729835 (list; graph; listen)
OFFSET

0,4

COMMENT

Number of 4-block coverings of an n-set where every element of the set is covered by exactly 3 blocks (if offset is 3), so a(n)=(1/4!)*(4^n-6*2^n+8) - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 20 2001

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p, 99.

M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.

LINKS

T. D. Noe, Table of n, a(n) for n=0..200

Index entries for sequences related to linear recurrences with constant coefficients

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

FORMULA

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

a(n) = (2^n - 1)*(2^(n-1) - 1)/3 = (1/6)*(4^n) - 2^(n-1) + (1/3).

Row sums of triangle A130324. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 24 2007

a(n)=stirling2(n,3)+stirling2(n,4), n>=1 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 04 2007

EXAMPLE

a(n)=sum{k=0..n-1, C(n+k-1,2k)*2^(n-k-1)}+0^n/2. [From Paul Barry (pbarry(AT)wit.ie), Oct 23 2009]

MAPLE

a:=n->sum((4^(n-j)-2^(n-j))/2, j=0..n): seq(a(n), n=-1..23); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 04 2007

with(combinat):seq(stirling2(n, 3)+stirling2(n, 4), n=1..25); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 04 2007

A006095:=-1/(z-1)/(2*z-1)/(4*z-1); [Conjectured by S. Plouffe in his 1992 dissertation.]

PROGRAM

(Other) sage: [gaussian_binomial(n, 2, 2) for n in xrange(0, 25)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 24 2009]

CROSSREFS

First differences: A006516. Cf. also A075113.

Cf. A016208, A000392, A000225, A003462, A003463, A003464, A023000, A023001, A002452, A002275, A016123, A016125, A016256.

Cf. A130324.

Sequence in context: A022635 A000588 A005285 this_sequence A005003 A163348 A037099

Adjacent sequences: A006092 A006093 A006094 this_sequence A006096 A006097 A006098

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.003 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research