Search: id:A114141
Results 1-1 of 1 results found.

%I A114141
%S A114141 8,6,6,6,4,4,2,2,22,6,8,2,2,20,10,4,6,8,4,4,2,4,20,10,8,6,28,2,2,8,14,
%T A114141 12,20,10,14,20,16,6,14,4,2,8,8,12,2,24,20,10,10,4,48
%N A114141 Difference between first odd semiprime > 3^n and 3^n.
%C A114141 A098147 is difference between first odd semiprime > 10^n and 10^n. How 
               can we prove that there exists an a(n) for all n? In this powers 
               of 3 sequence, does 2 occur infinitely often? Does every even integer 
               k > 0 occur?
%F A114141 a(n) = minimum integer k such that 3^n + k is an element of A046315. 
               a(n) = minimum integer k such that A000244(n) + k is an element of 
               A046315.
%e A114141 a(0) = 8 because 3^0 + 8 = 9 = 3^2 is an odd semiprime.
%e A114141 a(1) = 6 because 3^1 + 6 = 9 = 3^2 is an odd semiprime.
%e A114141 a(2) = 6 because 3^2 + 6 = 15 = 3 * 5 is an odd semiprime.
%e A114141 a(3) = 6 because 3^3 + 6 = 33 = 3 * 11 is an odd semiprime.
%e A114141 a(4) = 4 because 3^4 + 4 = 85 = 5 * 17 is an odd semiprime.
%e A114141 a(5) = 4 because 3^5 + 4 = 247 = 13 * 19 is an odd semiprime.
%Y A114141 Cf. A000244, A001358, A098147.
%Y A114141 Sequence in context: A067970 A003675 A121948 this_sequence A089139 A093209 
               A154499
%Y A114141 Adjacent sequences: A114138 A114139 A114140 this_sequence A114142 A114143 
               A114144
%K A114141 easy,nonn
%O A114141 0,1
%A A114141 Jonathan Vos Post (jvospost3(AT)gmail.com), Feb 03 2006

Search completed in 0.001 seconds