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.

A355676 a(n) is the least k such that p(16*k+n) is odd where p is the number of partitions A000041.

Table of values

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

List of values

[0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 5, 2, 0, 0, 0, 3, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 4, 1, 1, 0, 10, 2, 0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 3, 0, 0, 1, 9, 1, 0, 0, 2, 0, 0, 0, 0, 1, 0, 1, 2, 2, 0, 0, 8, 0, 5, 1, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 7, 1, 4, 0, 0, 0, 3, 0, 1, 0, 0, 0]