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.

A384064 a(n) = s(n) divided by the smallest multiple prime factor of s(n), where s = A013929.

Table of values

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

List of values

[2, 4, 3, 6, 8, 6, 10, 12, 5, 9, 14, 16, 18, 20, 22, 15, 24, 7, 10, 26, 18, 28, 30, 21, 32, 34, 36, 15, 38, 40, 27, 42, 44, 30, 46, 48, 14, 33, 50, 52, 54, 56, 58, 39, 60, 11, 62, 25, 42, 64, 66, 45, 68, 70, 72, 21, 74, 30, 76, 51, 78, 80, 54, 82, 84, 13, 57, 86]

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

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