cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A123342 Least m such that 2^n+5^m is prime.

This page as a plain text file.
%I A123342 #14 Nov 23 2024 14:25:44
%S A123342 0,0,0,1,0,1,2,5,0,5,2,1,4,3,6,11,0,19,14,3,2,5,2,3,16,11,66,35,4,7,
%T A123342 122,17,14,13,2,3,4,15,34,52519,4,3,22,29,10,29,6,1,4,5,38
%N A123342 Least m such that 2^n+5^m is prime.
%C A123342 a(51) > 10^5
%e A123342 a(0)=0 because 2^0+5^0=1+1=2 is prime.
%t A123342 f[n_] := Block[{p = If[n < 3 || EvenQ@n, 0, 1]}, While[ !PrimeQ[5^p + 2^n ], p += 2 ]; p] ; Table[f@n, {n, 0, 38}] (* _Robert G. Wilson v_ *)
%o A123342 (PARI) for(n=0,38,k=2^n;m=0;while(!isprime(k+5^m),m++);print1(m,",")) \\ _Klaus Brockhaus_, Oct 15 2006
%Y A123342 Cf. A123252.
%K A123342 nonn,hard,more
%O A123342 0,7
%A A123342 _Zak Seidov_, Oct 11 2006
%E A123342 Entries through a(38) checked by _Klaus Brockhaus_, Oct 15 2006
%E A123342 a(40)-a(50) from _Robert G. Wilson v_, Nov 14 2006
%E A123342 a(39)=52519 from _Max Alekseyev_, Mar 15 2011