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.

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

Table of values

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

List of values

[3, 5, 2, 7, 4, 3, 2, 2, 9, 5, 4, 6, 3, 3, 3, 3, 2, 2, 2, 2, 11, 6, 5, 7, 4, 8, 3, 4, 4, 3, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 13, 7, 6, 8, 5, 9, 4, 5, 4, 4, 10, 3, 5, 5, 3, 6, 4, 3, 7, 3, 3, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]

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

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