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.

A118306 If n = product{k>=1} p(k)^b(n,k), where p(k) is the k-th prime and where each b(n,k) is a nonnegative integer, then: If n occurs earlier in the sequence, then a(n) = product{k>=2} p(k-1)^b(n,k); If n does not occur earlier in the sequence, then a(n) = product{k>=1} p(k+1)^b(n,k).

Table of values

n a(n)
1 1
2 3
3 2
4 9
5 7
6 15
7 5
8 27
9 4
10 21
11 13
12 45
13 11
14 33
15 6
16 81
17 19
18 75
19 17
20 63
21 10
22 39
23 29
24 135
25 49
26 51
27 8
28 99
29 23
30 105
31 37
32 243
33 14
34 57
35 77
36 225
37 31
38 69
39 22
40 189
41 43
42 165
43 41
44 117
45 12
46 87
47 53
48 405
49 25
50 147
51 26
52 153
53 47
54 375
55 91
56 297
57 34
58 93
59 61
60 315
61 59
62 111
63 20
64 729
65 119
66 195
67 71

List of values

[1, 3, 2, 9, 7, 15, 5, 27, 4, 21, 13, 45, 11, 33, 6, 81, 19, 75, 17, 63, 10, 39, 29, 135, 49, 51, 8, 99, 23, 105, 37, 243, 14, 57, 77, 225, 31, 69, 22, 189, 43, 165, 41, 117, 12, 87, 53, 405, 25, 147, 26, 153, 47, 375, 91, 297, 34, 93, 61, 315, 59, 111, 20, 729, 119, 195, 71]