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.

A075462 a(n) is the number of solutions to the all-ones lights out problem on an n X n square.

Table of values

n a(n)
1 1
2 1
3 1
4 16
5 4
6 1
7 1
8 1
9 256
10 1
11 64
12 1
13 1
14 16
15 1
16 256
17 4
18 1
19 65536
20 1
21 1
22 1
23 16384
24 16
25 1
26 1
27 1
28 1
29 1024
30 1048576
31 1
32 1048576
33 65536
34 16
35 64
36 1
37 1
38 1
39 4294967296
40 1
41 4
42 1
43 1
44 16
45 1
46 1
47 1073741824
48 1
49 256
50 256
51 1
52 1
53 4
54 16
55 1
56 1
57 1
58 1
59 4194304
60 1
61 1099511627776
62 16777216

List of values

[1, 1, 1, 16, 4, 1, 1, 1, 256, 1, 64, 1, 1, 16, 1, 256, 4, 1, 65536, 1, 1, 1, 16384, 16, 1, 1, 1, 1, 1024, 1048576, 1, 1048576, 65536, 16, 64, 1, 1, 1, 4294967296, 1, 4, 1, 1, 16, 1, 1, 1073741824, 1, 256, 256, 1, 1, 4, 16, 1, 1, 1, 1, 4194304, 1, 1099511627776, 16777216]