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.

A366063 Irregular triangle read by rows: T(n,k) is the number of partitions of n that have depth k.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 2
7 2
8 1
9 3
10 4
11 0
12 4
13 6
14 1
15 5
16 9
17 1
18 6
19 11
20 4
21 1
22 8
23 20
24 2
25 0
26 10
27 25
28 7
29 0
30 12
31 37
32 6
33 1
34 15
35 47
36 13
37 2
38 18
39 67
40 15
41 1
42 22
43 85
44 25
45 3
46 27
47 122
48 26
49 1
50 32
51 142
52 46
53 10
54 1
55 38
56 200
57 53
58 6
59 0
60 46
61 259
62 74
63 6
64 0
65 54
66 330
67 92
68 13
69 1
70 64
71 412
72 136

List of values

[1, 1, 1, 2, 1, 2, 2, 1, 3, 4, 0, 4, 6, 1, 5, 9, 1, 6, 11, 4, 1, 8, 20, 2, 0, 10, 25, 7, 0, 12, 37, 6, 1, 15, 47, 13, 2, 18, 67, 15, 1, 22, 85, 25, 3, 27, 122, 26, 1, 32, 142, 46, 10, 1, 38, 200, 53, 6, 0, 46, 259, 74, 6, 0, 54, 330, 92, 13, 1, 64, 412, 136]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.