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.

A356014 Consider the exponents in the prime factorization of n, and replace each run of k consecutive e's by a unique e; 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 3
4 4
5 3
6 2
7 3
8 8
9 9
10 10
11 3
12 12
13 3
14 10
15 3
16 16
17 3
18 18
19 3
20 20
21 21
22 10
23 3
24 24
25 9
26 10
27 27
28 20
29 3
30 2
31 3
32 32
33 21
34 10
35 3
36 4
37 3
38 10
39 21
40 40
41 3
42 10
43 3
44 20
45 45
46 10
47 3
48 48
49 9
50 50
51 21
52 20
53 3
54 54
55 21
56 40
57 21
58 10
59 3
60 12
61 3
62 10
63 63
64 64
65 21
66 10
67 3
68 20
69 21
70 10
71 3
72 72
73 3

List of values

[1, 2, 3, 4, 3, 2, 3, 8, 9, 10, 3, 12, 3, 10, 3, 16, 3, 18, 3, 20, 21, 10, 3, 24, 9, 10, 27, 20, 3, 2, 3, 32, 21, 10, 3, 4, 3, 10, 21, 40, 3, 10, 3, 20, 45, 10, 3, 48, 9, 50, 21, 20, 3, 54, 21, 40, 21, 10, 3, 12, 3, 10, 63, 64, 21, 10, 3, 20, 21, 10, 3, 72, 3]

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

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