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!)
A014839 Sum of all the digits of n in every prime-power base from 2 to n-1. 3

%I #15 Sep 07 2022 04:08:33

%S 2,3,7,9,13,13,16,19,26,28,36,39,42,34,45,44,55,59,63,64,76,75,80,82,

%T 82,87,102,112,128,113,120,121,129,130,148,149,154,156,175,187,207,

%U 214,219,217,238,227,237,228,233,239,262,246,256,261,265,260,284,299

%N Sum of all the digits of n in every prime-power base from 2 to n-1.

%t Table[Sum[If[PrimePowerQ[i], Mod[Total[IntegerDigits[n, i]], n], 0], {i, 2, n-1}], {n, 3, 60}] (* _Stefano Spezia_, Sep 06 2022 *)

%Y Cf. A014836, A014837, A014838, A014840, A014841, A014842, A014843.

%K nonn,base

%O 3,1

%A _Olivier GĂ©rard_

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 July 15 00:37 EDT 2024. Contains 374323 sequences. (Running on oeis4.)