login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A259349 Numbers n such that n-1, n, and n+1 are all products of 6 distinct primes. 8

%I

%S 1990586014,1994837494,2129658986,2341714794,2428906514,2963553594,

%T 3297066410,3353808094,3373085990,3623442746,3659230730,3809238770,

%U 3967387346,4058711734,4144727994,4196154390,4502893746,4555267690,4653623534

%N Numbers n such that n-1, n, and n+1 are all products of 6 distinct primes.

%C A subsequence of A169834.

%C The rudimentary method employed by the below PARI program reaches the limit of its usefulness here. Contrast it with the method required for A259350, which is over 4.5 orders of magnitude faster than the analog of this (and may still be some distance best).

%C a(1)=A093550(6) (that sequence's 5th term, with offset 2). The program arbitrarily makes use of this knowledge, but will run (slower) without it.

%H Giovanni Resta, <a href="/A259349/b259349.txt">Table of n, a(n) for n = 1..10000</a>

%e 1990586013 = 3*13*29*67*109*241,

%e 1990586014 = 2*23*37*43*59*461, and

%e 1990586015 = 5*11*17*19*89*1259; and no smaller trio of this kind exists, making the middle value a(1).

%o (PARI)

%o {

%o \\Program initialized with known a(1).\\

%o \\The purpose of vector s and value u\\

%o \\is to skip bad values modulo 36.\\

%o k=1990586014;s=[4,4,8,8,8,4];u=1;

%o while(1,

%o if(issquarefree(k),

%o if(issquarefree(k-1),

%o if(issquarefree(k+1),

%o if(omega(k)==6,

%o if(omega(k-1)==6,

%o if(omega(k+1)==6,

%o print1(k" ")))))));

%o k+=s[u];if(u==6,u=1,u++))

%o }

%Y Cf. A093550, A169834, A248201, A248202, A248203, A248204, A259350, A259801.

%K nonn

%O 1,1

%A _James G. Merickel_, Jun 24 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:38 EDT 2021. Contains 343201 sequences. (Running on oeis4.)