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 A209261 #19 Sep 08 2022 08:46:01
%S A209261 1,27,8387,1596559,67137477,1221074483,13065520903,96951759015,
%T A209261 550571544713,2552470327819,10137858491979,36314872538111,
%U A209261 130291290501709,605750213184675,4731091158953615,53132088082450327,669920208810550545
%N A209261 a(n) = n^13 + 13*n + 13^n.
%C A209261 This is to A220425 as 13 is to 2, to A220509 as 13 is to 3, to A220511 as 13 is to 5, to A220528 as 13 is to 7, and to A220653 as 13 is to 11. The subsequence of primes begins: 8387, 13065520903.
%H A209261 G. C. Greubel, <a href="/A209261/b209261.txt">Table of n, a(n) for n = 0..895</a>
%e A209261 a(2) = 2^13 + 13*2 + 13^2 = 8387.
%t A209261 Table[n^13 + 13*n + 13^n, {n,0,30}] (* _G. C. Greubel_, Jan 05 2018 *)
%o A209261 (Maxima) makelist(n^13 + 13*n + 13^n,n,0,20); /* _Martin Ettl_, Jan 15 2013 */
%o A209261 (PARI) for(n=0,30, print1(n^13 + 13*n + 13^n, ", ")) \\ _G. C. Greubel_, Jan 05 2018
%o A209261 (Magma) [n^13 + 13*n + 13^n: n in [0..30]]; // _G. C. Greubel_, Jan 05 2018
%Y A209261 Cf. A008455, A008593, A001020, A220425, A220509, A220511, A220528, A220653, A220787.
%K A209261 nonn,easy
%O A209261 0,2
%A A209261 _Jonathan Vos Post_, Jan 14 2013