cp's OEIS Frontend

A222618 Multiples of 10 that are sum of two consecutive primes.

%I A222618 #8 Feb 26 2013 18:39:01
%S A222618 30,60,90,100,120,210,240,300,320,330,340,360,390,410,450,480,520,540,
%T A222618 600,630,740,810,840,930,990,1030,1120,1140,1180,1200,1220,1230,1250,
%U A222618 1290,1300,1320,1350,1360,1410,1460,1530,1560,1620,1650,1710,1740,1770,1830
%N A222618 Multiples of 10 that are sum of two consecutive primes.
%C A222618 a(1) = 30 = A179975(1)*10^1
%C A222618 a(4) = 100 = A179975(2)*10^2
%C A222618 a(123) = 6000 = A179975(3)*10^3
%C A222618 a(925) = 60000 = A179975(4)*10^4
%C A222618 a(7266) = 600000 = A179975(5)*10^5
%C A222618 a(204645) = 14000000 = A179975(6)*10^6.
%e A222618 30 = 13 + 17, 60 = 29 + 31, 90 = 47 + 53, 100 = 47 + 53.
%t A222618 Select[(Total /@ Partition[Prime[Range[300]], 2, 1]), Mod[#, 10] < 1 &]
%o A222618 (PARI) p=13;forprime(q=17,1000,s=p+q;s%10<1&&print1(s", ");p=q)
%Y A222618 Intersection of A001043 and A008592.
%Y A222618 Cf. A179975 Least k => k*10^n is a sum of two successive primes.
%K A222618 nonn
%O A222618 1,1
%A A222618 _Zak Seidov_, Feb 26 2013