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.

A319996 Let g = A006530(n), the largest prime factor of n. This filter sequence combines (g mod 6), n/g (A052126), and a single bit A319988(n) telling whether the largest prime factor is unitary.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 5
12 11
13 7
14 12
15 13
16 14
17 5
18 15
19 7
20 16
21 17
22 10
23 5
24 18
25 19
26 12
27 20
28 21
29 5
30 22
31 7
32 23
33 13
34 10
35 24
36 25
37 7
38 12
39 17
40 26
41 5
42 27
43 7
44 16
45 28
46 10
47 5
48 29
49 30
50 31
51 13
52 21
53 5
54 32
55 33
56 34
57 17
58 10
59 5
60 35
61 7
62 12
63 36
64 37
65 24
66 22
67 7
68 16
69 13
70 38
71 5
72 39
73 7
74 12
75 40
76 21
77 41
78 27
79 7
80 42
81 43
82 10
83 5
84 44
85 33
86 12
87 13
88 26
89 5
90 45
91 46
92 16
93 17
94 10
95 24
96 47
97 7
98 48
99 28
100 49
101 5
102 22
103 7
104 34

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 11, 7, 12, 13, 14, 5, 15, 7, 16, 17, 10, 5, 18, 19, 12, 20, 21, 5, 22, 7, 23, 13, 10, 24, 25, 7, 12, 17, 26, 5, 27, 7, 16, 28, 10, 5, 29, 30, 31, 13, 21, 5, 32, 33, 34, 17, 10, 5, 35, 7, 12, 36, 37, 24, 22, 7, 16, 13, 38, 5, 39, 7, 12, 40, 21, 41, 27, 7, 42, 43, 10, 5, 44, 33, 12, 13, 26, 5, 45, 46, 16, 17, 10, 24, 47, 7, 48, 28, 49, 5, 22, 7, 34]