A098485 - cp's OEIS frontend

A098485 Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.

n	a(n)
1	1
2	4
3	6
4	9
5	20
6	48
7	16
8	42
9	132
10	419
11	25
12	72
13	256
14	973
15	3682
16	36
17	110
18	420
19	1747
20	7484
21	31992
22	49
23	156
24	624
25	2741
26	12562
27	58620
28	273556
29	64
30	210
31	868
32	3955
33	18916
34	92912
35	462104
36	2927505
37	81
38	272
39	1152
40	5389
41	26546
42	134868
43	697836
44	3644935
45	19082018

[1, 4, 6, 9, 20, 48, 16, 42, 132, 419, 25, 72, 256, 973, 3682, 36, 110, 420, 1747, 7484, 31992, 49, 156, 624, 2741, 12562, 58620, 273556, 64, 210, 868, 3955, 18916, 92912, 462104, 2927505, 81, 272, 1152, 5389, 26546, 134868, 697836, 3644935, 19082018]

cp's OEIS Frontend

A098485 Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.

Table of values

List of values