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.

A268936 Number of sequences in {1,...,n}^n with longest increasing subsequence of length n-2.

Table of values

n a(n)
0 0
1 0
2 0
3 10
4 175
5 1131
6 4501
7 13588
8 34245
9 75925
10 152911
11 285726
12 502723
13 841855
14 1352625
15 2098216
16 3157801
17 4629033
18 6630715
19 9305650
20 12823671
21 17384851
22 23222893
23 30608700
24 39854125
25 51315901
26 65399751
27 82564678
28 103327435
29 128267175
30 158030281
31 193335376

List of values

[0, 0, 0, 10, 175, 1131, 4501, 13588, 34245, 75925, 152911, 285726, 502723, 841855, 1352625, 2098216, 3157801, 4629033, 6630715, 9305650, 12823671, 17384851, 23222893, 30608700, 39854125, 51315901, 65399751, 82564678, 103327435, 128267175, 158030281, 193335376]