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.

A378514 Number of partitions of 2^n-1 into two summands >= 0 having a common divisor > 1.

Table of values

n a(n)
1 0
2 1
3 1
4 4
5 1
6 14
7 1
8 64
9 40
10 212
11 56
12 1184
13 1
14 2900
15 2884
16 16384
17 1
18 61088
19 1
20 284288
21 159520
22 776800
23 89264
24 5070848
25 577216
26 11195732
27 10375168
28 67834880
29 1522240
30 269570912
31 1
32 1073741824
33 813199072
34 2863486292
35 917553184
36 21299044352
37 308159200
38 45813683540

List of values

[0, 1, 1, 4, 1, 14, 1, 64, 40, 212, 56, 1184, 1, 2900, 2884, 16384, 1, 61088, 1, 284288, 159520, 776800, 89264, 5070848, 577216, 11195732, 10375168, 67834880, 1522240, 269570912, 1, 1073741824, 813199072, 2863486292, 917553184, 21299044352, 308159200, 45813683540]