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.

A339464 a(n) = (prime(n)-1) / gpf(prime(n)-1) where gpf(m) is the greatest prime factor of m, A006530.

Table of values

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

List of values

[1, 2, 2, 2, 4, 8, 6, 2, 4, 6, 12, 8, 6, 2, 4, 2, 12, 6, 10, 24, 6, 2, 8, 32, 20, 6, 2, 36, 16, 18, 10, 8, 6, 4, 30, 12, 54, 2, 4, 2, 36, 10, 64, 28, 18, 30, 6, 2, 12, 8, 14, 48, 50, 128, 2, 4, 54, 12, 40, 6, 4, 18, 10, 24, 4, 30, 48, 2, 12, 32, 2, 6, 12, 54, 2]

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

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