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.

A273258 Write the distinct prime divisors p of n in the (PrimePi(p) - 1)-th place, ignoring multiplicity. Decode the resulting number after first reversing the code, ignoring any leading zeros.

Table of values

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

List of values

[1, 2, 2, 2, 2, 6, 2, 2, 2, 10, 2, 6, 2, 14, 6, 2, 2, 6, 2, 10, 10, 22, 2, 6, 2, 26, 2, 14, 2, 30, 2, 2, 14, 34, 6, 6, 2, 38, 22, 10, 2, 70, 2, 22, 6, 46, 2, 6, 2, 10, 26, 26, 2, 6, 10, 14, 34, 58, 2, 30, 2, 62, 10, 2, 14, 154, 2, 34, 38, 42, 2, 6, 2, 74, 6, 38, 6, 286, 2, 10, 2, 82, 2, 70, 22, 86]