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.

A298882 a(1) = 1, and for any n > 1, if n is the k-th number with least prime factor p, then a(n) is the k-th number with greatest prime factor p.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 8
7 7
8 16
9 6
10 32
11 11
12 64
13 13
14 128
15 9
16 256
17 17
18 512
19 19
20 1024
21 12
22 2048
23 23
24 4096
25 10
26 8192
27 18
28 16384
29 29
30 32768
31 31
32 65536
33 24
34 131072
35 15
36 262144
37 37
38 524288
39 27
40 1048576
41 41
42 2097152
43 43
44 4194304
45 36
46 8388608
47 47
48 16777216
49 14
50 33554432
51 48

List of values

[1, 2, 3, 4, 5, 8, 7, 16, 6, 32, 11, 64, 13, 128, 9, 256, 17, 512, 19, 1024, 12, 2048, 23, 4096, 10, 8192, 18, 16384, 29, 32768, 31, 65536, 24, 131072, 15, 262144, 37, 524288, 27, 1048576, 41, 2097152, 43, 4194304, 36, 8388608, 47, 16777216, 14, 33554432, 48]