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 A285318 #7 Apr 18 2017 15:40:22
%S A285318 18,36,19,8194,37,2147483648,18014398509481984,8195,2056,
%T A285318 18014398509481985,67108868,16400,2057,158456325028528675187087900672,
%U A285318 2097184,67108869,5986310706507378352962293074805895248510699696029696,11972621413014756705924586149611790497021399392059392,16401,295147905179352825858,158456325028528675187087900673,34359738376
%N A285318 a(n) = A048675(A285317(n)).
%H A285318 Antti Karttunen, <a href="/A285318/b285318.txt">Table of n, a(n) for n = 1..130</a>
%F A285318 a(n) = A048675(A285317(n)).
%o A285318 (PARI)
%o A285318 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 A285318 isA285317(n) = (issquarefree(n) & (A019565(n) < n));
%o A285318 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 A285318 n=0; k=1; while(k <= 130, n=n+1; if(isA285317(n),write("b285318.txt", k, " ", A048675(n));k=k+1));
%o A285318 (Scheme) (define (A285318 n) (A048675 (A285317 n)))
%Y A285318 Cf. A048675, A285317, A285319, A285332.
%K A285318 nonn
%O A285318 1,1
%A A285318 _Antti Karttunen_, Apr 18 2017