This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014837 Sum of all the digits of n in every base from 2 to n-1. 7


%S 2,3,7,9,15,16,20,24,34,33,45,51,59,57,73,72,90,91,103,113,135,127,

%T 143,155,167,170,198,192,222,220,240,256,280,260,296,314,338,332,372,

%U 366,408,415,429,451,497,471,507,514,546,555,607,597,637,633,669,697

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

%H Vincenzo Librandi, <a href="/A014837/b014837.txt">Table of n, a(n) for n = 3..10000</a>

%t Table[Plus @@ Flatten[Table[IntegerDigits[n, b], {b, 2, n - 1}]], {n, 3, 36}] [From _Alonso del Arte_, Mar 28 2009]

%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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 27 08:39 EST 2015. Contains 264541 sequences.