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 A337336 #14 Aug 24 2020 22:29:31
%S A337336 1,5,13,41,25,113,61,365,313,221,85,1013,145,545,613,3281,181,2813,
%T A337336 265,1985,1513,761,421,9113,1201,1301,7813,4901,481,5513,685,29525,
%U A337336 2113,1625,2965,25313,841,2381,3613,17861,925,13613,1105,6845,15313,3785,1405,82013,7321,10805,4513,11705,1741,70313,4141,44105
%N A337336 a(n) = A048673(n^2).
%C A337336 All terms are odd and neither there are multiples of 3, thus only terms of A007310 occur here.
%H A337336 Antti Karttunen, <a href="/A337336/b337336.txt">Table of n, a(n) for n = 1..8191</a>
%H A337336 Antti Karttunen, <a href="/A337336/a337336.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A337336 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A337336 a(n) = A048673(A000290(n)) = (1+(A003961(n)^2))/2.
%F A337336 For all n>= 1, A010872(a(n)) = A040001(n).
%o A337336 (PARI)
%o A337336 A048673(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (factorback(f)+1)/2; };
%o A337336 A337336(n) = A048673(n^2);
%Y A337336 Cf. A000290, A003961, A007310, A040001, A048673, A337337, A337338, A337339.
%K A337336 nonn
%O A337336 1,2
%A A337336 _Antti Karttunen_, Aug 24 2020