Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079964
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079964 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,4}. +0
1
1, 0, 1, 1, 2, 2, 5, 5, 10, 13, 22, 30, 50, 70, 112, 163, 254, 375, 579, 862, 1320, 1979, 3015, 4536, 6893, 10392, 15764, 23800, 36064, 54492, 82521, 124748, 188841, 285561, 432174, 653642, 989097, 1496125, 2263754, 3424425, 5181150, 7837946 (list; graph; listen)
OFFSET

0,5

COMMENT

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

CROSSREFS

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

Sequence in context: A091609 A062405 A071181 this_sequence A103891 A005294 A052943

Adjacent sequences: A079961 A079962 A079963 this_sequence A079965 A079966 A079967

KEYWORD

nonn

AUTHOR

Vladimir Baltic (baltic(AT)galeb.etf.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 September 8 13:07 EDT 2008. Contains 143486 sequences.


AT&T Labs Research