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.

A319406 Write n-th prime in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result.

Table of values

n a(n)
1 12
2 7
3 51
4 15
5 103
6 115
7 195
8 199
9 207
10 243
11 63
12 1587
13 1635
14 1639
15 415
16 1843
17 487
18 499
19 775
20 783
21 3171
22 799
23 3271
24 3299
25 899
26 3635
27 911
28 3687
29 3699
30 963
31 255
32 1543
33 6243
34 6247
35 25395
36 6351
37 6387
38 6535
39 6543
40 26227
41 6599
42 26419
43 1663
44 1795
45 7219
46 1807
47 7367

List of values

[12, 7, 51, 15, 103, 115, 195, 199, 207, 243, 63, 1587, 1635, 1639, 415, 1843, 487, 499, 775, 783, 3171, 799, 3271, 3299, 899, 3635, 911, 3687, 3699, 963, 255, 1543, 6243, 6247, 25395, 6351, 6387, 6535, 6543, 26227, 6599, 26419, 1663, 1795, 7219, 1807, 7367]