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 A066023 #19 Aug 28 2014 11:23:10
%S A066023 3,8,27,64,125,216,343,512,729,1000,1331,1728,2197,2744,3375,4096,
%T A066023 4913,5832,6859,8000,9261,10648,12167,13824,15625,17576,19683,21952,
%U A066023 24389,27000,29791,32768,35937,39304,42875,46656,50653,54872,59319,64000
%N A066023 (a(n)^7+1)/(n^7+1) is the smallest integer > 1.
%H A066023 Harry J. Smith, <a href="/A066023/b066023.txt">Table of n, a(n) for n=1..200</a>
%F A066023 Conjecture: a(n) = A000578(n), n>1. - _R. J. Mathar_, Aug 28 2014
%F A066023 Empirical g.f.: x*(2*x^4-8*x^3+13*x^2-4*x+3) / (x-1)^4. - _Colin Barker_, Aug 28 2014
%t A066023 Do[k = 1; While[m = (k^7 + 1)/(n^7 + 1); m < 2 || !IntegerQ[m], k++ ]; Print[k], {n, 1, 40} ]
%o A066023 (PARI) { for (n=1, 200, f=n^7 + 1; a=n + 1; while (frac((a^7 + 1)/f) !=0, a++); write("b066023.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 07 2009
%Y A066023 Cf. A065964.
%K A066023 easy,nonn
%O A066023 1,1
%A A066023 _Robert G. Wilson v_, Dec 11 2001