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 A284573 #9 Apr 12 2017 04:43:19 %S A284573 2,6,12,30,60,120,180,210,420,1080,2160,2520,2520,7560,6300,2310,4620, %T A284573 37800,90720,75600,226800,544320,453600,138600,138600,756000,2268000, %U A284573 831600,415800,2079000,485100,30030,60060,2910600,24948000,12474000,49896000,272160000,136080000,29106000,87318000,1360800000,3265920000,1496880000,748440000 %N A284573 Odd bisection of A278243: a(n) = A046523(A277324(n)). %H A284573 Antti Karttunen, <a href="/A284573/b284573.txt">Table of n, a(n) for n = 0..1024</a> %F A284573 a(n) = A046523(A277324(n)). %F A284573 a(n) = A278243((2*n)+1). %o A284573 (PARI) %o A284573 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From _Michel Marcus_ %o A284573 A260443(n) = if(n<2, n+1, if(n%2, A260443(n\2)*A260443(n\2+1), A003961(A260443(n\2)))); \\ Cf. _Charles R Greathouse IV_'s code for "ps" in A186891 and A277013. %o A284573 A277324(n) = A260443((2*n)+1); %o A284573 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From _Charles R Greathouse IV_, Aug 17 2011 %o A284573 A284573(n) = A046523(A277324(n)); %Y A284573 Cf. A007306, A046523, A277324, A278243. %K A284573 nonn %O A284573 0,1 %A A284573 _Antti Karttunen_, Apr 11 2017