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.

A246066 Least k such that Lppf(k) > Gpf(k) + n, where Lppf(k) is the largest prime power factor of k and Gpf(k) is the greatest prime factor of k.

Table of values

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

List of values

[4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16, 25, 25, 25, 25, 25, 25, 27, 27, 27, 27, 32, 32, 32, 32, 32, 32, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 81, 81, 81, 81, 81]

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

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