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.

A381895 Triangle read by rows: T(n, k) is the number of partitions of n with at most k parts where 0 <= k <= n, and each part is one of two kinds.

Table of values

n a(n)
0 1
1 0
2 2
3 0
4 2
5 5
6 0
7 2
8 6
9 10
10 0
11 2
12 9
13 15
14 20
15 0
16 2
17 10
18 22
19 30
20 36
21 0
22 2
23 13
24 31
25 48
26 58
27 65
28 0
29 2
30 14
31 40
32 68
33 90
34 102
35 110
36 0
37 2
38 17
39 51
40 97
41 135
42 162
43 176
44 185
45 0
46 2
47 18
48 64
49 128
50 194
51 242
52 274
53 290
54 300
55 0
56 2
57 21
58 77
59 171
60 271
61 357
62 415
63 452
64 470
65 481

List of values

[1, 0, 2, 0, 2, 5, 0, 2, 6, 10, 0, 2, 9, 15, 20, 0, 2, 10, 22, 30, 36, 0, 2, 13, 31, 48, 58, 65, 0, 2, 14, 40, 68, 90, 102, 110, 0, 2, 17, 51, 97, 135, 162, 176, 185, 0, 2, 18, 64, 128, 194, 242, 274, 290, 300, 0, 2, 21, 77, 171, 271, 357, 415, 452, 470, 481]

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

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