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.

A245529 Numbers n such that 12^phi(n) == 1 (mod n^2), where phi(n) is Euler's totient function.

Table of values

n a(n)
1 2693
2 123653
3 1812389
4 2349407
5 12686723
6 201183431
7 332997529
8 3822485189
9 6326953051
10 54520709801
11 224107337017
12 272603549005
13 541786979683
14 1035893486219
15 1568751359119
16 4258039403323
17 5179467431095
18 10293952613977
19 29806275823261

List of values

[2693, 123653, 1812389, 2349407, 12686723, 201183431, 332997529, 3822485189, 6326953051, 54520709801, 224107337017, 272603549005, 541786979683, 1035893486219, 1568751359119, 4258039403323, 5179467431095, 10293952613977, 29806275823261]