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.

A382468 a(n) = (largest prime factor of n) minus (its remaining distinct prime factors).

Table of values

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

List of values

[2, 3, 2, 5, 1, 7, 2, 3, 3, 11, 1, 13, 5, 2, 2, 17, 1, 19, 3, 4, 9, 23, 1, 5, 11, 3, 5, 29, 0, 31, 2, 8, 15, 2, 1, 37, 17, 10, 3, 41, 2, 43, 9, 2, 21, 47, 1, 7, 3, 14, 11, 53, 1, 6, 5, 16, 27, 59, 0, 61, 29, 4, 2, 8, 6, 67, 15, 20, 0, 71, 1, 73, 35, 2, 17, 4, 8, 79, 3, 3]