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.

A088910 Conjectured minimal required number k of terms in a representation n=sum_(i=1..k)e_i*(p_i)^2 by distinct primes p_i, where e_i is 1 or -1.

Table of values

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

List of values

[4, 3, 4, 4, 1, 2, 5, 5, 4, 1, 4, 4, 3, 2, 4, 3, 2, 5, 5, 4, 3, 2, 4, 3, 2, 1, 4, 4, 3, 2, 3, 5, 4, 3, 2, 4, 3, 4, 3, 3, 2, 5, 5, 4, 3, 2, 4, 3, 2, 1, 4, 4, 3, 2, 3, 5, 4, 3, 2, 4, 5, 4, 3, 3, 4, 3, 5, 4, 3, 4, 3, 3, 2, 3, 2, 4, 3, 4, 3, 4, 4, 3, 4, 3, 5, 4, 4, 3, 4, 5, 5, 4, 3, 4, 4, 3, 2, 3, 4, 4, 3, 4, 5, 5, 4]