OFFSET
1,3
COMMENTS
This is a composition f(g(x)). g(x) = lcm(1...x) and f(x) = phi(x), Euler's totient function. The sequence generated is the number of prime congruence classes (prime spokes) for wheel factorization in mod g(x).
First column of A096180. - Eric Desbiaux, Apr 23 2013
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
FORMULA
From Peter Bala, Feb 19 2019: (Start)
a(n) = Product_{k = 1..n} A072211(k).
With p denoting a prime, a(n) = ( Product_{p <= n} (p - 1) ) * ( Product_{p^2 <= n} p ) * ( Product_{p^3 <= n} p ) * ... . For example, a(16) = ((2-1)*(3-1)*(5-1)*(7-1)*(11-1)*(13-1)) * (2*3) * 2 * 2 = 138240. (End)
MAPLE
with(numtheory): a:=n->phi(lcm(seq(m, m=1..n))): seq(a(n), n=1..40); # Muniru A Asiru, Feb 20 2019
MATHEMATICA
EulerPhi[Table[LCM @@ Range[n], {n, 35}]] (* T. D. Noe, Oct 16 2012 *)
PROG
(Haskell)
a217863 = a000010 . a003418 -- Reinhard Zumkeller, Nov 24 2012
(PARI) a(n) = eulerphi(lcm(vector(n, k, k))); \\ Michel Marcus, Aug 25 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Joshua S.M. Weiner, Oct 13 2012
STATUS
approved