cp's OEIS Frontend

A248204 Middle values in trios of products of 5 distinct primes.

%I A248204 #40 Jul 24 2015 01:14:49
%S A248204 16467034,18185870,21134554,21374354,21871366,22247554,22412534,
%T A248204 22721586,24845314,25118094,25228930,25435334,25596934,26217246,
%U A248204 27140114,29218630,29752346,30323734,30563246,31943066,32663266,33367894,36055046,38269022,39738062,40547066
%N A248204 Middle values in trios of products of 5 distinct primes.
%C A248204 A subsequence of A066509 and offset by 1 from A192203.
%H A248204 James G. Merickel, <a href="/A248204/b248204.txt">Table of n, a(n) for n = 1..26</a>
%F A248204 a(n) = A192203(n) + 1.
%e A248204 16467033=3*11*17*149*197,
%e A248204 16467034=2*19*23*83*227, and
%e A248204 16467035=5*13*37*41*167,
%e A248204 with no smaller similar trio. So a(1)=16467034. [Corrected by _James G. Merickel_, Jul 23 2015]
%o A248204 (PARI)
%o A248204 {
%o A248204 \\ This program checks all consecutives with elements not divisible \\
%o A248204 \\ by the squares of 2 or 3. More efficiency is required if enormous \\
%o A248204 \\ numbers of terms are sought and for the analog sequences beyond \\
%o A248204 \\ 6 prime factors. The start value is A093550(5). If a start other \\
%o A248204 \\ than this is chosen, one must be sure that (one of) s or u is \\
%o A248204 \\ adjusted if it needs to be. \\
%o A248204 n=16467034;s=[8,4,4,4,8,8];u=1;
%o A248204 while(1,
%o A248204   if(issquarefree(n) && issquarefree(n-1) && issquarefree(n+1) && omega(n)==5 && omega(n-1)==5 && omega(n+1)==5, print1(n" "));
%o A248204   n+=s[u];
%o A248204   if(u==6,u=1,u++)
%o A248204 )
%o A248204 } \\ _James G. Merickel_, Jul 23 2015
%Y A248204 Cf. A066509, A192203, A248201, A248202, A248203, A259349, A259350, A259801.
%K A248204 nonn
%O A248204 1,1
%A A248204 _James G. Merickel_, Oct 28 2014