The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134962 Numbers n with property that for each single digit d of n, we can also see the decimal expansion of d^2 as a substring of n. Also n may not contain any 0 digits. 10
 1, 11, 111, 1111, 11111, 111111, 1111111, 3648169, 3649816, 3681649, 3698164, 8163649, 8164369, 8164936, 8169364, 9364816, 9368164, 9816364, 9816436, 11111111, 13648169, 13649816, 13681649, 13698164, 16364819, 16364981 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The number of terms less than 10^k: 1, 2, 3, 4, 5, 6, 19, 410, 8083, ... . - Robert G. Wilson v, Jan 06 2012 LINKS Robert G. Wilson v, Table of n, a(n) for n = 1..11523 (first 300 terms from David Applegate) EXAMPLE In 3648169, for 3 we can see 9, for 6 we can see 36, for 4 we can see 16, for 8 we can see 64, for 1 we can see 1 and for 9 we can see 81. MATHEMATICA fQ[n_] := (id = IntegerDigits@ n; Union[id][[1]] != 0 && Sort[ StringPosition[ ToString[n], ToString[#]] & /@ Evaluate[ id^2]][[1]] != {}); k = 0; lst = {}; While[k < 2*10^7, If[fQ@k, AppendTo[lst, k]; Print@ k]; k++] (* Robert G. Wilson v, Jan 06 2012 *) PROG For C++ program, see the Applegate link in A135463. (Python) sq = {d:str(int(d)**2) for d in "123456789"} def ok(n): return "0" not in (s:=str(n)) and all(sq[d] in s for d in set(s)) print([k for k in range(10**7) if ok(k)]) # Michael S. Branicky, May 05 2023 CROSSREFS Cf. A134439, A134692, A134698, A135463, A135464. Sequence in context: A247552 A138145 A165370 * A267257 A113589 A366394 Adjacent sequences: A134959 A134960 A134961 * A134963 A134964 A134965 KEYWORD nonn,base AUTHOR Zak Seidov and N. J. A. Sloane, Feb 03 2008 EXTENSIONS a(9) onwards computed by David Applegate, Feb 03 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 30 23:40 EST 2023. Contains 367464 sequences. (Running on oeis4.)