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.

A241977 Numbers k>1 such that 10^phi(k) == 1 (mod k^2), where phi(n)=A000010(n).

Table of values

n a(n)
1 3
2 487
3 1461
4 4383
5 13149
6 39447
7 118341
8 355023
9 56598313
10 169794939
11 509384817
12 1754547703
13 5263643109
14 7187985751
15 15790929327
16 21563957253
17 27563378431
18 33902389487
19 47372787981
20 50315900257
21 64691871759
22 82690135293
23 101707168461
24 150947700771

List of values

[3, 487, 1461, 4383, 13149, 39447, 118341, 355023, 56598313, 169794939, 509384817, 1754547703, 5263643109, 7187985751, 15790929327, 21563957253, 27563378431, 33902389487, 47372787981, 50315900257, 64691871759, 82690135293, 101707168461, 150947700771]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.