|
Search: id:A005708
|
|
|
| A005708 |
|
a(n)=a(n-1)+a(n-6).
(Formerly M0496)
|
|
+0
16
|
|
| 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 9, 12, 16, 21, 27, 34, 43, 55, 71, 92, 119, 153, 196, 251, 322, 414, 533, 686, 882, 1133, 1455, 1869, 2402, 3088, 3970, 5103, 6558, 8427, 10829, 13917, 17887, 22990, 29548, 37975, 48804, 62721, 80608, 103598, 133146, 171121, 219925, 282646
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
This comment covers a family of sequences which satisfy a recurrence of the form a(n) = a(n-1) + a(n-m), with a(n) = 1 for n = 0...m-1. The generating function is 1/(1-x-x^m). Also a(n) = sum(binomial(n-(m-1)*i, i), i=0..n/m). This family of binomial summations or recurrences gives the number of ways to cover (without overlapping) a linear lattice of n sites with molecules that are m sites wide. Special case: m=1: A000079; m=4: A003269; m=5: A003520; m=6: A005708; m=7: A005709; m=8: A005710.
|
|
REFERENCES
|
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.
E. Di Cera and Y. Kong, Theory of multivalent binding in one and two-dimensional lattices, Biophysical Chemistry, Vol. 61 (1996), pp. 107-124.
Problem E3274, Amer. Math. Monthly, 95 (1988), 555.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..500
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.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 379
|
|
MAPLE
|
with(combstruct): SeqSetU := [S, {S=Sequence(U), U=Set(Z, card > 5)}, unlabeled]: seq(count(SeqSetU, size=j), j=6..59); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 10 2006
A005708:=-1/(-1+z+z**6); [Conjectured by S. Plouffe in his 1992 dissertation.]
ZL:=[S, {a = Atom, b = Atom, S = Prod(X, Sequence(Prod(X, b))), X = Sequence(b, card >= 5)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=5..58); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 26 2008
|
|
CROSSREFS
|
Cf. A000045, A000079, A000930, A003269, A003520, A005709, A005710, A005711.
Adjacent sequences: A005705 A005706 A005707 this_sequence A005709 A005710 A005711
Sequence in context: A126327 A098132 A017900 this_sequence A085793 A033072 A030287
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Mohammad K. Azarian (ma3(AT)evansville.edu)
Additional comments from Yong Kong (ykong(AT)curagen.com), Dec 16 2000
|
|
|
Search completed in 0.003 seconds
|
