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.

A256558 Number of ways to write n = p + floor(k*(k+1)/4), where p is a prime and k is a positive integer.

Table of values

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

List of values

[0, 1, 2, 1, 2, 2, 2, 3, 1, 3, 1, 4, 2, 3, 1, 3, 3, 3, 2, 4, 3, 2, 3, 4, 3, 2, 3, 1, 5, 3, 3, 3, 3, 3, 3, 3, 3, 4, 2, 3, 5, 3, 2, 6, 2, 5, 4, 4, 1, 6, 3, 4, 3, 3, 3, 5, 3, 4, 4, 2, 3, 6, 4, 5, 4, 2, 3, 5, 3, 5, 6, 2, 4, 6, 4, 5, 3, 3, 5, 5, 6, 3, 6, 2, 3, 6, 4, 4, 7, 3, 3, 5, 5, 3, 3, 2, 6, 6, 4, 5]