|
Search: id:A079957
|
|
|
| A079957 |
|
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={0,1,3}. |
|
+0
1
|
|
| 1, 0, 0, 1, 0, 1, 2, 0, 2, 3, 1, 5, 5, 3, 10, 9, 9, 20, 17, 22, 39, 35, 51, 76, 74, 112, 150, 160, 239, 300, 346, 501, 610, 745, 1040, 1256, 1592, 2151, 2611, 3377, 4447, 5459, 7120, 9209, 11447, 14944, 19115, 24026, 31273, 39771, 50417, 65332, 82912, 105716
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
Number of compositions (ordered partitions) of n into elements of the set {3,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-3)+a(n-5)+a(n-6) G.f.: -1/(x^6+x^5+x^3-1)
|
|
CROSSREFS
|
Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
Adjacent sequences: A079954 A079955 A079956 this_sequence A079958 A079959 A079960
Sequence in context: A082490 A062242 A062244 this_sequence A104513 A033769 A074660
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladimir Baltic (baltic(AT)galeb.etf.bg.ac.yu), Feb 19 2003
|
|
|
Search completed in 0.002 seconds
|
