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.

A182812 Triangle read by rows in which row n lists the parts of the largest subshell of all partitions of 2n that do not contain 1 as a part.

Table of values

n a(n)
1 2
2 4
3 2
4 6
5 3
6 3
7 2
8 2
9 8
10 4
11 4
12 5
13 3
14 2
15 2
16 2
17 2
18 10
19 5
20 5
21 6
22 4
23 7
24 3
25 4
26 3
27 3
28 2
29 2
30 2
31 2
32 2
33 2
34 2
35 12
36 6
37 6
38 7
39 5
40 8
41 4
42 4
43 4
44 4
45 9
46 3
47 5
48 4
49 3
50 6
51 3
52 3
53 3
54 3
55 3
56 3
57 2
58 2
59 2
60 2
61 2
62 2
63 2
64 2
65 2
66 2
67 2
68 2
69 14
70 7
71 7
72 8
73 6
74 9
75 5

List of values

[2, 4, 2, 6, 3, 3, 2, 2, 8, 4, 4, 5, 3, 2, 2, 2, 2, 10, 5, 5, 6, 4, 7, 3, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 12, 6, 6, 7, 5, 8, 4, 4, 4, 4, 9, 3, 5, 4, 3, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 14, 7, 7, 8, 6, 9, 5]

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

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