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.

A292745 Number A(n,k) of partitions of n with k sorts of part 1 which are introduced in ascending order; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 2, 1, 1, 3, 6, 5, 2, 1, 1, 3, 7, 13, 7, 4, 1, 1, 3, 7, 19, 26, 11, 4, 1, 1, 3, 7, 20, 52, 54, 15, 7, 1, 1, 3, 7, 20, 62, 151, 108, 22, 8, 1, 1, 3, 7, 20, 63, 217, 442, 219, 30, 12, 1, 1, 3, 7, 20, 63, 232, 803, 1314, 439, 42, 14]