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.

A335603 a(n) = p*q where p is the sequential number (or PrimePi, A000720) of the largest prime divisor of n, and q is the maximal exponent in the canonical representation of n (A051903).

Table of values

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

List of values

[0, 1, 2, 2, 3, 2, 4, 3, 4, 3, 5, 4, 6, 4, 3, 4, 7, 4, 8, 6, 4, 5, 9, 6, 6, 6, 6, 8, 10, 3, 11, 5, 5, 7, 4, 4, 12, 8, 6, 9, 13, 4, 14, 10, 6, 9, 15, 8, 8, 6, 7, 12, 16, 6, 5, 12, 8, 10, 17, 6, 18, 11, 8, 6, 6, 5, 19, 14, 9, 4, 20, 6, 21, 12, 6, 16, 5, 6, 22, 12]