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.

A116511 Table T(n,k) = number of strictly increasing addition chains of length n whose final value is k.

Table of values

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

List of values

[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 2, 0, 1, 0, 0, 0, 0, 1, 3, 5, 5, 3, 4, 0, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 4, 9, 14, 17, 15, 17, 10, 14, 4, 10, 2, 7, 0, 6, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 5, 14, 28, 45, 60, 67, 78, 66, 81, 51, 73, 33, 65, 29, 40, 4, 47, 14, 24, 5, 23, 0, 12]