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.

A262976 Number of ordered ways to write n as 2^x + y^2 + pi(z^2) with x >= 0, y >= 0 and z > 0, where pi(m) denotes the number of primes not exceeding m.

Table of values

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

List of values

[1, 2, 2, 3, 4, 4, 4, 6, 4, 6, 6, 7, 6, 7, 5, 6, 10, 5, 9, 10, 7, 7, 9, 9, 4, 12, 10, 9, 8, 7, 10, 9, 10, 7, 15, 10, 6, 13, 10, 9, 10, 16, 10, 10, 9, 8, 15, 9, 8, 15, 12, 12, 7, 12, 11, 14, 12, 8, 16, 6, 10, 11, 14, 8, 11, 17, 10, 16, 9, 13, 16, 15, 8, 18, 13, 10, 14, 10, 12, 16, 12, 13, 18, 11, 9, 17, 17, 9, 15, 16, 15, 9, 12, 12, 17, 12, 9, 21, 10, 11]