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!)
A321116 Number of permutations p of [n] such that in 0p the largest up-jump equals nine xx and no down-jump is larger than 2. 2
672, 5454, 40272, 283688, 1948408, 13188482, 88469166, 589852620, 3914957358, 25886899652, 170722453774, 1123938295984, 7390061858416, 48546948619410, 318711158282218, 2091405520367970, 13719823343200698, 89986405527666712, 590148303249975384 (list; graph; refs; listen; history; text; internal format)
OFFSET
9,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))(9):
seq(a(n), n=9..30);
CROSSREFS
Column k=9 of A291680.
Sequence in context: A231740 A245778 A245786 * A234481 A234476 A340864
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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)