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.

A326688 Sum of the largest parts of the partitions of n into 10 primes.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 2
21 3
22 3
23 8
24 8
25 15
26 20
27 20
28 27
29 43
30 50
31 67
32 83
33 85
34 116
35 144
36 164
37 202
38 253
39 254
40 341
41 385
42 448
43 485
44 600
45 609
46 779
47 827
48 957
49 1017
50 1281
51 1230
52 1586
53 1584
54 1890
55 1944
56 2411
57 2301
58 2956
59 2840
60 3483

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 3, 8, 8, 15, 20, 20, 27, 43, 50, 67, 83, 85, 116, 144, 164, 202, 253, 254, 341, 385, 448, 485, 600, 609, 779, 827, 957, 1017, 1281, 1230, 1586, 1584, 1890, 1944, 2411, 2301, 2956, 2840, 3483]