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 A331308 #12 Jan 21 2020 18:22:27 %S A331308 1,2,2,2,2,4,2,4,3,4,2,6,2,4,4,2,2,6,2,6,4,4,2,8,3,4,4,6,2,8,2,4,4,4, %T A331308 4,4,2,4,4,8,2,8,2,6,6,4,2,6,3,6,4,6,2,8,4,8,4,4,2,12,2,4,6,4,4,8,2,6, %U A331308 4,8,2,8,2,4,6,6,4,8,2,10,3,4,2,12,4,4,4,8,2,12,4,6,4,4,4,8,2,6,6,6,2,8,2,8,8 %N A331308 a(n) = min(d(n), d(A225546(n))), where d gives the number of divisors of n, A000005. %C A331308 This is not equal to A000005(A331288(n)). The first difference is at n=100, where a(100) = 6, while A000005(A331288(100)) = 9. Note that A225546(100) = 243 and d(243) = 6 < d(100) = 9. %H A331308 Antti Karttunen, <a href="/A331308/b331308.txt">Table of n, a(n) for n = 1..65537</a> %F A331308 a(n) = min(A000005(n), A331309(n)). %Y A331308 Cf. A000005, A225546, A331288, A331309, A331592. %K A331308 nonn %O A331308 1,2 %A A331308 _Antti Karttunen_, Jan 21 2020