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.

A213952 Consider the partitions of n in reverse lexicographic ordering (A080577), a(n) is the position of the partition of n which has the maximum LCM. See A000793.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 5
8 5
9 8
10 15
11 13
12 33
13 49
14 35
15 49
16 73
17 107
18 143
19 211
20 293
21 398
22 505
23 510
24 685
25 710
26 948
27 740
28 994
29 2033
30 1735
31 2266
32 1780
33 2333
34 4653
35 5923
36 7311
37 9213
38 7683
39 9719
40 17878
41 14703
42 19072
43 22814
44 28266
45 34878
46 42876
47 52390

List of values

[1, 1, 1, 1, 3, 1, 5, 5, 8, 15, 13, 33, 49, 35, 49, 73, 107, 143, 211, 293, 398, 505, 510, 685, 710, 948, 740, 994, 2033, 1735, 2266, 1780, 2333, 4653, 5923, 7311, 9213, 7683, 9719, 17878, 14703, 19072, 22814, 28266, 34878, 42876, 52390]