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.

A287965 Smallest number which can be represented as the sum of distinct squares of primes in exactly n ways, or 0 if no such integer exists.

Table of values

n a(n)
1 4
2 410
3 1014
4 1494
5 1685
6 2188
7 2335
8 2573
9 2717
10 2863
11 3054
12 3389
13 3224
14 3654
15 3534
16 4014
17 4232
18 4183
19 4254
20 4064
21 4589
22 4618
23 4544
24 4593
25 4903
26 5193
27 5503
28 5215
29 5579
30 5433
31 5455
32 5673
33 5962
34 5983
35 6158
36 6178
37 5744
38 5864
39 5984
40 5913
41 6223
42 6273
43 6678
44 6393
45 6442
46 6513
47 6870
48 6535
49 7038
50 7015

List of values

[4, 410, 1014, 1494, 1685, 2188, 2335, 2573, 2717, 2863, 3054, 3389, 3224, 3654, 3534, 4014, 4232, 4183, 4254, 4064, 4589, 4618, 4544, 4593, 4903, 5193, 5503, 5215, 5579, 5433, 5455, 5673, 5962, 5983, 6158, 6178, 5744, 5864, 5984, 5913, 6223, 6273, 6678, 6393, 6442, 6513, 6870, 6535, 7038, 7015]