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.

A365092 Write out the canonical factorization of n and factorize the exponents in the factorization, the exponents in the factorizations of the exponents, ... until there are only prime numbers left. Replace each p in the factorization by (p-1)+1 and factorize each p-1 by the same process if p-1 > 1. Continue this process until there are only 1s left. a(n) is the number of 1s used.

Table of values

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

List of values

[0, 2, 3, 4, 5, 5, 6, 5, 5, 7, 8, 7, 8, 8, 8, 6, 7, 7, 8, 9, 9, 10, 11, 8, 7, 10, 6, 10, 11, 10, 11, 7, 11, 9, 11, 9, 10, 10, 11, 10, 11, 11, 12, 12, 10, 13, 14, 9, 8, 9, 10, 12, 13, 8, 13, 11, 11, 13, 14, 12, 13, 13, 11, 7, 13, 13, 14, 11, 14, 13, 14, 10, 11, 12, 10, 12]