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.

A264047 Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of integer partitions lambda of n such that there are k compositions mu such that the Gelfand-Tsetlin polytope for lambda and mu is non-integral.

Table of values

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

List of values

[1, 1, 2, 3, 5, 5, 2, 6, 3, 0, 1, 0, 0, 1, 7, 1, 0, 0, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 1, 1, 8, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]