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.

A264945 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 2
6 1
7 0
8 1
9 8
10 1
11 0
12 2
13 56
14 60
15 1
16 0
17 1
18 332
19 3201
20 544
21 1
22 0
23 2
24 2350
25 184740
26 307016
27 6040
28 1
29 0
30 1
31 16108
32 11375145
33 196389904
34 43200625
35 79008
36 1
37 0
38 2
39 114148
40 730983420
41 137409486772
42 368696849320
43 8403205056
44 1190672
45 1
46 0
47 1
48 817280

List of values

[1, 0, 1, 0, 2, 1, 0, 1, 8, 1, 0, 2, 56, 60, 1, 0, 1, 332, 3201, 544, 1, 0, 2, 2350, 184740, 307016, 6040, 1, 0, 1, 16108, 11375145, 196389904, 43200625, 79008, 1, 0, 2, 114148, 730983420, 137409486772, 368696849320, 8403205056, 1190672, 1, 0, 1, 817280]