cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A219730 Sum_{x <= n} smallest divisor of x that is >= sqrt(x).

Original entry on oeis.org

1, 3, 6, 8, 13, 16, 23, 27, 30, 35, 46, 50, 63, 70, 75, 79, 96, 102, 121, 126, 133, 144, 167, 173, 178, 191, 200, 207, 236, 242, 273, 281, 292, 309, 316, 322, 359, 378, 391, 399, 440, 447, 490, 501, 510, 533, 580, 588, 595, 605, 622, 635, 688, 697, 708, 716
Offset: 1

Views

Author

Michel Marcus, Nov 26 2012

Keywords

Comments

G. Tenenbaum proved that a(n) is asymptotically equal to (Pi^2/12)*n^2/log(n) (Théorème 2).

Crossrefs

Programs

  • Maple
    g:= proc(n) min(select(t -> t^2 >= n, numtheory:-divisors(n))) end proc:
    ListTools:-PartialSums(map(g, [$1..100])); # Robert Israel, Nov 22 2024
  • Mathematica
    Accumulate[Table[First[Select[Divisors[n],#>=Sqrt[n]&]],{n,56}]] (* James C. McMahon, Jun 18 2024 *)

A161416 Partial sums of A056737.

Original entry on oeis.org

0, 1, 3, 3, 7, 8, 14, 16, 16, 19, 29, 30, 42, 47, 49, 49, 65, 68, 86, 87, 91, 100, 122, 124, 124, 135, 141, 144, 172, 173, 203, 207, 215, 230, 232, 232, 268, 285, 295, 298, 338, 339, 381, 388, 392, 413, 459, 461, 461, 466, 480, 489, 541, 544, 550, 551, 567, 594
Offset: 1

Views

Author

Omar E. Pol, Jun 21 2009

Keywords

Crossrefs

Formula

a(n) = A219730(n) - A219729(n). - Tamas Sandor Nagy, Jan 20 2024

Extensions

Extended beyond a(16) by R. J. Mathar, Aug 01 2009
Showing 1-2 of 2 results.