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.

A178443 Two numbers k and l we call equivalent if they have the same vector of exponents with positive components in prime power factorization. Let a(1)=1, a(2)=3. If n>=3 is prime, then a(n) is the smallest prime greater than a(n-1); otherwise, a(n)>a(n-1) is the smallest number equivalent to n such that prime power factorization of a(n) contains only primes which already appeared in the sequence.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 11
6 15
7 17
8 27
9 121
10 187
11 191
12 275
13 277
14 573
15 831
16 14641
17 14653
18 109443
19 109451
20 131877
21 161183
22 249101
23 249103
24 254221
25 214710409
26 1603785503
27 3146151623077
28 23500268975459
29 23500268975497
30 352504034632455
31 352504034632459
32 675511501766876508493
33 8283939628810696270871857123

List of values

[1, 3, 5, 9, 11, 15, 17, 27, 121, 187, 191, 275, 277, 573, 831, 14641, 14653, 109443, 109451, 131877, 161183, 249101, 249103, 254221, 214710409, 1603785503, 3146151623077, 23500268975459, 23500268975497, 352504034632455, 352504034632459, 675511501766876508493, 8283939628810696270871857123]