Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Jul 30 2015 22:33:03
%S 2,0,0,0,0,0,0,0,2,2,0,0,4,4,4,0,0,6,6,0,0,0,8,8,0,0,0,0,0,0,2,0,0,0,
%T 4,0,0,6,6,0,0,8,0,0,0,0,2,4,4,4,2,2,6,2,2,8,8,2,2,10,10,2,0,0,0,0,0,
%U 0,4,4,0,0,6,0,0,8,8,0,4,4,4,6,4,4,4,8,8,4,10,10,10,4,12,4,4,0,0,2,2,4,4,0
%N Sum of even digits (0,2,4,6,8) of n-th prime.
%F A104261(n) = A007605(n) - A104260(n).
%t sodev={};Do[id=IntegerDigits[Prime[i]];lid=Length[id];sod=Sum[If[EvenQ[id[[k]]], id[[k]], 0], {k, lid}];sodev={sodev, sod}, {i, 200}];sodev//Flatten
%t f[n_] := Plus @@ Select[ IntegerDigits[ Prime[n]], EvenQ[ # ] && # > 1 &]; Table[ f[n], {n, 102}] (* _Robert G. Wilson v_, Nov 03 2005 *)
%Y Sum of odd digits (1, 3, 5, 7, 9) of n-th prime: A104260, sum of prime digits (2, 3, 5, 7) of n-th prime: A104250, sum of composite (nonprime) digits (1, 4, 6, 8, 9) of n-th prime: A104251, sum of digits of primes: A007605, primes: A000040.
%K nonn,base
%O 1,1
%A _Zak Seidov_, Feb 26 2005