login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276959 Sum of squares of digits in all divisors of n. 1

%I #13 Sep 26 2016 22:18:53

%S 1,5,10,21,26,50,50,85,91,31,3,71,11,71,61,122,51,196,83,51,64,15,14,

%T 155,55,55,144,155,86,111,11,135,30,80,109,262,59,160,110,131,18,141,

%U 26,63,183,70,66,272,147,85,86,100,35,290,78,280,166,179,107,172,38

%N Sum of squares of digits in all divisors of n.

%e a(18) = 1^2+2^2+3^2+6^2+9^2+1^2+8^2 = 196 because divisors of 18 are 1,2,3,6,9,18.

%e a(31) = 1^2+3^2+1^2 = 11 because divisors of 31 are 1,31.

%t Table[Total@ Flatten@ Map[#^2 &, IntegerDigits@ Divisors@ n], {n, 61}] (* _Michael De Vlieger_, Sep 24 2016 *)

%o (PARI) ssd(n) = my(d=digits(n)); sum(k=1, #d, d[k]^2);

%o a(n) = sumdiv(n, d, ssd(d)); \\ _Michel Marcus_, Sep 22 2016

%Y Cf. A003132.

%K nonn,base

%O 1,2

%A _Bhushan Bade_, Sep 22 2016

%E More terms from _Michel Marcus_, Sep 22 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)