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.

A336667 Triangular array read by rows. T(n,k) is the number of closed walks of length 2n along the edges of a cube based at vertex v that return to v exactly k times, n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 3
3 0
4 12
5 9
6 0
7 84
8 72
9 27
10 0
11 588
12 648
13 324
14 81
15 0
16 4116
17 5544
18 3564
19 1296
20 243
21 0
22 28812
23 45864
24 35748
25 16848
26 4860
27 729
28 0
29 201684
30 370440
31 337932
32 193104
33 72900
34 17496
35 2187

List of values

[1, 0, 3, 0, 12, 9, 0, 84, 72, 27, 0, 588, 648, 324, 81, 0, 4116, 5544, 3564, 1296, 243, 0, 28812, 45864, 35748, 16848, 4860, 729, 0, 201684, 370440, 337932, 193104, 72900, 17496, 2187]