The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321115 Number of permutations p of [n] such that in 0p the largest up-jump equals eight and no down-jump is larger than 2. 2
218, 1672, 11840, 80724, 540122, 3577200, 23538730, 154134422, 1004867492, 6532643538, 42400841816, 274916251180, 1781266093356, 11536471789526, 74699007947826, 483632170943926, 3131266103627660, 20275073235017968, 131300482646184366, 850449366760216588 (list; graph; refs; listen; history; text; internal format)
OFFSET
8,1
LINKS
MAPLE
b:= proc(u, o, k) option remember; `if`(u+o=0, 1,
add(b(u-j, o+j-1, k), j=1..min(2, u))+
add(b(u+j-1, o-j, k), j=1..min(k, o)))
end:
a:= n-> (k-> b(0, n, k)-b(0, n, k-1))(8):
seq(a(n), n=8..30);
CROSSREFS
Column k=8 of A291680.
Sequence in context: A253733 A241102 A292545 * A253732 A232513 A224741
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Oct 27 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 04:26 EDT 2024. Contains 373468 sequences. (Running on oeis4.)