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.

A305024 Minimal number of squares, not all equal to 1, having as sum prime(n), such that their squares also sum to a prime; 0 if no such decomposition exists.

Table of values

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

List of values

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