OFFSET
1,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
MATHEMATICA
A014076 := Select[Range[1, 350, 2], PrimeOmega[#] != 1 &]; Table[ EulerPhi[A014076[[n]]], {n, 1, 50}] (* G. C. Greubel, Sep 17 2017 *)
PROG
(PARI) je=[]; forstep(n=1, 301, 2, if(isprime(n), n+1, je=concat(je, eulerphi(n)))); je
(Python)
from sympy import primepi, totient
def A062533(n):
if n == 1: return 1
m, k = n-1, primepi(n) + n - 1 + (n>>1)
while m != k:
m, k = k, primepi(k) + n - 1 + (k>>1)
return totient(m) # Chai Wah Wu, Jul 31 2024
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Jul 10 2001
STATUS
approved