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.

A036288 a(n) = 1 + integer log of n: if the prime factorization of n is n = Product (p_j^k_j) then a(n) = 1 + Sum (p_j * k_j) (cf. A001414).

Table of values

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

List of values

[1, 3, 4, 5, 6, 6, 8, 7, 7, 8, 12, 8, 14, 10, 9, 9, 18, 9, 20, 10, 11, 14, 24, 10, 11, 16, 10, 12, 30, 11, 32, 11, 15, 20, 13, 11, 38, 22, 17, 12, 42, 13, 44, 16, 12, 26, 48, 12, 15, 13, 21, 18, 54, 12, 17, 14, 23, 32, 60, 13, 62, 34, 14, 13, 19, 17, 68, 22]