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.

A063686 Triangular array: T(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=0, k=0.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 2
12 1
13 1
14 1
15 1
16 2
17 2
18 1
19 1
20 1
21 1
22 4
23 4
24 2
25 1
26 1
27 1
28 1
29 4
30 6
31 4
32 2
33 1
34 1
35 1
36 1
37 7
38 11
39 8
40 4
41 2
42 1
43 1
44 1
45 1
46 9
47 19
48 14
49 8
50 4
51 2
52 1
53 1
54 1
55 1
56 14
57 33
58 27
59 16
60 8
61 4
62 2
63 1
64 1
65 1
66 1
67 18
68 56
69 50
70 30
71 16
72 8
73 4
74 2
75 1
76 1
77 1
78 1
79 30
80 101
81 96
82 59
83 32
84 16
85 8
86 4
87 2
88 1
89 1
90 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 4, 2, 1, 1, 1, 1, 4, 6, 4, 2, 1, 1, 1, 1, 7, 11, 8, 4, 2, 1, 1, 1, 1, 9, 19, 14, 8, 4, 2, 1, 1, 1, 1, 14, 33, 27, 16, 8, 4, 2, 1, 1, 1, 1, 18, 56, 50, 30, 16, 8, 4, 2, 1, 1, 1, 1, 30, 101, 96, 59, 32, 16, 8, 4, 2, 1, 1, 1]