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.

A066670 Primes arising in A066669: the only odd prime divisor of phi(A066669(n)).

Original entry on oeis.org

3, 3, 5, 3, 3, 3, 3, 5, 11, 5, 3, 3, 7, 5, 3, 3, 3, 5, 3, 5, 3, 11, 23, 5, 3, 13, 5, 3, 7, 29, 3, 5, 11, 3, 3, 5, 3, 5, 41, 3, 7, 5, 11, 3, 11, 23, 3, 5, 3, 3, 13, 53, 5, 3, 7, 11, 7, 29, 3, 5, 3, 5, 17, 11, 3, 23, 3, 7, 37, 5, 3, 3, 13, 5, 5, 41, 83, 3, 43, 7, 5, 29, 11, 89, 3, 11, 5, 23, 3, 3
Offset: 1

Views

Author

Labos Elemer, Dec 18 2001

Keywords

Examples

			A066669(9) = 23, phi(23) = 2*11, so a(9)=11.
		

Crossrefs

Programs

  • Mathematica
    Select[Array[#/2^IntegerExponent[#, 2] &@ EulerPhi@ # &, 200], PrimeQ]  (* Michael De Vlieger, Dec 08 2018 *)
  • PARI
    lista(nn) = {for (n=1, nn, en=eulerphi(n); if (isprime(p=en>>valuation(en, 2)), print1(p, ", ")); ); } \\ Michel Marcus, Dec 08 2018

Formula

From Amiram Eldar, Jul 18 2024: (Start)
a(n) = A053575(A066669(n)).
a(n) = A000265(A000010(A066669(n))) = A006530(A000010(A066669(n))). (End)