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.

A071335 Number of partitions of n into sum of at most three primes.

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 5, 4, 5, 4, 6, 5, 6, 6, 6, 6, 7, 5, 8, 5, 8, 5, 10, 6, 8, 8, 10, 6, 11, 5, 12, 7, 12, 7, 13, 7, 14, 9, 13, 9, 15, 7, 17, 8, 15, 8, 17, 7, 17, 10, 18, 9, 20, 8, 21, 11, 21, 8, 21, 7, 23, 11, 23, 11, 23, 10, 28, 12, 25, 11, 26]

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

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