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.

A293230 a(n) is the number of integers 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 2
2 3
3 5
4 7
5 9
6 12
7 15
8 19
9 26
10 35
11 49
12 66
13 84
14 114
15 151
16 204
17 272
18 354
19 470
20 619
21 820
22 1109
23 1499
24 2009
25 2710
26 3631
27 4872
28 6554
29 8831
30 11821
31 15875
32 21364
33 28611
34 38389
35 51611
36 69295
37 93144
38 125290
39 168220
40 226048
41 303727
42 408170
43 548513
44 736900
45 990222
46 1330212
47 1787067
48 2401254
49 3226802
50 4335590
51 5825258

List of values

[1, 2, 3, 5, 7, 9, 12, 15, 19, 26, 35, 49, 66, 84, 114, 151, 204, 272, 354, 470, 619, 820, 1109, 1499, 2009, 2710, 3631, 4872, 6554, 8831, 11821, 15875, 21364, 28611, 38389, 51611, 69295, 93144, 125290, 168220, 226048, 303727, 408170, 548513, 736900, 990222, 1330212, 1787067, 2401254, 3226802, 4335590, 5825258]