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.

A144385 Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 0
6 0
7 1
8 3
9 7
10 10
11 10
12 0
13 0
14 0
15 1
16 6
17 25
18 75
19 175
20 280
21 280
22 0
23 0
24 0
25 0
26 1
27 10
28 65
29 315
30 1225
31 3780
32 9100
33 15400
34 15400
35 0
36 0
37 0
38 0
39 0
40 1
41 15
42 140
43 980
44 5565
45 26145
46 102025
47 323400
48 800800
49 1401400
50 1401400
51 0
52 0
53 0
54 0
55 0
56 0
57 1
58 21
59 266
60 2520
61 19425
62 125895
63 695695
64 3273270
65 12962950
66 42042000
67 106506400
68 190590400
69 190590400

List of values

[1, 0, 1, 1, 1, 0, 0, 1, 3, 7, 10, 10, 0, 0, 0, 1, 6, 25, 75, 175, 280, 280, 0, 0, 0, 0, 1, 10, 65, 315, 1225, 3780, 9100, 15400, 15400, 0, 0, 0, 0, 0, 1, 15, 140, 980, 5565, 26145, 102025, 323400, 800800, 1401400, 1401400, 0, 0, 0, 0, 0, 0, 1, 21, 266, 2520, 19425, 125895, 695695, 3273270, 12962950, 42042000, 106506400, 190590400, 190590400]