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.

A262495 Number T(n,k) of partitions of n into parts of exactly k sorts which are introduced in ascending order such that sorts of adjacent parts are different; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 2
9 1
10 0
11 1
12 4
13 4
14 1
15 0
16 1
17 6
18 12
19 7
20 1
21 0
22 1
23 10
24 31
25 33
26 11
27 1
28 0
29 1
30 14
31 73
32 130
33 77
34 16
35 1
36 0
37 1
38 21
39 165
40 464
41 438
42 157
43 22
44 1
45 0
46 1
47 29
48 357
49 1558
50 2216
51 1223
52 289
53 29
54 1
55 0
56 1
57 41
58 760
59 5039
60 10423
61 8331
62 2957
63 492
64 37
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 4, 4, 1, 0, 1, 6, 12, 7, 1, 0, 1, 10, 31, 33, 11, 1, 0, 1, 14, 73, 130, 77, 16, 1, 0, 1, 21, 165, 464, 438, 157, 22, 1, 0, 1, 29, 357, 1558, 2216, 1223, 289, 29, 1, 0, 1, 41, 760, 5039, 10423, 8331, 2957, 492, 37, 1]