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.

A259857 Triangle T(n,k), n>=1, 2<=k<=n+1, read by rows, where T(n,k) is the number of self-avoiding square-lattice polygons by area n and perimeter 2*k.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 0
6 6
7 0
8 0
9 1
10 18
11 0
12 0
13 0
14 8
15 55
16 0
17 0
18 0
19 2
20 40
21 174
22 0
23 0
24 0
25 0
26 22
27 168
28 566
29 0
30 0
31 0
32 0
33 6
34 134
35 676
36 1868
37 0
38 0
39 0
40 0
41 1
42 72
43 656
44 2672
45 6237
46 0
47 0
48 0
49 0
50 0
51 30
52 482
53 2992
54 10376
55 21050
56 0
57 0
58 0
59 0
60 0
61 8
62 310
63 2592
64 13160
65 39824
66 71666
67 0
68 0
69 0
70 0
71 0
72 2
73 151
74 2086
75 12862
76 56162
77 151878
78 245696

List of values

[1, 0, 2, 0, 0, 6, 0, 0, 1, 18, 0, 0, 0, 8, 55, 0, 0, 0, 2, 40, 174, 0, 0, 0, 0, 22, 168, 566, 0, 0, 0, 0, 6, 134, 676, 1868, 0, 0, 0, 0, 1, 72, 656, 2672, 6237, 0, 0, 0, 0, 0, 30, 482, 2992, 10376, 21050, 0, 0, 0, 0, 0, 8, 310, 2592, 13160, 39824, 71666, 0, 0, 0, 0, 0, 2, 151, 2086, 12862, 56162, 151878, 245696]