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.

A163755 a(0)=1. For n>=1, write n in binary. Let b(n,m) be the length of the m-th run of 0's or 1's, reading right to left. Then a(n) = product{m=1 to M} p(m)^b(n,m), where p(m) is the m-th prime, and M is the number of runs of 0's and 1's in binary n.

Table of values

n a(n)
0 1
1 2
2 6
3 4
4 12
5 30
6 18
7 8
8 24
9 90
10 210
11 60
12 36
13 150
14 54
15 16
16 48
17 270
18 1050
19 180
20 420
21 2310
22 630
23 120
24 72
25 450
26 1470
27 300
28 108
29 750
30 162
31 32
32 96
33 810
34 5250
35 540
36 2100
37 16170
38 3150
39 360
40 840
41 6930
42 30030
43 4620
44 1260
45 11550
46 1890
47 240
48 144
49 1350
50 7350
51 900
52 2940
53 25410

List of values

[1, 2, 6, 4, 12, 30, 18, 8, 24, 90, 210, 60, 36, 150, 54, 16, 48, 270, 1050, 180, 420, 2310, 630, 120, 72, 450, 1470, 300, 108, 750, 162, 32, 96, 810, 5250, 540, 2100, 16170, 3150, 360, 840, 6930, 30030, 4620, 1260, 11550, 1890, 240, 144, 1350, 7350, 900, 2940, 25410]