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 A285336 #15 Jun 26 2025 17:51:45 %S A285336 1,2,3,2,5,2,7,2,3,2,11,3,13,2,3,2,17,4,19,2,3,2,23,3,5,2,3,2,29,2,31, %T A285336 2,3,2,5,4,37,2,3,5,41,2,43,2,5,2,47,9,7,8,3,2,53,4,5,7,3,2,59,3,61,2, %U A285336 7,2,5,2,67,2,3,2,71,4,73,2,9,2,7,2,79,5,3,2,83,3,5,2,3,2,89,4,7,2,3,2,5,9,97,8,3,8,101,2,103,2,3,2,107,4,109,2,3 %N A285336 a(n) = numerator of A065642(n)/n. %H A285336 Antti Karttunen, <a href="/A285336/b285336.txt">Table of n, a(n) for n = 1..10000</a> %o A285336 (Scheme) (define (A285336 n) (numerator (/ (A065642 n) n))) %o A285336 (Python) %o A285336 from sympy import primefactors, prod, Integer %o A285336 def a007947(n): return 1 if n<2 else prod(primefactors(n)) %o A285336 def a065642(n): %o A285336 if n==1: return 1 %o A285336 r=a007947(n) %o A285336 n += r %o A285336 while a007947(n)!=r: %o A285336 n += r %o A285336 return n %o A285336 def a(n): return (a065642(n)/Integer(n)).numerator # _Indranil Ghosh_, Apr 20 2017 %Y A285336 Cf. A065642. %Y A285336 Cf. A285337 for the denominator. %K A285336 nonn,frac %O A285336 1,2 %A A285336 _Antti Karttunen_, Apr 19 2017