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.

A286756 Irregular triangle T(n,k) for 0 <= k < 5n/2: T(n,k) = number of vertices of the cube-connected cycle graph of order n that are at a distance k from a designated vertex.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 2
6 2
7 1
8 1
9 3
10 4
11 6
12 6
13 3
14 1
15 1
16 3
17 5
18 8
19 11
20 13
21 13
22 8
23 2
24 0
25 1
26 3
27 6
28 10
29 16
30 24
31 31
32 32
33 23
34 11
35 3
36 0
37 1
38 3
39 6
40 11
41 18
42 29
43 43
44 58
45 72
46 71
47 47
48 19
49 5
50 1
51 0
52 1
53 3
54 6
55 12
56 20
57 34
58 55
59 83
60 120
61 154
62 162
63 131
64 77
65 29
66 7
67 2
68 0

List of values

[1, 1, 1, 2, 2, 2, 1, 1, 3, 4, 6, 6, 3, 1, 1, 3, 5, 8, 11, 13, 13, 8, 2, 0, 1, 3, 6, 10, 16, 24, 31, 32, 23, 11, 3, 0, 1, 3, 6, 11, 18, 29, 43, 58, 72, 71, 47, 19, 5, 1, 0, 1, 3, 6, 12, 20, 34, 55, 83, 120, 154, 162, 131, 77, 29, 7, 2, 0]