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.

A200785 T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents.

Table of values

n a(n)
1 8
2 26
3 16
4 60
5 75
6 32
7 115
8 225
9 216
10 64
11 196
12 530
13 840
14 622
15 128
16 308
17 1071
18 2425
19 3136
20 1791
21 256
22 456
23 1946
24 5796
25 11100
26 11704
27 5157
28 512
29 645
30 3270
31 12152
32 31395
33 50775
34 43681
35 14849
36 1024
37 880
38 5175
39 23136
40 75992
41 169884
42 232275
43 163020
44 42756
45 2048

List of values

[8, 26, 16, 60, 75, 32, 115, 225, 216, 64, 196, 530, 840, 622, 128, 308, 1071, 2425, 3136, 1791, 256, 456, 1946, 5796, 11100, 11704, 5157, 512, 645, 3270, 12152, 31395, 50775, 43681, 14849, 1024, 880, 5175, 23136, 75992, 169884, 232275, 163020, 42756, 2048]