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!)
A178924 Sum_{k>0} (n mod k) * 2^(n-k). 0

%I #11 Mar 30 2012 19:00:32

%S 0,1,2,5,6,23,16,89,106,267,364,1741,526,5135,9360,17681,16914,99347,

%T 71188,404501,372758,892951,1763352,7720985,2809882,17154075,34201628,

%U 82821149,83623966,435683359,189300768,1452343329,1695678498,4418961443,8835694628

%N Sum_{k>0} (n mod k) * 2^(n-k).

%p a:= n-> add ((n mod k) * 2^(n-k), k=1..n-1) + n:

%p seq (a(n), n=0..40);

%t Table[Sum[Mod[n, k] 2^(n-k), {k, 1, Infinity}], {n, 0, 100}]

%K nonn

%O 0,3

%A _Vladimir Reshetnikov_, Dec 29 2010

%E Edited by _Alois P. Heinz_, Dec 29 2010

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 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)