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 A124628 #4 Mar 30 2012 18:49:08
%S A124628 1903,2257,2589,2691,2842,2866,3024,3159,3166,3195,3598,3658,3793,
%T A124628 3908,4335,4874,5032,5224,5503,5596,5703,5812,6009,6023,6259,6289,
%U A124628 6437,6486,6645,7446,7497,7592,7821,7846,7899,8056,8066,8166,8168,8662,8677,8873
%N A124628 Numbers n such that n^3 is zeroless pandigital.
%e A124628 1903^3 = 6891541327 (contains all the digits 1 through 9 and doesn't contain 0).
%t A124628 Select[Range[10000], Union[IntegerDigits[ #^3]] == {1, 2, 3, 4, 5, 6, 7, 8, 9} &]
%Y A124628 Cf. A119735 Numbers n such that every digit occurs at least once in n^3.
%K A124628 base,nonn
%O A124628 1,1
%A A124628 _Tanya Khovanova_, Dec 21 2006