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.

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

Table of values

n a(n)
1 11
2 22
3 44
4 55
5 110
6 220
7 440
8 880
9 1006003
10 2012006
11 4024012
12 11066033
13 22132066
14 44264132
15 55330165
16 88528264
17 110660330
18 221320660
19 442641320
20 885282640
21 1770565280
22 56224501667
23 112449003334
24 224898006668
25 393571511669
26 449796013336
27 618469518337
28 787143023338

List of values

[11, 22, 44, 55, 110, 220, 440, 880, 1006003, 2012006, 4024012, 11066033, 22132066, 44264132, 55330165, 88528264, 110660330, 221320660, 442641320, 885282640, 1770565280, 56224501667, 112449003334, 224898006668, 393571511669, 449796013336, 618469518337, 787143023338]