login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333449 a(n) = Sum_{k=1..n} prime(floor(n/k)). 1
2, 5, 9, 14, 20, 27, 33, 40, 48, 61, 65, 80, 86, 95, 107, 120, 128, 141, 149, 168, 178, 189, 195, 218, 232, 243, 253, 268, 272, 297, 313, 330, 342, 353, 373, 396, 404, 419, 431, 458, 466, 483, 495, 510, 530, 539, 553, 594, 604, 627, 641, 660, 664, 689, 703, 726, 742, 749, 757, 798 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..60.

FORMULA

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

Sum_{k=1..n} mu(k) * a(floor(n/k)) = prime(n).

MATHEMATICA

Table[Sum[Prime[Floor[n/k]], {k, 1, n}], {n, 1, 60}]

g[1] = 2; g[n_] := Prime[n] - Prime[n - 1]; a[n_] := Sum[Sum[g[d], {d, Divisors[k]}], {k, 1, n}]; Table[a[n], {n, 1, 60}]

PROG

(PARI) a(n) = sum(k=1, n, prime(n\k)); \\ Michel Marcus, Mar 22 2020

CROSSREFS

Cf. A000040, A001223, A007445, A007504, A008683, A333450.

Sequence in context: A266450 A132296 A275586 * A075543 A132315 A079509

Adjacent sequences:  A333446 A333447 A333448 * A333450 A333451 A333452

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Mar 21 2020

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 12:37 EST 2020. Contains 338639 sequences. (Running on oeis4.)