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.

A371906 a(n) = sum of 2^(k-1) such that floor(n/prime(k)) is odd.

Table of values

n a(n)
1 0
2 1
3 3
4 2
5 6
6 5
7 13
8 12
9 14
10 11
11 27
12 24
13 56
14 49
15 55
16 54
17 118
18 117
19 245
20 240
21 250
22 235
23 491
24 488
25 492
26 461
27 463
28 454
29 966
30 961
31 1985
32 1984
33 2002
34 1939
35 1951
36 1948
37 3996
38 3869
39 3903
40 3898
41 7994
42 7985
43 16177
44 16160
45 16166
46 15911
47 32295
48 32292
49 32300
50 32297
51 32363

List of values

[0, 1, 3, 2, 6, 5, 13, 12, 14, 11, 27, 24, 56, 49, 55, 54, 118, 117, 245, 240, 250, 235, 491, 488, 492, 461, 463, 454, 966, 961, 1985, 1984, 2002, 1939, 1951, 1948, 3996, 3869, 3903, 3898, 7994, 7985, 16177, 16160, 16166, 15911, 32295, 32292, 32300, 32297, 32363]