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.

A306264 a(n) = 1 + d*a(n/d); a(1)=0. If n has only one prime divisor, then d=n, otherwise d is the greatest proper unitary divisor of n.

Table of values

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

List of values

[0, 1, 1, 1, 1, 4, 1, 1, 1, 6, 1, 5, 1, 8, 6, 1, 1, 10, 1, 6, 8, 12, 1, 9, 1, 14, 1, 8, 1, 16, 1, 1, 12, 18, 8, 10, 1, 20, 14, 9, 1, 22, 1, 12, 10, 24, 1, 17, 1, 26, 18, 14, 1, 28, 12, 9, 20, 30, 1, 21, 1, 32, 10, 1, 14, 34, 1, 18, 24, 36, 1, 10, 1, 38, 26, 20, 12, 40, 1, 17]