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!)
A345028 a(n) = Sum_{k=1..n} 2^(floor(n/k) - 1). 4

%I #18 Jun 07 2021 09:05:12

%S 1,3,6,12,21,41,74,144,275,541,1054,2102,4151,8281,16484,32938,65707,

%T 131391,262464,524878,1049201,2098291,4195444,8390860,16779477,

%U 33558743,67113306,134226304,268444033,536887965,1073758878,2147517156,4295001319,8590001385,17179936018

%N a(n) = Sum_{k=1..n} 2^(floor(n/k) - 1).

%H Seiichi Manyama, <a href="/A345028/b345028.txt">Table of n, a(n) for n = 1..3000</a>

%F G.f.: (1/(1 - x)) * Sum_{k>=1} x^k * (1 - x^k)/(1 - 2*x^k).

%t a[n_] := Sum[2^(Floor[n/k] - 1), {k, 1, n}]; Array[a, 35] (* _Amiram Eldar_, Jun 06 2021 *)

%o (PARI) a(n) = sum(k=1, n, 2^(n\k-1));

%o (PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, x^k*(1-x^k)/(1-2*x^k))/(1-x))

%Y Column k=2 of A345032.

%Y Cf. A000225, A271860, A345034.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Jun 06 2021

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 September 15 19:05 EDT 2024. Contains 375954 sequences. (Running on oeis4.)