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.

A264078 The maximal number of standard Young tableaux without a succession v, v+1 in a row that a single partition of n can have.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 6
7 14
8 30
9 76
10 170
11 553
12 1583
13 5106
14 14090
15 41002
16 164769
17 603513
18 2418348
19 8335804
20 28704417
21 109618261
22 466318442
23 2114095511
24 10276979159
25 43213859606
26 175668903294
27 793946150358
28 3490939879402
29 15500974371599
30 82490059523125

List of values

[1, 1, 1, 1, 2, 3, 6, 14, 30, 76, 170, 553, 1583, 5106, 14090, 41002, 164769, 603513, 2418348, 8335804, 28704417, 109618261, 466318442, 2114095511, 10276979159, 43213859606, 175668903294, 793946150358, 3490939879402, 15500974371599, 82490059523125]