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.

A331835 Replace 2^k in binary expansion of n with k-th prime number for any k > 0 (and keep 2^0).

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 3
5 4
6 5
7 6
8 5
9 6
10 7
11 8
12 8
13 9
14 10
15 11
16 7
17 8
18 9
19 10
20 10
21 11
22 12
23 13
24 12
25 13
26 14
27 15
28 15
29 16
30 17
31 18
32 11
33 12
34 13
35 14
36 14
37 15
38 16
39 17
40 16
41 17
42 18
43 19
44 19
45 20
46 21
47 22
48 18
49 19
50 20
51 21
52 21
53 22
54 23
55 24
56 23
57 24
58 25
59 26
60 26
61 27
62 28
63 29
64 13
65 14
66 15
67 16
68 16

List of values

[0, 1, 2, 3, 3, 4, 5, 6, 5, 6, 7, 8, 8, 9, 10, 11, 7, 8, 9, 10, 10, 11, 12, 13, 12, 13, 14, 15, 15, 16, 17, 18, 11, 12, 13, 14, 14, 15, 16, 17, 16, 17, 18, 19, 19, 20, 21, 22, 18, 19, 20, 21, 21, 22, 23, 24, 23, 24, 25, 26, 26, 27, 28, 29, 13, 14, 15, 16, 16]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.