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.

A309247 a(n) = Sum_{k=0..n} (p(n,k) mod 2), where p(n,k) = number of partitions of n into k parts.

Table of values

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

List of values

[1, 1, 2, 3, 3, 3, 5, 5, 6, 6, 8, 8, 9, 7, 11, 12, 11, 11, 13, 12, 9, 14, 12, 13, 13, 12, 14, 16, 16, 19, 16, 18, 21, 19, 24, 23, 21, 17, 23, 23, 24, 23, 26, 25, 25, 24, 28, 20, 25, 25, 28, 29, 27, 27, 29, 28, 35, 28, 30, 30, 29, 31, 32, 33, 30, 32, 36, 35, 35, 35, 40, 35, 41, 41, 38, 42, 43]