|
Search: id:A079963
|
|
|
| A079963 |
|
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={1,2}. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 4, 7, 10, 14, 21, 34, 55, 86, 131, 200, 310, 485, 757, 1174, 1815, 2810, 4362, 6778, 10524, 16323, 25310, 39260, 60924, 94549, 146706, 227599, 353093, 547826, 850005, 1318859, 2046257, 3174775, 4925699, 7642389, 11857510
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Number of compositions (ordered partitions) of n into elements of the set {1,4,5,6}.
|
|
REFERENCES
|
D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.
|
|
FORMULA
|
Recurrence: a(n) = a(n-1)+a(n-4)+a(n-5)+a(n-6) G.f.: -1/(x^6+x^5+x^4+x-1)
|
|
CROSSREFS
|
Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
Sequence in context: A024536 A094281 A076101 this_sequence A056750 A095116 A027384
Adjacent sequences: A079960 A079961 A079962 this_sequence A079964 A079965 A079966
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladimir Baltic (baltic(AT)matf.bg.ac.yu), Feb 19 2003
|
|
|
Search completed in 0.002 seconds
|
