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.

A083348 Numbers k such that r(k) = Sum(e/p: k = Product(p^e)) > 1.

Original entry on oeis.org

8, 12, 16, 18, 20, 24, 28, 30, 32, 36, 40, 44, 48, 52, 54, 56, 60, 64, 68, 72, 76, 80, 81, 84, 88, 90, 92, 96, 100, 104, 108, 112, 116, 120, 124, 126, 128, 132, 135, 136, 140, 144, 148, 150, 152, 156, 160, 162, 164, 168, 172, 176, 180, 184, 188, 189, 192, 196, 198
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 25 2003

Keywords

Comments

The number of terms not exceeding 10^m, for m = 1, 2, ..., are 1, 29, 318, 3174, 31763, 317813, 3177179, 31774009, 317745099, 3177373819, ... . Apparently, the asymptotic density of this sequence exists and equals 0.3177... . - Amiram Eldar, Jun 24 2022

Crossrefs

Cf. A003415, A072873, A051674, A083345, A083346, A083347, A168036, A369048 (characteristic function), A369049.
Subsequence of A100717.

Programs

  • Haskell
    a083348 n = a083348_list !! (n-1)
    a083348_list = filter ((> 0) . a168036) [1..]
    -- Reinhard Zumkeller, May 22 2015, May 10 2011
  • Mathematica
    ad[n_] := Switch[n, 0 | 1, 0, _, If[PrimeQ[n], 1, Sum[Module[ {p, e}, {p, e} = pe; n e/p], {pe, FactorInteger[n]}]]];
    Select[Range[1000], ad[#] > # &] (* Jean-François Alcover, May 04 2023 *)

Formula

A083345(a(n)) > A083346(a(n)).
A168036(a(n)) > 0. - Reinhard Zumkeller, May 22 2015