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 A285327 #8 Apr 20 2017 09:21:12
%S A285327 0,3,6,5,12,7,10,9,24,11,18,13,20,15,18,17,48,19,22,21,36,23,26,25,40,
%T A285327 27,34,29,36,31,34,33,96,35,38,37,68,39,42,41,72,43,50,45,52,47,50,49,
%U A285327 80,51,54,53,68,55,58,57,72,59,66,61,68,63,66,65,192,67,70,69,132,71,74,73,136,75,82,77,84,79,82,81,144,83,86,85,100,87,90,89
%N A285327 Row 3 of A285325: a(n) = A048675(A065642(A065642(A019565(n)))).
%H A285327 Antti Karttunen, <a href="/A285327/b285327.txt">Table of n, a(n) for n = 0..8191</a>
%F A285327 a(n) = A048675(A065642(A065642(A019565(n)))).
%o A285327 (PARI)
%o A285327 A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from _M. F. Hasler_
%o A285327 A048675(n) = my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; \\ _Michel Marcus_, Oct 10 2016
%o A285327 A007947(n) = factorback(factorint(n)[, 1]); \\ From _Andrew Lelechenko_, May 09 2014
%o A285327 A065642(n) = { my(r=A007947(n)); if(1==n,n,n = n+r; while(A007947(n) <> r, n = n+r); n); };
%o A285327 A285327(n) = A048675(A065642(A065642(A019565(n))));
%o A285327 (Scheme) (define (A285327 n) (A048675 (A065642 (A065642 (A019565 n)))))
%Y A285327 Row 3 of A285325 (after the initial zero).
%Y A285327 Cf. A007947, A019565, A048675, A065642, A285323, A285324.
%K A285327 nonn
%O A285327 0,2
%A A285327 _Antti Karttunen_, Apr 19 2017