cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A320290 Number of permutations p of [2n] such that in 0p the largest up-jump equals n and no down-jump is larger than 2.

Table of values

n a(n)
0 1
1 1
2 9
3 156
4 3098
5 69274
6 1626122
7 39892080
8 1004867492
9 25886899652
10 677767802220
11 17984050212906
12 482214668573802
13 13042214648300918
14 355247290177412584
15 9733704443846822462
16 268026951144933433138
17 7411550898419782031320
18 205686202884689885529314

List of values

[1, 1, 9, 156, 3098, 69274, 1626122, 39892080, 1004867492, 25886899652, 677767802220, 17984050212906, 482214668573802, 13042214648300918, 355247290177412584, 9733704443846822462, 268026951144933433138, 7411550898419782031320, 205686202884689885529314]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.