|
%I #7 Aug 08 2015 22:31:33
%S 1,2,3,2,5,3,7,2,3,2,11,3,13,2,3,2,17,3,19,2,3,2,23,3,5,2,3,2,29,3,31,
%T 2,3,2,5,3,37,2,3,2,41,3,43,2,3,2,47,3,7,2,3,2,53,3,5,2,3,2,59,3,61,2,
%U 3,2,5,3,67,2,3,2,71,3,73,2,3,2,7,3,79,2,3,2,83,3,5,2,3,2,89,3,7,2,3,2,5,3
%N a(n)^(n/a(n)) = A092975(n) and a(n) is a prime.
%p A092975 := proc(n) local d,a ; a :=0 ; for d in numtheory[divisors](n) do a := max(a, (n/d)^d) ; od: RETURN(a) ; end: A109674 := proc(n) local d,a092975,p ; if n = 1 then RETURN(1) ; fi ; a092975 := A092975(n) ; for d in numtheory[divisors](n) do p := n/d ; if isprime(p) and p^(n/p) = a092975 then RETURN(p) ; fi ; od: end: seq( A109674(n),n=1..120) ; # _R. J. Mathar_, Feb 12 2008
%K easy,nonn
%O 1,2
%A _Vladeta Jovovic_, Aug 06 2005
%E More terms from _R. J. Mathar_, Feb 12 2008
|
