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.

A335616 a(n) is twice the number of partitions of n into consecutive parts, minus the number of partitions of n into consecutive parts that contain 1 as a part.

Table of values

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

List of values

[1, 2, 3, 2, 4, 3, 4, 2, 6, 3, 4, 4, 4, 4, 7, 2, 4, 6, 4, 4, 7, 4, 4, 4, 6, 4, 8, 3, 4, 8, 4, 2, 8, 4, 8, 5, 4, 4, 8, 4, 4, 8, 4, 4, 11, 4, 4, 4, 6, 6, 8, 4, 4, 8, 7, 4, 8, 4, 4, 8, 4, 4, 12, 2, 8, 7, 4, 4, 8, 8, 4, 6, 4, 4, 12, 4, 8, 7, 4, 4, 10, 4, 4, 8, 8, 4, 8, 4, 4, 12, 7, 4, 8, 4, 8, 4, 4, 6, 12, 6]