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.

A363342 Array read by descending antidiagonals. A(n,k), n > 1 and k > 0, is the least m such that the number of partitions of m into n distinct prime parts is exactly k, or -1 if no such number exists.

Table of values

n a(n)
2 5
3 16
4 10
5 24
6 18
7 17
8 36
9 26
10 23
11 28
12 48
13 31
14 29
15 34
16 41
17 60
18 35
19 33
20 -1
21 47
22 58
23 78
24 39
25 37
26 40
27 70
28 64
29 77
30 84
31 80
32 41
33 55
34 53
35 72
36 87
37 100

List of values

[5, 16, 10, 24, 18, 17, 36, 26, 23, 28, 48, 31, 29, 34, 41, 60, 35, 33, -1, 47, 58, 78, 39, 37, 40, 70, 64, 77, 84, 80, 41, 55, 53, 72, 87, 100]