This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212912 Numbers n such that 3^(m+3)==9(mod m) where m=(n-1)^2-1 0

%I

%S 3,5,7,11,17,37,47,53,67,97,101,121,211,257,367,379,457,617,911,1091,

%T 1237,1297,1361,1549,2003,2557,2851,2897,3517,3733,4201

%N Numbers n such that 3^(m+3)==9(mod m) where m=(n-1)^2-1

%C Composite begin - 121, 108781, 155365, 267547, 2774521, 3166087, 3225601, 4907701, 8341201, 10712857, 11035921, 13216141, 17559829, 21708961, 29641921, 31116241, 31150351.... all composite == 1(mod 3) ???

%o (PARI) for(n=2, 1000, m=n^2-1; if(Mod(3, m)^(m+3)==9, print(n+1)));

%K nonn

%O 1,1

%A _Alzhekeyev Ascar M_, May 30 2012

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

Last modified October 21 20:44 EDT 2019. Contains 328315 sequences. (Running on oeis4.)