A266213 - cp's OEIS frontend

A266213 Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)binomial(n,k) 2^k.

n	a(n)
0	1
1	1
2	0
3	1
4	2
5	0
6	1
7	4
8	2
9	0
10	1
11	6
12	8
13	2
14	0
15	1
16	8
17	18
18	12
19	2
20	0
21	1
22	10
23	32
24	38
25	16
26	2
27	0
28	1
29	12
30	50
31	88
32	66
33	20
34	2
35	0
36	1
37	14
38	72
39	170
40	192
41	102
42	24
43	2
44	0
45	1
46	16
47	98
48	292
49	450
50	360
51	146
52	28
53	2
54	0
55	1
56	18
57	128
58	462
59	912
60	1002
61	608
62	198
63	32
64	2
65	0

[1, 1, 0, 1, 2, 0, 1, 4, 2, 0, 1, 6, 8, 2, 0, 1, 8, 18, 12, 2, 0, 1, 10, 32, 38, 16, 2, 0, 1, 12, 50, 88, 66, 20, 2, 0, 1, 14, 72, 170, 192, 102, 24, 2, 0, 1, 16, 98, 292, 450, 360, 146, 28, 2, 0, 1, 18, 128, 462, 912, 1002, 608, 198, 32, 2, 0]

cp's OEIS Frontend

A266213 Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)binomial(n,k) 2^k.

Table of values

List of values

cp's OEIS Frontend

A266213 Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.

Table of values

List of values

A266213 Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)binomial(n,k) 2^k.