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.

A274228 Triangle read by rows: T(n,k) (n>=3, 0<=k<=n-3) = number of n-sequences of 0's and 1's with exactly one pair of adjacent 0's and exactly k pairs of adjacent 1's.

Table of values

n a(n)
3 2
4 3
5 2
6 4
7 4
8 2
9 5
10 8
11 5
12 2
13 6
14 12
15 12
16 6
17 2
18 7
19 18
20 21
21 16
22 7
23 2
24 8
25 24
26 36
27 32
28 20
29 8
30 2
31 9
32 32
33 54
34 60
35 45
36 24
37 9
38 2
39 10
40 40
41 80
42 100
43 90
44 60
45 28
46 10
47 2
48 11
49 50
50 110
51 160
52 165
53 126
54 77
55 32
56 11
57 2
58 12
59 60
60 150
61 240
62 280
63 252
64 168
65 96
66 36
67 12
68 2
69 13
70 72
71 195
72 350
73 455
74 448
75 364
76 216
77 117
78 40
79 13
80 2

List of values

[2, 3, 2, 4, 4, 2, 5, 8, 5, 2, 6, 12, 12, 6, 2, 7, 18, 21, 16, 7, 2, 8, 24, 36, 32, 20, 8, 2, 9, 32, 54, 60, 45, 24, 9, 2, 10, 40, 80, 100, 90, 60, 28, 10, 2, 11, 50, 110, 160, 165, 126, 77, 32, 11, 2, 12, 60, 150, 240, 280, 252, 168, 96, 36, 12, 2, 13, 72, 195, 350, 455, 448, 364, 216, 117, 40, 13, 2]