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.

A143719 Let n = Product_{p} p ^ e_p be the prime factorization of n and let M = max{e_p}. Then n is in the sequence iff for all primes q in the range 2 <= q <= M we have e_q >= Sum_{r} floor( log_q (e_r + 1) ).

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 24, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 51, 52, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 76, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 100]