Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079958 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={3,4}. +0
1
1, 1, 2, 4, 7, 13, 25, 46, 86, 161, 300, 560, 1046, 1952, 3644, 6803, 12699, 23706, 44254, 82611, 154215, 287883, 537408, 1003212, 1872757, 3495988, 6526172, 12182800, 22742368, 42454552, 79252477, 147945385, 276178586, 515559248 (list; graph; listen)
OFFSET

0,3

COMMENT

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

CROSSREFS

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

Sequence in context: A102113 A034440 A000074 this_sequence A018082 A018083 A108361

Adjacent sequences: A079955 A079956 A079957 this_sequence A079959 A079960 A079961

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research