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 A036093 #19 Sep 08 2022 08:44:52
%S A036093 1,32769,14381675,1088090731,31591319949,500702562701,5217746494519,
%T A036093 39931933598775,241075504183481,1205891132094649,5177248169415651,
%U A036093 19584269744002019,66592914588677125,206753988571902981
%N A036093 Centered cube numbers: (n+1)^15 + n^15.
%C A036093 Never prime nor semiprime, nor triprime, as a(n) = (2n+1) * (n^2 + n + 1) * (n^4 + 2n^3 + 4n^2 + 3n + 1) * (n^8 + 4n^7 + 30n^6 + 76n^5 + 99n^4 + 76n^3 + 35n^2 + 9n + 1). Has the nontrivial minimum 4 prime factors when n is in {1, 5, 105, ...}. - _Jonathan Vos Post_, Aug 27 2011
%D A036093 B. K. Teo and N. J. A. Sloane, Magic numbers in polygonal and polyhedral clusters, Inorgan. Chem. 24 (1985), 4545-4558.
%H A036093 Vincenzo Librandi, <a href="/A036093/b036093.txt">Table of n, a(n) for n = 0..10000</a>
%e A036093 1^15 + (1+1)^15 = 32769 = 3^2 * 11 * 331 which has the nontrivial minimum 4 prime factors (see A014613).
%t A036093 Total/@Partition[Range[0,20]^15,2,1] (* _Harvey P. Dale_, Apr 18 2013 *)
%o A036093 (Magma) [(n+1)^15+n^15: n in [0..20]]; // _Vincenzo Librandi_, Aug 28 2011
%o A036093 (PARI) a(n)=(n+1)^15+n^15 \\ _Charles R Greathouse IV_, Aug 30 2017
%Y A036093 Cf. A036091, A036092.
%K A036093 nonn,easy
%O A036093 0,2
%A A036093 _N. J. A. Sloane_