

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}.


3



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;
refs;
listen;
history;
text;
internal format)



OFFSET

0,7


COMMENTS

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. 755770. NorthHolland, Amsterdam, 1970.


LINKS

Table of n, a(n) for n=0..53.
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119135
Index entries for linear recurrences with constant coefficients, signature (0,0,1,0,1,1).


FORMULA

a(n) = a(n3)+a(n5)+a(n6) G.f.: 1/(x^6+x^5+x^31)


CROSSREFS

Cf. A002524A002529, A072827, A072850A072856, A079955A080014.
Sequence in context: A062242 A062244 A169979 * A202036 A246752 A246650
Adjacent sequences: A079954 A079955 A079956 * A079958 A079959 A079960


KEYWORD

nonn


AUTHOR

Vladimir Baltic, Feb 19 2003


STATUS

approved



