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.

A277045 Irregular triangle T(n,k) read by rows giving the number of partitions of length k such that all of the members of the partition are distinct and in A003586.

Table of values

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

List of values

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