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 A301315 #11 Mar 20 2018 04:10:15
%S A301315 1,3,5,27,11,15,17,243,125,33,31,135,41,51,55,7625597484987,59,375,67,
%T A301315 297,85,93,83,1215,1331,123,3125,459,109,165,127,177147,155,177,187,
%U A301315 3375,157,201,205,2673,179,255,191,837,1375,249,211,38127987424935,4913,3993
%N A301315 Multiplicative with a(p^e) = prime(p) ^ a(e) (where prime(k) denotes the k-th prime number).
%C A301315 This sequence is a recursive version of A064988.
%C A301315 This sequence is injective (all terms are distinct).
%H A301315 Rémy Sigrist, <a href="/A301315/b301315.txt">Table of n, a(n) for n = 1..10000</a>
%F A301315 A225395(a(n)) = n.
%F A301315 A279690(a(n)) = A279690(n).
%t A301315 Fold[Function[{a, n}, Append[a, Times @@ Map[Prime[#1]^a[[#2]] & @@ # &, FactorInteger@ n]]], {1}, Range[2, 50]] (* _Michael De Vlieger_, Mar 19 2018 *)
%o A301315 (PARI) a(n) = my (f=factor(n)); prod (i=1, #f~, prime(f[i,1])^a(f[i,2]))
%Y A301315 Cf. A064988, A225395, A279690.
%K A301315 nonn,mult
%O A301315 1,2
%A A301315 _Rémy Sigrist_, Mar 18 2018