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 A331299 #6 Jan 17 2020 17:40:49 %S A331299 1,2,3,3,5,6,7,5,6,10,11,12,13,14,15,7,17,15,19,20,21,22,23,24,12,26, %T A331299 10,28,29,30,31,11,33,34,35,35,37,38,39,40,41,42,43,44,45,46,47,48,24, %U A331299 45,51,52,53,21,55,56,57,58,59,60,61,62,63,13,65,66,67,68,69,70,71,72,73,74,30,76,72,78,79,80,14,82 %N A331299 a(n) = min(n, A241909(n)). %H A331299 Antti Karttunen, <a href="/A331299/b331299.txt">Table of n, a(n) for n = 1..65537</a> %H A331299 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A331299 a(n) = min(n, A241909(n)). %o A331299 (PARI) %o A331299 A241909(n) = if(1==n||isprime(n),2^primepi(n),my(f=factor(n),h=1,i,m=1,p=1,k=1); while(k<=#f~, p = nextprime(1+p); i = primepi(f[k,1]); m *= p^(i-h); h = i; if(f[k,2]>1, f[k,2]--, k++)); (p*m)); %o A331299 A331299(n) = min(n, A241909(n)); %Y A331299 Cf. A241909. %Y A331299 Cf. also A331170, A331280. %K A331299 nonn %O A331299 1,2 %A A331299 _Antti Karttunen_, Jan 17 2020