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.

A323718 Array read by antidiagonals upwards where A(n,k) is the number of k-times partitions of n.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 5, 6, 4, 1, 1, 1, 7, 15, 10, 5, 1, 1, 1, 11, 28, 34, 15, 6, 1, 1, 1, 15, 66, 80, 65, 21, 7, 1, 1, 1, 22, 122, 254, 185, 111, 28, 8, 1, 1, 1, 30, 266, 604, 739, 371, 175, 36, 9, 1, 1, 1, 42, 503, 1785, 2163, 1785, 672, 260, 45, 10, 1, 1]