OFFSET
1,2
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
Table[Prime[Sum[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}]], {n, 2, 40}] (* Stefan Steinerberger, May 16 2007 *)
PROG
(PARI) d(n) = for(x=2, n, print1(prime(bigomega(x))", "))
(Python)
from sympy import prime, primefactors
def a001222(n): return 0 if n==1 else a001222(n/primefactors(n)[0]) + 1
def a(n): return 1 if n==1 else prime(a001222(n)) # Indranil Ghosh, Jun 15 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, May 03 2005
EXTENSIONS
a(1) = 1 prepended by Antti Karttunen, Jul 21 2014
STATUS
approved