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.

A059222 Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.

Table of values

n a(n)
1 1
2 1
3 4
4 1
5 16
6 1
7 64
8 1
9 256
10 1
11 1024
12 1
13 4096
14 1
15 16384
16 1
17 65536
18 1
19 262144
20 1
21 1048576
22 1
23 4194304
24 1
25 16777216
26 1
27 67108864
28 1
29 268435456
30 1
31 1073741824
32 1
33 4294967296
34 1
35 17179869184
36 1
37 68719476736
38 1
39 274877906944
40 1
41 1099511627776
42 1
43 4398046511104

List of values

[1, 1, 4, 1, 16, 1, 64, 1, 256, 1, 1024, 1, 4096, 1, 16384, 1, 65536, 1, 262144, 1, 1048576, 1, 4194304, 1, 16777216, 1, 67108864, 1, 268435456, 1, 1073741824, 1, 4294967296, 1, 17179869184, 1, 68719476736, 1, 274877906944, 1, 1099511627776, 1, 4398046511104]