Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079956
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079956 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,4}. +0
1
1, 0, 0, 1, 1, 0, 2, 2, 1, 3, 5, 3, 6, 10, 9, 12, 21, 22, 27, 43, 52, 61, 91, 117, 140, 195, 260, 318, 426, 572, 718, 939, 1258, 1608, 2083, 2769, 3584, 4630, 6110, 7961, 10297, 13509, 17655, 22888, 29916, 39125, 50840, 66313, 86696, 112853, 147069, 192134 (list; graph; listen)
OFFSET

0,7

COMMENT

Number of compositions (ordered partitions) of n into elements of the set {3,4,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-4)+a(n-6) G.f.: -1/(x^6+x^4+x^3-1)

CROSSREFS

Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.

Sequence in context: A139375 A106198 A054336 this_sequence A140717 A026300 A099514

Adjacent sequences: A079953 A079954 A079955 this_sequence A079957 A079958 A079959

KEYWORD

nonn

AUTHOR

Vladimir Baltic (baltic(AT)matf.bg.ac.yu), Feb 19 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research