login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258368 Smallest odd prime p such that A258367(p) = n, or 0 if no such p exists. 1
1093, 3, 17, 11, 59, 13, 571, 1451, 19, 41, 911, 197, 349, 227, 29, 113, 257, 223, 37, 739, 97, 109, 47, 719, 83, 179, 6619, 3361, 73, 283, 79, 401, 199, 39929, 229, 277, 17667847, 281, 29759, 293, 887, 157, 137, 1709 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Is a(n) > 0 for all n?

LINKS

Table of n, a(n) for n=0..43.

PROG

(PARI) a258367(n) = a=0; while(Mod(2, n^2)^((n-1)/2)!=1+a*n && Mod(2, n^2)^((n-1)/2)!=-1+a*n && Mod(2, n^2)^((n-1)/2)!=1-a*n && Mod(2, n^2)^((n-1)/2)!=-1-a*n, a++); a

for(n=0, 40, p=3; while(a258367(p)!=n, p=nextprime(p+1)); print1(p, ", "))

CROSSREFS

Cf. A258367.

Sequence in context: A288097 A281001 A271100 * A174422 A255838 A253234

Adjacent sequences:  A258365 A258366 A258367 * A258369 A258370 A258371

KEYWORD

nonn,more

AUTHOR

Felix Fröhlich, May 28 2015

EXTENSIONS

a(36)-a(43) from Giovanni Resta, Jun 15 2015

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)