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.

A265247 Triangle read by rows: T(n,k) is the number of partitions of n in which the 2nd smallest part is k when the partition has at least 2 distinct parts and 0 otherwise; (n>=1, 0 <= k <= n).

Table of values

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

List of values

[1, 2, 0, 2, 0, 1, 3, 0, 1, 1, 2, 0, 2, 2, 1, 4, 0, 3, 1, 2, 1, 2, 0, 5, 3, 2, 2, 1, 4, 0, 7, 4, 2, 2, 2, 1, 3, 0, 11, 6, 2, 3, 2, 2, 1, 4, 0, 15, 8, 6, 1, 3, 2, 2, 1, 2, 0, 22, 12, 6, 4, 2, 3, 2, 2, 1, 6, 0, 30, 15, 9, 4, 3, 2, 3, 2, 2, 1, 2, 0, 42, 22, 11, 8, 2, 4, 2, 3, 2, 2, 1, 4, 0, 56, 28, 16, 10, 6, 1, 4, 2, 3, 2, 2, 1, 4, 0, 77, 38, 19, 11, 7, 4, 2, 4, 2, 3, 2, 2, 1]