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.

A103765 Number of times n can be written as sum of a minimal set of primes.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 3, 1, 3, 6, 2, 1, 3, 1, 2, 1, 4, 7, 4, 1, 2, 1, 3, 1, 4, 1, 3, 1, 4, 1, 5, 1, 4, 14, 3, 1, 5, 1, 3, 16, 4, 1, 6, 1, 3, 1, 5, 20, 6, 1, 2, 1, 5, 1, 6, 1, 5, 1, 5, 27, 7, 1, 4, 1, 5, 1, 8, 1, 5, 28, 4, 1, 9, 1, 4, 32, 5, 35, 7, 1, 3, 1, 6, 1, 8, 1]