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.

A283615 Irregular triangle read by rows: T(n,k) is the number of necklaces of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 1
5 2
6 5
7 4
8 2
9 1
10 2
11 7
12 16
13 18
14 12
15 4
16 1
17 2
18 11
19 32
20 70
21 92
22 82
23 40
24 10
25 1
26 2
27 13
28 56
29 166
30 348
31 510
32 520
33 350
34 140
35 26
36 1
37 2
38 17
39 88
40 336
41 932
42 1948
43 2992
44 3404
45 2756
46 1518
47 504
48 80
49 1
50 2
51 19
52 124
53 584
54 2056
55 5524
56 11444
57 18298
58 22428
59 20706
60 13944
61 6468
62 1848
63 246
64 1
65 2
66 23
67 168
68 944
69 3976
70 13120
71 34064
72 70380
73 115516

List of values

[1, 1, 2, 1, 1, 2, 5, 4, 2, 1, 2, 7, 16, 18, 12, 4, 1, 2, 11, 32, 70, 92, 82, 40, 10, 1, 2, 13, 56, 166, 348, 510, 520, 350, 140, 26, 1, 2, 17, 88, 336, 932, 1948, 2992, 3404, 2756, 1518, 504, 80, 1, 2, 19, 124, 584, 2056, 5524, 11444, 18298, 22428, 20706, 13944, 6468, 1848, 246, 1, 2, 23, 168, 944, 3976, 13120, 34064, 70380, 115516]