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!)
A270884 Smallest of 4 consecutive prime numbers that when represented as a simple continued fraction, generates prime numbers in the numerator and denominator, when reduced. 1

%I #12 Sep 06 2020 14:36:02

%S 41,367,619,659,701,2267,2789,3253,3463,6917,8969,9221,11959,13499,

%T 14431,17359,17851,20143,22283,23669,26107,27847,28547,28879,29537,

%U 32503,32717,32987,37549,40709,40849,41647,45971

%N Smallest of 4 consecutive prime numbers that when represented as a simple continued fraction, generates prime numbers in the numerator and denominator, when reduced.

%C Order in which the simple continued fraction generated is important. In this case increasing order.

%H Abhiram R Devesh, <a href="/A270884/b270884.txt">Table of n, a(n) for n = 1..100</a>

%e for a = 41, the set is [41, 43, 47, 53] in simple continued fraction is

%e 41 + 1

%e ----------------

%e 43 + 1

%e ---------

%e 47 + 1

%e ----

%e 53

%e When reduced 4398061/107209; where 4398061 and 107209 are both primes.

%t Select[Prime@ Range[10^4], AllTrue[{Numerator@ #, Denominator@ #} &@ FromContinuedFraction@ Prime@ Range[#, # + 3] &@ PrimePi@ #, PrimeQ] &] (* _Michael De Vlieger_, Apr 02 2016, Version 10 *)

%t cfpnQ[lst_]:=Module[{fcf=FromContinuedFraction[lst]},AllTrue[{Numerator[ fcf],Denominator[ fcf]},PrimeQ]]; Select[Partition[Prime[ Range[ 5000]],4,1],cfpnQ][[All,1]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Sep 06 2020 *)

%K hard,nonn

%O 1,1

%A _Abhiram R Devesh_, Mar 25 2016

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)