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.

A259940 Let A={A005574(n)}, the set of all numbers n for which n^2+1 is prime. The sequence lists the number of decompositions A005574(n) = A005574(n1) + A005574(n2) for some n1, n2 and every A005574(n)>1.

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 2, 3, 2, 3, 2, 4, 1, 3, 2, 1, 1, 4, 4, 5, 2, 5, 3, 5, 8, 5, 5, 8, 6, 7, 7, 6, 7, 6, 6, 5, 8, 7, 8, 7, 11, 12, 6, 12, 8, 11, 12, 8, 11, 9, 8, 10, 13, 11, 6, 10, 8, 12, 11, 13, 12, 10, 17, 9, 8, 10, 13, 11, 15, 11, 9, 8, 14, 13, 12, 8, 8, 7, 9, 7]