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 A074762 #24 Aug 19 2014 13:25:44
%S A074762 633,634,635,636,637,638,639,877,878,879,880,881,882,883,884,1185,
%T A074762 5061,33459,438240,682290,17263489,188423892,991790057,7231603790,
%U A074762 75314706735,62651040995719,296757769625554,4295141978111813,14929328605861651,516659008545595106
%N A074762 Fifth root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).
%H A074762 Jon E. Schoenfield, <a href="/A074762/b074762.txt">Table of n, a(n) for n = 1..50</a>
%H A074762 Jon E. Schoenfield, <a href="/A074762/a074762_1.txt">Magma code</a>
%H A074762 Robert Tanniru, <a href="/A074762/a074762.txt">PARI Code</a>
%e A074762 Fifth root of 33459 = 8.033459...
%t A074762 f[n_] := Block[{l = Floor[ Log[10, n] + 1], rd = RealDigits[n^(1/5), 10, 24], id = IntegerDigits[n]}, rdd = Drop[ rd[[1]], rd[[2]]]; While[ rdd[[1]] == 0, rdd = Drop[ rdd, 1]]; Take[ rdd, l] == id]; Do[ If[ StringPosition[ ToString[ N[ n^(1/5), 24]], ToString[ n]] != {}, If[ f[n], Print[ n]]], {n, 2, 170000000}] (* _Robert G. Wilson v_, Jul 30 2004 *)
%o A074762 (PARI)
%o A074762 /* Uses PARI functions provided in link
%o A074762 * Note: does not predict 639 due to simplification error and
%o A074762 * 877-884 due to checking only first solutions to the Grafting Equation.
%o A074762 * Sample run uses a = [0,16], b=10, p=5, direct=True */
%o A074762 GetAllGIs(0,16,10,5,1) \\ _Robert Tanniru_, Nov 20 2013
%Y A074762 Cf. A074841, A232086, A232110.
%K A074762 nonn,base
%O A074762 1,1
%A A074762 _Paul Lusch_, Sep 06 2002
%E A074762 Edited and extended by _Robert G. Wilson v_, Jul 31 2004
%E A074762 a(22)-a(25) by _Robert Tanniru_, Nov 20 2013
%E A074762 More terms from _Jon E. Schoenfield_, Aug 17 2014