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 A259308 #16 Sep 08 2022 08:46:13
%S A259308 2,82,257,2402,1297,20737,4097,50626,28562,104977,20737,614657,38417,
%T A259308 331777,331777,923522,104977,2313442,160001,3111697,1048577,1679617,
%U A259308 331777,12960001,923522,3111697,2560001,9834497,810001,26873857,1048577,15752962,5308417
%N A259308 a(n) = 1 + sigma(n)^4.
%H A259308 Robert Price, <a href="/A259308/b259308.txt">Table of n, a(n) for n = 1..10000</a>
%H A259308 OEIS Wiki, <a href="https://oeis.org/wiki/Cyclotomic Polynomials at x=n, n! and sigma(n)">Cyclotomic Polynomials at x=n, n! and sigma(n)</a>
%F A259308 a(n) = 1 + A000203(n)^4.
%F A259308 a(n) = A019326(A000203(n)). - _Michel Marcus_, Jun 24 2015
%p A259308 with(numtheory): A259308:=n->1+sigma(n)^4: seq(A259308(n), n=1..50); # _Wesley Ivan Hurt_, Jul 09 2015
%t A259308 Table[1 + DivisorSigma[1, n]^4, {n, 10000}]
%t A259308 Table[Cyclotomic[8, DivisorSigma[1, n]], {n, 10000}]
%o A259308 (Magma) [(1 + SumOfDivisors(n)^4): n in [1..50]]; // _Vincenzo Librandi_, Jun 24 2015
%Y A259308 Cf. A000203 (sum of divisors of n).
%Y A259308 Cf. A259309 (indices of primes in this sequence), A259310 (corresponding primes).
%K A259308 easy,nonn
%O A259308 1,1
%A A259308 _Robert Price_, Jun 24 2015