login

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”).

a(n) = the digit sum of prime(n) + the digit product of prime(n).
1

%I #17 Sep 08 2022 08:46:11

%S 4,6,10,14,3,7,15,19,11,29,7,31,9,19,39,23,59,13,55,15,31,79,35,89,79,

%T 2,4,8,10,8,24,8,32,40,50,12,48,28,56,32,80,18,20,40,80,100,6,19,39,

%U 49,26,68,15,18,84,47,125,24,114,27,61,68,10,8,16,32,16

%N a(n) = the digit sum of prime(n) + the digit product of prime(n).

%H Harvey P. Dale, <a href="/A255005/b255005.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A007605(n) + A053666(n).

%e Prime(5)=11 and (1*1) + (1+1) = 3 so a(5) = 3.

%e Prime(10)=29 and (2*9) + (2+9) = 29 so a(10) = 29.

%t Table[Plus @@ IntegerDigits[Prime[n]] + Times @@ IntegerDigits[Prime[n]], {n, 80}] (* _Bruno Berselli_, Feb 12 2015 *)

%t dsdp[n_]:=Module[{idpn=IntegerDigits[Prime[n]]},Total[idpn]+Times@@idpn]; dsdp/@Range[70] (* _Harvey P. Dale_, Mar 05 2017 *)

%o (Magma) [&*Intseq(NthPrime(n))+&+Intseq(NthPrime(n)): n in [1..80]];

%Y Subsequence of A061762.

%Y Cf. A007605, A053666.

%K nonn,base

%O 1,1

%A _Vincenzo Librandi_, Feb 12 2015