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.

A078315 Minimum exponent in prime factorization of n*rad(n)+1, where rad = A007947 (the radical or squarefree kernel).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 23 2002

Keywords

Comments

2 = a(4) = a(45) = a(48) = a(140) = a(529) = a(682) = a(3264) = a(3564) = a(4680) = a(4756) = a(166320) = a(194873) = a(330096) = a(364905) = a(2100332) = a(4160200) with all terms in between equal to 1. Is there an n with a(n) > 2? - Charles R Greathouse IV, May 20 2013

Crossrefs

Programs

  • Haskell
    a078315 = a051904 . a078310  -- Reinhard Zumkeller, Jul 23 2013
  • Mathematica
    a[n_] := Min[FactorInteger[1 + n * Times @@ FactorInteger[n][[;;, 1]]][[;;, 2]]]; Array[a, 100] (* Amiram Eldar, Sep 08 2024 *)
  • PARI
    a(n)=my(f=factor(n));f[,2]=apply(n->n+1,f[,2]);vecmin(factor(factorback(f)+1)[,2]) \\ Charles R Greathouse IV, May 20 2013
    

Formula

a(n) = A051904(A078310(n)).