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.

A293441 a(n) is the number of odd numbers k in range [2^n, (2^(n+1))-1] such that all terms in finite sequence [k, floor(k/2), floor(k/4), floor(k/8), ..., 1] are squarefree.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 11
9 15
10 20
11 29
12 37
13 47
14 67
15 84
16 120
17 152
18 202
19 268
20 351
21 469
22 640
23 859
24 1150
25 1560
26 2071
27 2801
28 3753
29 5078
30 6743
31 9132
32 12232
33 16379
34 22010
35 29601
36 39694
37 53450
38 71840
39 96380
40 129668
41 174059
42 234111
43 314402
44 422498
45 567724
46 762488
47 1024579
48 1376675
49 1850127
50 2485463
51 3339795

List of values

[1, 1, 2, 3, 4, 5, 7, 8, 11, 15, 20, 29, 37, 47, 67, 84, 120, 152, 202, 268, 351, 469, 640, 859, 1150, 1560, 2071, 2801, 3753, 5078, 6743, 9132, 12232, 16379, 22010, 29601, 39694, 53450, 71840, 96380, 129668, 174059, 234111, 314402, 422498, 567724, 762488, 1024579, 1376675, 1850127, 2485463, 3339795]