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!)
A102873 Prime differences between 2^n and 3^m when they are nearly equal for n and m to 200. 0

%I #4 Mar 31 2012 20:01:51

%S 5,7,13,47,502829,95622386615329600236050591,

%T 31282850202880064644204601069,463689046302626373360766753609741,

%U 15491551101739718820967497643203613

%N Prime differences between 2^n and 3^m when they are nearly equal for n and m to 200.

%C The first array "c" can be used to extend A102872. d = Delete[Union[Table[If[PrimeQ[c[[n]]], c[[n]], 0], {n, 1, Length[c]}]], 1] finds the primes in this line between 2^n and 3^m.

%F a(q) = If 2^n and 3^m are such that 2^n>3^n and Floor[2^n/3^m]<2 and when Abs[2^n-3^m] if prime, then a[q]=Abs[2^n-3^m]

%t c = Delete[Union[Flatten[Table[Table[If [ (2^n > 3^m) && Floor[2^n/3^m] < 2, Abs[2^n - 3^m], 0], {m, 1, n}], {n, 1, 200}], 1]], 1] d = Delete[Union[Table[If[PrimeQ[c[[n]]], c[[n]], 0], {n, 1, Length[c]}]], 1]

%K nonn

%O 1,1

%A _Roger L. Bagula_, Mar 01 2005

%E Is this well-defined? "Up to 200" bothers me. - _N. J. A. Sloane_.

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)