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.

A104230 Minimal number of primes needed to sum to n^2.

Table of values

n a(n)
2 2
3 2
4 2
5 2
6 2
7 2
8 2
9 2
10 2
11 3
12 2
13 2
14 2
15 2
16 2
17 3
18 2
19 2
20 2
21 2
22 2
23 3
24 2
25 3
26 2
27 2
28 2
29 2
30 2
31 3
32 2
33 2
34 2
35 2
36 2
37 2
38 2
39 3
40 2
41 3
42 2
43 2
44 2
45 3
46 2
47 2
48 2
49 2
50 2
51 3
52 2
53 3
54 2
55 2
56 2
57 3
58 2
59 3
60 2
61 2
62 2
63 2
64 2
65 3
66 2
67 3
68 2
69 2
70 2

List of values

[2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.