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.

A188147 T(n,k)=Number of n-step self-avoiding walks on a kXk square summed over all starting positions.

Table of values

n a(n)
1 1
2 4
3 0
4 9
5 8
6 0
7 16
8 24
9 8
10 0
11 25
12 48
13 44
14 8
15 0
16 36
17 80
18 104
19 80
20 0
21 0
22 49
23 120
24 188
25 232
26 104
27 0
28 0
29 64
30 168
31 296
32 456
33 432
34 128
35 0
36 0
37 81
38 224
39 428
40 752
41 972
42 800
43 112
44 0
45 0
46 100
47 288
48 584
49 1120
50 1712
51 2112
52 1248
53 112
54 0
55 0
56 121
57 360
58 764
59 1560
60 2652
61 4008
62 4152
63 1976
64 40

List of values

[1, 4, 0, 9, 8, 0, 16, 24, 8, 0, 25, 48, 44, 8, 0, 36, 80, 104, 80, 0, 0, 49, 120, 188, 232, 104, 0, 0, 64, 168, 296, 456, 432, 128, 0, 0, 81, 224, 428, 752, 972, 800, 112, 0, 0, 100, 288, 584, 1120, 1712, 2112, 1248, 112, 0, 0, 121, 360, 764, 1560, 2652, 4008, 4152, 1976, 40]