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.

A268956 T(n,k)=Number of length-n 0..k arrays with no repeated value equal to the previous repeated value, with new values introduced in sequential order.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 2
9 4
10 5
11 1
12 2
13 4
14 11
15 7
16 1
17 2
18 4
19 12
20 29
21 11
22 1
23 2
24 4
25 12
26 39
27 77
28 15
29 1
30 2
31 4
32 12
33 40
34 138
35 201
36 23
37 1
38 2
39 4
40 12
41 40
42 153
43 499
44 525
45 31
46 1
47 2
48 4
49 12
50 40
51 154
52 634
53 1830
54 1361
55 47
56 1
57 2
58 4
59 12
60 40
61 154
62 655
63 2785
64 6723
65 3525
66 63
67 1
68 2
69 4
70 12
71 40
72 154
73 656
74 3045

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 4, 5, 1, 2, 4, 11, 7, 1, 2, 4, 12, 29, 11, 1, 2, 4, 12, 39, 77, 15, 1, 2, 4, 12, 40, 138, 201, 23, 1, 2, 4, 12, 40, 153, 499, 525, 31, 1, 2, 4, 12, 40, 154, 634, 1830, 1361, 47, 1, 2, 4, 12, 40, 154, 655, 2785, 6723, 3525, 63, 1, 2, 4, 12, 40, 154, 656, 3045]