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.

A255992 T(n,k)=Number of length n+k 0..1 arrays with at most one downstep in every k consecutive neighbor pairs.

Table of values

n a(n)
1 4
2 8
3 8
4 15
5 16
6 16
7 26
8 28
9 32
10 32
11 42
12 45
13 53
14 64
15 64
16 64
17 68
18 80
19 100
20 128
21 128
22 93
23 98
24 114
25 144
26 188
27 256
28 256
29 130
30 136
31 156
32 196
33 256
34 354
35 512
36 512
37 176
38 183
39 207
40 257
41 337
42 451
43 667
44 1024
45 1024
46 232
47 240
48 268
49 328
50 428
51 568
52 796
53 1256
54 2048
55 2048
56 299
57 308

List of values

[4, 8, 8, 15, 16, 16, 26, 28, 32, 32, 42, 45, 53, 64, 64, 64, 68, 80, 100, 128, 128, 93, 98, 114, 144, 188, 256, 256, 130, 136, 156, 196, 256, 354, 512, 512, 176, 183, 207, 257, 337, 451, 667, 1024, 1024, 232, 240, 268, 328, 428, 568, 796, 1256, 2048, 2048, 299, 308]