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 A285713 #12 Jun 01 2018 21:40:49 %S A285713 1,2,2,2,6,2,8,4,2,12,6,4,2,12,2,6,6,2,12,12,2,6,6,2,12,24,2,6,32,12, %T A285713 2,2,6,6,30,2,2,210,6,60,12,2,48,24,6,6,30,6,6,30,2,120,6,2,12,72,6, %U A285713 30,2,6,12,6,12,4,6,6,48,60,6,60,6,2,24,192,6,6,24,768,2,6,2,6,6,6,2,30,6,210,6,6,12,48,6,12,6,6,96,12,6,30,12,12,2,2,6 %N A285713 a(n) = A046523(A245612(n)). %H A285713 Antti Karttunen, <a href="/A285713/b285713.txt">Table of n, a(n) for n = 0..8191</a> %F A285713 a(n) = A046523(A245612(n)). %F A285713 a(n) = A278224(A163511(n)). %F A285713 a(n) = A286613(A054429(n)). - _Antti Karttunen_, Jun 01 2018 %o A285713 (Scheme) (define (A285713 n) (A046523 (A245612 n))) %o A285713 (PARI) %o A285713 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961 %o A285713 A048673(n) = (A003961(n)+1)/2; %o A285713 A254049(n) = A048673((2*n)-1); %o A285713 A245612(n) = if(n<2,1+n,if(!(n%2),(3*A245612(n/2))-1,A254049(A245612((n-1)/2)))); %o A285713 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523 %o A285713 A285713(n) = A046523(A245612(n)); \\ _Antti Karttunen_, Jun 01 2018 %Y A285713 Cf. A046523, A163511, A245612, A278224, A278531, A285712, A286613. %Y A285713 Cf. A305434 (rgs-transform). %K A285713 nonn %O A285713 0,2 %A A285713 _Antti Karttunen_, Apr 25 2017