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!)
A113540 a(n) is the minimal k such that 5^n +/- k are primes. 0

%I #5 Oct 31 2013 12:17:35

%S 2,6,12,6,42,18,66,126,144,762,78,318,1026,84,264,354,288,102,1242,

%T 162,168,318,2058,234,2352,252,2532,42,342,102,2034,2946,222,606,882,

%U 348,3366,2472,264,2988,2466,336,666,762,222,438,3432,6834,3816,588,1818

%N a(n) is the minimal k such that 5^n +/- k are primes.

%e a(1)=2 because 5^1 +/- 2 are primes; a(2)=6 because 5^2 +/- 6 are primes.

%t f[n_] := Block[{k = 2}, While[ ! PrimeQ[5^n + k] || ! PrimeQ[5^n - k], k += 2]; k]; Array[f, 51] (* _Robert G. Wilson v_ *)

%K nonn

%O 1,1

%A _Zak Seidov_, Jan 13 2006

%E Corrected and extended by _Robert G. Wilson v_, Jan 18 2006

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 May 1 20:04 EDT 2024. Contains 372176 sequences. (Running on oeis4.)