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.

A296078 Least number with the same prime signature as 1+phi(n), where phi = A000010, Euler totient function.

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 4, 2, 2, 2, 4, 6, 2, 2, 2, 2, 4, 2, 2, 6, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 6, 4, 2, 2, 2, 2, 6, 6, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 6, 4, 6, 2, 6, 12, 4, 2, 4, 2, 2, 2, 2, 2, 4, 2, 6, 6, 2, 2, 4, 6, 2, 6, 2, 2, 4, 2, 12, 2, 2, 2, 6, 2, 2, 2, 2, 2, 6, 2, 4, 4
Offset: 1

Views

Author

Antti Karttunen, Dec 05 2017

Keywords

Crossrefs

Cf. A039698 (positions of 2's).

Programs

  • Mathematica
    f[n_] := Block[{ps = Last@# & /@ FactorInteger[1 + EulerPhi@n]}, Times @@ ((Prime@ Range@ Length@ ps)^ps)]; Array[f, 105] (* Robert G. Wilson v, Dec 11 2017 *)
  • PARI
    A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ This function from Charles R Greathouse IV, Aug 17 2011
    A296078(n) = A046523(1+eulerphi(n));

Formula

a(n) = A046523(A039649(n)) = A046523(1+A000010(n)).