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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 4
9 7
10 1
11 1
12 8
13 56
14 43
15 1
16 1
17 16
18 495
19 2592
20 372
21 1
22 1
23 32
24 4686
25 184740
26 222850
27 4027
28 1
29 1
30 64
31 46456
32 14439456
33 164933040
34 29357385
35 51871
36 1
37 1
38 128
39 475392
40 1196114464
41 137409486772
42 277778385204
43 5460708807
44 773186
45 1
46 1
47 256

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 7, 1, 1, 8, 56, 43, 1, 1, 16, 495, 2592, 372, 1, 1, 32, 4686, 184740, 222850, 4027, 1, 1, 64, 46456, 14439456, 164933040, 29357385, 51871, 1, 1, 128, 475392, 1196114464, 137409486772, 277778385204, 5460708807, 773186, 1, 1, 256]