A341419 - cp's OEIS frontend

A341419 a(0) = 1, a(1) = 1, a(2^(n-1)..2^n-1) = fwht(0..2^(n-2)). Here "fwht" is the fast Walsh-Hadamard transform with natural ordering and without multiplication of any factors.

n	a(n)
0	1
1	1
2	2
3	0
4	4
5	2
6	0
7	-2
8	8
9	6
10	8
11	-2
12	0
13	-2
14	-8
15	-2
16	16
17	14
18	24
19	-2
20	32
21	14
22	-8
23	-18
24	0
25	-2
26	-8
27	-2
28	-32
29	-18
30	-8
31	14
32	32
33	30
34	56
35	-2
36	96
37	46
38	-8
39	-50
40	128
41	94
42	120
43	-34
44	-32
45	-50
46	-136
47	-18
48	0
49	-2
50	-8
51	-2
52	-32
53	-18
54	-8
55	14
56	-128
57	-98
58	-136
59	30
60	-32
61	14
62	120
63	46
64	64
65	62

[1, 1, 2, 0, 4, 2, 0, -2, 8, 6, 8, -2, 0, -2, -8, -2, 16, 14, 24, -2, 32, 14, -8, -18, 0, -2, -8, -2, -32, -18, -8, 14, 32, 30, 56, -2, 96, 46, -8, -50, 128, 94, 120, -34, -32, -50, -136, -18, 0, -2, -8, -2, -32, -18, -8, 14, -128, -98, -136, 30, -32, 14, 120, 46, 64, 62]

cp's OEIS Frontend

A341419 a(0) = 1, a(1) = 1, a(2^(n-1)..2^n-1) = fwht(0..2^(n-2)). Here "fwht" is the fast Walsh-Hadamard transform with natural ordering and without multiplication of any factors.

Table of values

List of values