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.

A335876 a(1) = 2, and for n > 1, a(n) = n + (n/p), where p is largest prime dividing n, A006530(n).

Original entry on oeis.org

2, 3, 4, 6, 6, 8, 8, 12, 12, 12, 12, 16, 14, 16, 18, 24, 18, 24, 20, 24, 24, 24, 24, 32, 30, 28, 36, 32, 30, 36, 32, 48, 36, 36, 40, 48, 38, 40, 42, 48, 42, 48, 44, 48, 54, 48, 48, 64, 56, 60, 54, 56, 54, 72, 60, 64, 60, 60, 60, 72, 62, 64, 72, 96, 70, 72, 68, 72, 72, 80, 72, 96, 74, 76, 90, 80, 84, 84, 80, 96, 108, 84, 84
Offset: 1

Views

Author

Antti Karttunen, Jun 28 2020

Keywords

Crossrefs

Cf. A006530, A052126, A171462, A331410, A334097, A335431 (positions of two's powers > 2).

Programs

  • Mathematica
    Array[# (1 + 1/FactorInteger[#][[-1, 1]]) &, 83] (* Michael De Vlieger, Jul 08 2020 *)
  • PARI
    A335876(n) = if(1==n,2,n + (n/vecmax(factor(n)[, 1])));

Formula

a(n) = n + A052126(n).