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.

A356016 Consider the exponents in the prime factorization of n, and replace each run of k consecutive e's by a unique k; the resulting list corresponds to the exponents in the prime factorization of a(n).

Table of values

n a(n)
1 1
2 2
3 6
4 2
5 12
6 4
7 24
8 2
9 6
10 30
11 48
12 6
13 96
14 90
15 18
16 2
17 192
18 6
19 384
20 30
21 210
22 270
23 768
24 6
25 12
26 810
27 6
28 90
29 1536
30 8
31 3072
32 2
33 1050
34 2430
35 36
36 4
37 6144
38 7290
39 5250
40 30
41 12288
42 60
43 24576
44 270
45 30
46 21870
47 49152
48 6
49 24
50 30
51 26250
52 810
53 98304
54 6
55 420
56 90
57 131250

List of values

[1, 2, 6, 2, 12, 4, 24, 2, 6, 30, 48, 6, 96, 90, 18, 2, 192, 6, 384, 30, 210, 270, 768, 6, 12, 810, 6, 90, 1536, 8, 3072, 2, 1050, 2430, 36, 4, 6144, 7290, 5250, 30, 12288, 60, 24576, 270, 30, 21870, 49152, 6, 24, 30, 26250, 810, 98304, 6, 420, 90, 131250]