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.

A061468 a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).

Table of values

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

List of values

[2, 3, 4, 5, 6, 6, 8, 8, 9, 8, 12, 10, 14, 10, 12, 13, 18, 12, 20, 14, 16, 14, 24, 16, 23, 16, 22, 18, 30, 16, 32, 22, 24, 20, 28, 21, 38, 22, 28, 24, 42, 20, 44, 26, 30, 26, 48, 26, 45, 26, 36, 30, 54, 26, 44, 32, 40, 32, 60, 28, 62, 34, 42, 39, 52, 28]

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

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