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.
%I A068795 #13 Oct 25 2024 13:22:31 %S A068795 1,2,3,4,5,9,7,8,9,25,11,27,13,49,25,16,17,27,19,125,49,121,23,81,25, %T A068795 169,27,343,29,125,31,32,121,289,49,81,37,361,169,625,41,343,43,1331, %U A068795 125,529,47,243,49,125,289,2197,53,81,121,2401,361,841,59,625,61 %N A068795 In prime factorization of n replace all primes with the greatest prime factor of n; a(1)=1. %F A068795 a(n) = A006530(n)^A001222(n). %F A068795 A068794(n) <= n <= a(n). %F A068795 a(n) = A068794(n) iff n = 1 or n = p^k for some prime p, k > 0. %e A068795 a(30) = a(2*3*5) = 5*5*5 = 125. %p A068795 with(NumberTheory): A068795 := n -> max(PrimeFactors(n))^Omega(n): %p A068795 seq(A068795(n), n = 1..61); # _Peter Luschny_, Oct 25 2024 %Y A068795 Cf. A001222, A006530, A068794. %K A068795 nonn %O A068795 1,2 %A A068795 _Reinhard Zumkeller_, Mar 05 2002