|
Search: id:A058367
|
|
|
| A058367 |
|
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide. |
|
+0
8
|
|
| 1, 1, 1, 1, 1, 7, 8, 9, 10, 11, 12, 19, 27, 36, 46, 57, 69, 88, 115, 151, 197, 254, 323, 411, 526, 677, 874, 1128, 1451, 1862, 2388, 3065, 3939, 5067, 6518, 8380, 10768, 13833, 17772, 22839, 29357, 37737, 48505, 62338, 80110, 102949, 132306, 170043, 218548
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
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 = 1...m-1, a(m) = m+1. The generating function is (x+m*x^m)/(1-x-x^m). Also a(n) = 1 + n*sum(binomial(n-1-(m-1)*i, i-1)/i, i=1..n/m). This gives the number of ways to cover (without overlapping) a ring lattice (or necklace) of n sites with molecules that are m sites wide. Special cases: m=2: A000204, m=3: A001609, m=4: A014097, m=5: A058368, m=6: A058367, m=7: A058366, m=8: A058365, m=9: A058364.
|
|
REFERENCES
|
E. Di Cera and Y. Kong, Theory of multivalent binding in one and two-dimensional lattices, Biophysical Chemistry, Vol. 61 (1996), pp. 107-124.
Y. Kong, General recurrence theory of ligand binding on a three-dimensional lattice, J. Chem. Phys. Vol. 111 (1999), pp. 4790-4799.
|
|
FORMULA
|
a(n) = 1 + n*sum(binomial(n-1-5*i, i-1)/i, i=1..n/6). a(n) = a(n-1) + a(n-6), a(n) = 1 for n = 1..5, a(6) = 7. generating function = (x+6*x^6)/(1-x-x^6).
|
|
EXAMPLE
|
a(6) = 7 because there is one way to put zero molecule to the necklace and 6 ways to put one molecule.
|
|
CROSSREFS
|
Cf. A000079, A003269, A003520, A005708, A005709, A005710.
Adjacent sequences: A058364 A058365 A058366 this_sequence A058368 A058369 A058370
Sequence in context: A120208 A100562 A115841 this_sequence A035703 A065976 A120200
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yong Kong (ykong(AT)curagen.com), Dec 17 2000
|
|
|
Search completed in 0.002 seconds
|
