cp's OEIS Frontend

A239282 a(n) = A045917(n)*prime(n).

%I A239282 #8 Mar 17 2014 02:11:01
%S A239282 0,3,5,7,22,13,34,38,46,58,93,111,123,86,141,106,236,244,134,213,292,
%T A239282 237,332,445,388,303,515,321,436,678,381,655,822,278,745,906,785,815,
%U A239282 1169,692,895,1448,955,772,1773,796,1055,1561,681,1374,1864,1195,1446,2008
%N A239282 a(n) = A045917(n)*prime(n).
%t A239282 (*Returns the various ways a number (presumed to be even) can be split as a sum of 2 Primes.*)
%t A239282 getGoldBachSplits[n_Integer] := Module[{i, splits = {}, a, b},
%t A239282   (
%t A239282    For[i = 1,
%t A239282     Prime[i] < n,
%t A239282     i++,
%t A239282     a = Prime[i] ;
%t A239282     b = n - Prime[i];
%t A239282     If[PrimeQ[b],
%t A239282      If[MemberQ[splits, {b, a}], Null,
%t A239282       AppendTo[splits, {a, b}]],
%t A239282      Null];
%t A239282     ]; (*End For-loop...*)
%t A239282    splits
%t A239282    )
%t A239282   ]
%t A239282 (* Now we generate our series...*)
%t A239282 series[n_] :=
%t A239282 Module[{}, (Table[Prime[i]*Length[getGoldBachSplits[2 i]], {i, 2, n}])]
%Y A239282 Cf. A045917, A000040
%K A239282 nonn
%O A239282 1,2
%A A239282 _Raghavendra Ugare_, Mar 14 2014