Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Sep 16 2015 13:41:39
%S 5,8,12,20,30,36,42,64,108,140,176,216,286,364,390,432,510,558,760,
%T 1000,1092,1188,1426,1632,1650,1690,1782,1848,2146,2520,2790,2976,
%U 3102,3366,3780,4140,4292,4446,4914,5360,5822,6300,6450,6776,7110,7360,7614,7728
%N a(n) = A134207(n) + A134207(n-1).
%C a(n) is divisible by n for every n.
%t a = {2}; For[n = 1, n < 100, n++, i = 1; While[Not[Mod[a[[ -1]] + Prime[PrimePi[a[[ -1]]] + i], n] == 0], i++ ]; AppendTo[a, Prime[PrimePi[ a[[ -1]]] + i]]]; c = {}; For[b = 1, b < Length[a], b++, AppendTo[c, a[[b]] + a[[b + 1]]]]; c (* _Stefan Steinerberger_, Oct 17 2007 *)
%Y Cf. A134207, A134209.
%K nonn
%O 1,1
%A _Leroy Quet_, Oct 14 2007
%E More terms from _Stefan Steinerberger_, Oct 17 2007