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.

A080573 Number of ways writing n as a sum of two distinct Ulam numbers.

Table of values

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

List of values

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