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.

A248475 Number of pairs of partitions of n that are successors in reverse lexicographic order, but incomparable in dominance (natural, majorization) ordering.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 2
7 3
8 4
9 6
10 9
11 12
12 17
13 22
14 30
15 39
16 51
17 65
18 85
19 107
20 136
21 171
22 216
23 268
24 335
25 413
26 512
27 629
28 772
29 941
30 1151
31 1396
32 1694
33 2046
34 2471
35 2969
36 3569
37 4271
38 5110
39 6093
40 7258
41 8620
42 10235
43 12113
44 14325
45 16902
46 19925
47 23434
48 27540
49 32296
50 37842
51 44260
52 51715
53 60322
54 70306
55 81805

List of values

[0, 0, 0, 0, 0, 2, 3, 4, 6, 9, 12, 17, 22, 30, 39, 51, 65, 85, 107, 136, 171, 216, 268, 335, 413, 512, 629, 772, 941, 1151, 1396, 1694, 2046, 2471, 2969, 3569, 4271, 5110, 6093, 7258, 8620, 10235, 12113, 14325, 16902, 19925, 23434, 27540, 32296, 37842, 44260, 51715, 60322, 70306, 81805]

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

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