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.

A075463 a(n) is the number of rotation-reflection inequivalent 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 5
5 1
6 1
7 1
8 1
9 43
10 1
11 10
12 1
13 1
14 5
15 1
16 43
17 1
18 1
19 8356
20 1
21 1
22 1
23 2080
24 5
25 1
26 1
27 1
28 1
29 136
30 131720
31 1
32 131720
33 8356
34 5
35 10
36 1
37 1
38 1
39 536911936
40 1
41 1
42 1
43 1
44 5
45 1
46 1
47 134225920
48 1
49 43
50 43
51 1
52 1
53 1
54 5
55 1
56 1
57 1
58 1
59 524800
60 1
61 137439609088
62 2099728
63 1
64 33564704
65 549756338176
66 1
67 536911936
68 1
69 43
70 1
71 2080
72 1
73 1
74 5
75 1
76 1
77 1
78 1
79 2305843011898064896

List of values

[1, 1, 1, 5, 1, 1, 1, 1, 43, 1, 10, 1, 1, 5, 1, 43, 1, 1, 8356, 1, 1, 1, 2080, 5, 1, 1, 1, 1, 136, 131720, 1, 131720, 8356, 5, 10, 1, 1, 1, 536911936, 1, 1, 1, 1, 5, 1, 1, 134225920, 1, 43, 43, 1, 1, 1, 5, 1, 1, 1, 1, 524800, 1, 137439609088, 2099728, 1, 33564704, 549756338176, 1, 536911936, 1, 43, 1, 2080, 1, 1, 5, 1, 1, 1, 1, 2305843011898064896]