Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079965
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079965 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,3}. +0
1
1, 0, 1, 1, 1, 3, 3, 5, 8, 10, 17, 24, 35, 54, 77, 116, 172, 252, 377, 555, 822, 1220, 1801, 2671, 3953, 5849, 8666, 12823, 18987, 28113, 41612, 61615, 91214, 135037, 199929, 295976, 438193, 648734, 960420, 1421893, 2105059, 3116482, 4613879, 6830695 (list; graph; listen)
OFFSET

0,6

COMMENT

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

CROSSREFS

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

Sequence in context: A015723 A116645 A039872 this_sequence A098353 A073060 A087343

Adjacent sequences: A079962 A079963 A079964 this_sequence A079966 A079967 A079968

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research