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.

A206455 T(n,k) = number of 0..k arrays of length n avoiding the consecutive pattern 0..k.

Table of values

n a(n)
1 2
2 3
3 3
4 4
5 9
6 4
7 5
8 16
9 26
10 5
11 6
12 25
13 64
14 75
15 6
16 7
17 36
18 125
19 255
20 216
21 7
22 8
23 49
24 216
25 625
26 1016
27 622
28 8
29 9
30 64
31 343
32 1296
33 3124
34 4048
35 1791
36 9
37 10
38 81
39 512
40 2401
41 7776
42 15615
43 16128
44 5157
45 10
46 11
47 100
48 729
49 4096
50 16807
51 46655
52 78050
53 64257
54 14849
55 11
56 12
57 121
58 1000

List of values

[2, 3, 3, 4, 9, 4, 5, 16, 26, 5, 6, 25, 64, 75, 6, 7, 36, 125, 255, 216, 7, 8, 49, 216, 625, 1016, 622, 8, 9, 64, 343, 1296, 3124, 4048, 1791, 9, 10, 81, 512, 2401, 7776, 15615, 16128, 5157, 10, 11, 100, 729, 4096, 16807, 46655, 78050, 64257, 14849, 11, 12, 121, 1000]