login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257568 The least prime p such that the highest power of 3 that divides p^2 + 2 is n. 2
3, 2, 13, 5, 59, 751, 1237, 6053, 10427, 36671, 1532579, 351599, 356989, 12048691, 105931211, 96365273, 190612867, 18425983, 1014695321, 8763105101, 20385719771, 7508555437, 97094976593, 1911292838383, 22999364895631, 46158586887073, 6373306898393 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Hiroaki Yamanouchi, Table of n, a(n) for n = 0..500

EXAMPLE

a(0) = 3 because 3^2+2=11 not divisible by 3,

a(18) = 1014695321 because 1014695321^2+2 = 3^18*2657594587,

a(21) = 7508555437 because 7508555437^2+2 = 3^21*17*317042521.

PROG

(PARI) a(n)=if(n==1, return(2)); my(k=3^n, m=1, p); while(!issquare(m*k-2, &p) || !isprime(p), m+=2; if(m%3==0, m+=2)); p \\ Charles R Greathouse IV, May 01 2015

CROSSREFS

Cf. A257567.

Sequence in context: A093922 A075555 A075556 * A087357 A226062 A245610

Adjacent sequences:  A257565 A257566 A257567 * A257569 A257570 A257571

KEYWORD

nonn

AUTHOR

Zak Seidov, Apr 30 2015

EXTENSIONS

a(16) corrected and a(22)-a(26) added by Hiroaki Yamanouchi, May 03 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 August 8 11:31 EDT 2020. Contains 336298 sequences. (Running on oeis4.)