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.

A259095 Triangle read by rows: T(n,r) = number of arrangements of n pennies in rows, with r contiguous pennies in the bottom row, and each higher row consisting of contiguous pennies, each touching two pennies in the row below (1 <= r <= n).

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 0, 2, 1, 0, 0, 1, 3, 1, 0, 0, 1, 2, 4, 1, 0, 0, 0, 3, 3, 5, 1, 0, 0, 0, 2, 5, 4, 6, 1, 0, 0, 0, 1, 5, 7, 5, 7, 1, 0, 0, 0, 1, 5, 8, 9, 6, 8, 1, 0, 0, 0, 0, 4, 10, 11, 11, 7, 9, 1, 0, 0, 0, 0, 3, 11, 15, 14, 13, 8, 10, 1, 0, 0, 0, 0, 2, 9, 19, 20, 17, 15, 9, 11, 1, 0, 0, 0, 0, 1, 9, 20, 27, 25, 20, 17, 10, 12, 1, 0, 0, 0, 0, 1, 7, 20, 32, 35, 30, 23, 19, 11, 13, 1]