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.

A090677 Number of ways to partition n into sums of squares of primes.

Table of values

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

List of values

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