0,2

If X_1,X_2,...,X_n are 2-blocks of a (2n+1)-set X then a(n-2) 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

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.

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.

Jones, C. W.; Miller, J. C. P.; Conn, J. F. C.; Pankhurst, R. C.; Tables of Chebyshev polynomials. Proc. Roy. Soc. Edinburgh. Sect. A. 62, (1946). 187-203.

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, December 1972 [alternative scanned copy].

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.

Index entries for sequences related to Chebyshev polynomials.

G.f.: (1-x)/(1-2x)^4. a(n-1) = 2^(n-3)*n*(n+1)*(n+5)/3.

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

With a leading zero, the binomial transform of A000330. - Paul Barry (pbarry(AT)wit.ie), Jul 19 2003

Sum{i=0..j, sum{k=0..i, k^2}*binomial(j, i)}. - Jon Perry (perry(AT)globalnet.co.uk), Feb 26 2004

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

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

Sequence in context: A013656 A067982 A126562 this_sequence A140289 A133107 A034360

Adjacent sequences: A001791 A001792 A001793 this_sequence A001795 A001796 A001797

nonn,easy

njas

More terms from Joe Keane (jgk(AT)jgk.org), Nov 24 2001