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.

A272857 Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).

Table of values

n a(n)
1 3
2 3
3 13
4 61
5 61
6 421
7 2521
8 2521
9 2521
10 55441
11 55441
12 4324321
13 4324321
14 4324321
15 4324321
16 85765681
17 85765681
18 232792561
19 232792561
20 232792561
21 232792561

List of values

[3, 3, 13, 61, 61, 421, 2521, 2521, 2521, 55441, 55441, 4324321, 4324321, 4324321, 4324321, 85765681, 85765681, 232792561, 232792561, 232792561, 232792561]