Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079961 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,4}. +0
1
1, 1, 1, 2, 4, 6, 10, 17, 28, 46, 77, 128, 212, 352, 585, 971, 1612, 2677, 4445, 7380, 12254, 20347, 33784, 56095, 93141, 154652, 256785, 426368, 707945, 1175477, 1951771, 3240736, 5380943, 8934559, 14835011, 24632167, 40899440, 67909746 (list; graph; listen)
OFFSET

0,4

COMMENT

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

CROSSREFS

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

Sequence in context: A107742 A004695 A014216 this_sequence A018164 A025052 A098197

Adjacent sequences: A079958 A079959 A079960 this_sequence A079962 A079963 A079964

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research