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.

A261013 Irregular triangle read by rows: T(n,k) = number of partitions of n into prime parts in which the largest part is the k-th prime.

Table of values

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

List of values

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