login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241977 Numbers k>1 such that 10^phi(k) == 1 (mod k^2), where phi(n)=A000010(n). 6
3, 487, 1461, 4383, 13149, 39447, 118341, 355023, 56598313, 169794939, 509384817, 1754547703, 5263643109, 7187985751, 15790929327, 21563957253, 27563378431, 33902389487, 47372787981, 50315900257, 64691871759, 82690135293, 101707168461, 150947700771 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..130 (terms < 10^15)
MATHEMATICA
Select[Range[400000], PowerMod[10, EulerPhi[#], #^2] == 1 &] (* Amiram Eldar, Oct 16 2023 *)
PROG
(PARI) for(n=2, 1e9, if(Mod(10, n^2)^(eulerphi(n))==1, print1(n, ", ")))
CROSSREFS
Sequence in context: A195611 A230029 A238447 * A045616 A198705 A198624
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Aug 10 2014
EXTENSIONS
Terms a(12) and beyond from Giovanni Resta, Jan 24 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:23 EDT 2024. Contains 371906 sequences. (Running on oeis4.)