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 A084066 #12 Oct 31 2013 12:17:23
%S A084066 1,11,11,11,11,11,11,11,11,11,11,1,11,11,11,11,11,11,11,11,11,11,7,11,
%T A084066 11,11,11,11,11,11,11,11,11,4,11,11,11,11,11,11,11,11,11,11,9,11,11,
%U A084066 11,11,11,11,11,11,11,11,5,11,11,11,11,11,11,11,11,11,11,5,11,11,11,11,11
%N A084066 Least integer coefficients of A(x), where 1<=a(n)<=11, such that A(x)^(1/11) consists entirely of integer coefficients.
%C A084066 More generally, the sequence: "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m>0. Are these sequences ever periodic?
%H A084066 Robert G. Wilson v, <a href="/A084066/b084066.txt">Table of n, a(n) for n = 0..3000</a>.
%F A084066 a(k)=0 (mod 11) when k not= 0 (mod 11); a(0)=1, a(11)=1, a(22)=7, a(33)=4, a(44)=9, a(55)=5, a(66)=5, ...
%t A084066 a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/11), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 71}] (* _Robert G. Wilson v_ *)
%Y A084066 Cf. A083952, A083953, A083954, A083955, A083956, A083947, A083948, A083949, A083950, A084067.
%K A084066 nonn
%O A084066 0,2
%A A084066 _Paul D. Hanna_, May 10 2003
%E A084066 More terms from _Robert G. Wilson v_, Jul 26 2005