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 A015996 #17 Jan 17 2017 12:32:21 %S A015996 1,2,2,3,2,7,2,4,3,7,2,12,2,7,7,5,2,12,2,12,7,7,2,17,3,7,4,12,2,32,2, %T A015996 6,7,7,7,21,2,7,7,17,2,32,2,12,12,7,2,22,3,12,7,12,2,17,7,17,7,7,2,57, %U A015996 2,7,12,7,7,32,2,12,7,32,2,30,2,7,12,12,7,32,2,22,5,7,2,57,7,7 %N A015996 (tau(n^4) + 3)/4, where tau = A000005. %C A015996 If n is prime, a(n) = 2 since a(p) = (tau(p^4)+3)/4 = (5+3)/4 = 2. - _Wesley Ivan Hurt_, Nov 16 2013 %H A015996 Antti Karttunen, <a href="/A015996/b015996.txt">Table of n, a(n) for n = 1..10000</a> %F A015996 a(n) = (A000005(n^4) + 3)/4. %p A015996 A015996 := proc(n) %p A015996 (numtheory[tau](n^4)+3)/4 ; %p A015996 end proc; # _R. J. Mathar_, May 09 2013 %t A015996 Table[(DivisorSigma[0, n^4] + 3)/4, {n, 100}] (* _Wesley Ivan Hurt_, Nov 16 2013 *) %o A015996 (PARI) %o A015996 A015996(n) = (numdiv(n^4)+3)/4; %o A015996 for(n=1, 10000, write("b015996.txt", n, " ", A015996(n))); %o A015996 \\ _Antti Karttunen_, Jan 17 2017 %Y A015996 Cf. A000005, A018892, A015995, A015999, A016001, A016002, A016003, A016005, A016006, A016007, A016008, A016009, A016012, A016020. %K A015996 nonn %O A015996 1,2 %A A015996 _Robert G. Wilson v_ %E A015996 Definition corrected by Vladeta Jovovic, Sep 03 2005