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!)
A256368 Primes arising from A098550(n), n >= 2, as smallest prime factor of gcd(A098550(n), A098550(n+2)). 2

%I #15 Aug 01 2019 03:47:11

%S 2,3,2,3,2,5,2,5,2,5,2,7,2,7,2,3,2,3,11,13,11,13,3,2,3,2,17,2,17,2,5,

%T 2,5,2,13,2,7,2,7,19,3,19,2,19,2,3,2,23,2,23,2,5,2,3,2,3,2,29,31,29,

%U 31,2,3,2,11,2,7,2

%N Primes arising from A098550(n), n >= 2, as smallest prime factor of gcd(A098550(n), A098550(n+2)).

%C Conjecture: the sequence contains all primes such that the first appearances of them are in the nature order.

%H Peter J. C. Moses, <a href="/A256368/b256368.txt">Table of n, a(n) for n = 2..1001</a>

%Y Cf. A098550, A256189, A256366.

%K nonn

%O 2,1

%A _Vladimir Shevelev_, Mar 26 2015

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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)