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.

A135130 Let n = Product_{p} p ^ e_p be the prime factorization of n and let M = max{e_p + 1 }. Then n is in the sequence iff for all primes q in the range 3 <= 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 5
5 6
6 7
7 9
8 10
9 11
10 12
11 13
12 14
13 15
14 17
15 18
16 19
17 21
18 22
19 23
20 24
21 26
22 27
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 45
37 46
38 47
39 51
40 53
41 54
42 55
43 57
44 58
45 59
46 60
47 61
48 62
49 63
50 65
51 66
52 67
53 69
54 70
55 71
56 72
57 73
58 74
59 75
60 77
61 78
62 79
63 82
64 83
65 84
66 85
67 86
68 87
69 89
70 90
71 91
72 93
73 94
74 95
75 97

List of values

[1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 21, 22, 23, 24, 26, 27, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 45, 46, 47, 51, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 77, 78, 79, 82, 83, 84, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97]