0,2

Binomial transform of A069038. - Paul Barry (pbarry(AT)wit.ie), Feb 19 2003

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

The 5th corrector line for transforming 2^n offset 0 with a leading 1 into the fibonacci sequence. [From Al Hakanson (hawkuu(AT)gmail.com), Jun 01 2009]

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

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 795.

Milan Janjic, Two Enumerative Functions

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Index entries for sequences related to Chebyshev polynomials.

G.f.: (1-x)/(1-2*x)^6. a(n)= 2^(n-1)*binomial(n+4, n-1)*(n+10)/n, n >= 1, a(0) := 1 - Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Mar 06 2000.

a(n)=2^(n-5)*n(n+1)(n+2)(n+3)(n+9)/15. - Paul Barry (pbarry(AT)wit.ie), Feb 19 2003

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

a(n)= binomial transform of b(n)=(2*n^5+10*n^4+30*n^3+50*n^2+43*n+15)/15 offset 0. a(3)=364. [From Al Hakanson (hawkuu(AT)gmail.com), Jun 01 2009]

a(n)= -A039991(n+10, 10).

First differences of A054849.

Sequence in context: A034196 A092044 A156149 this_sequence A084900 A142015 A123039

Adjacent sequences: A006972 A006973 A006974 this_sequence A006976 A006977 A006978

nonn,easy

Simon Plouffe (simon.plouffe(AT)gmail.com)