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.

A345965 a(1) = 1; for n>1, a(n) = phi(n) + a(n/p) where p is the least prime divisor of n.

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 7, 8, 9, 9, 11, 9, 13, 13, 13, 16, 17, 15, 19, 17, 19, 21, 23, 17, 25, 25, 27, 25, 29, 21, 31, 32, 31, 33, 31, 27, 37, 37, 37, 33, 41, 31, 43, 41, 37, 45, 47, 33, 49, 45, 49, 49, 53, 45, 51, 49, 55, 57, 59, 37, 61, 61, 55, 64, 61, 51, 67, 65, 67, 55]

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

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