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.

A286899 Array read by antidiagonals: A(n, L) is the number of closed walks of length 2L along the edges of an n-cube based at a vertex, for n >= 1 and L >= 1.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 8
6 3
7 1
8 32
9 21
10 4
11 1
12 128
13 183
14 40
15 5
16 1
17 512
18 1641
19 544
20 65
21 6
22 1
23 2048
24 14763
25 8320
26 1205
27 96
28 7
29 1
30 8192
31 132861
32 131584
33 26465
34 2256
35 133
36 8
37 1
38 32768
39 1195743
40 2099200
41 628805
42 64896
43 3787
44 176
45 9
46 1
47 131072
48 10761681
49 33562624
50 15424865

List of values

[1, 1, 2, 1, 8, 3, 1, 32, 21, 4, 1, 128, 183, 40, 5, 1, 512, 1641, 544, 65, 6, 1, 2048, 14763, 8320, 1205, 96, 7, 1, 8192, 132861, 131584, 26465, 2256, 133, 8, 1, 32768, 1195743, 2099200, 628805, 64896, 3787, 176, 9, 1, 131072, 10761681, 33562624, 15424865]