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.

A264051 Triangle read by rows: T(n,k) (n>=0, 0<=k<=A264078(n)) is the number of integer partitions of n having k standard Young tableaux such that no entries i and i+1 appear in the same row.

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 1
5 1
6 1
7 2
8 2
9 2
10 1
11 2
12 3
13 0
14 2
15 4
16 2
17 1
18 1
19 1
20 1
21 1
22 4
23 3
24 1
25 0
26 0
27 2
28 2
29 0
30 1
31 0
32 1
33 0
34 0
35 0
36 1
37 7
38 2
39 0
40 0
41 1
42 0
43 3
44 0
45 1
46 0
47 2
48 1
49 0
50 0
51 0
52 1
53 1
54 0
55 1
56 0
57 0
58 0
59 0
60 0
61 0
62 0
63 0
64 0
65 1
66 0
67 1
68 7
69 3
70 1
71 2
72 0
73 0
74 1
75 2
76 0
77 0
78 1
79 0
80 0
81 0
82 0
83 1
84 0
85 0
86 0
87 0
88 0
89 1
90 0
91 1
92 1
93 0
94 0
95 0
96 1
97 0
98 0
99 0
100 0
101 1
102 1
103 1

List of values

[0, 1, 0, 1, 1, 1, 1, 2, 2, 2, 1, 2, 3, 0, 2, 4, 2, 1, 1, 1, 1, 1, 4, 3, 1, 0, 0, 2, 2, 0, 1, 0, 1, 0, 0, 0, 1, 7, 2, 0, 0, 1, 0, 3, 0, 1, 0, 2, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 7, 3, 1, 2, 0, 0, 1, 2, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1]