The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038690 a(n)^2 is smallest square containing the string 'n'. 3
 0, 1, 5, 6, 2, 5, 4, 24, 9, 3, 10, 34, 11, 37, 12, 34, 4, 42, 43, 14, 45, 11, 15, 48, 18, 5, 51, 52, 17, 23, 48, 56, 18, 58, 59, 66, 6, 61, 62, 63, 20, 21, 65, 66, 12, 116, 68, 69, 22, 7, 50, 72, 23, 73, 74, 166, 16, 24, 126, 77, 40, 19, 25, 128, 8, 81, 108, 26, 41, 13, 52, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS "Containment" implies here that the digits of n are consecutive digits in the square; see A091873 for a relaxed alternative. [R. J. Mathar, Dec 09 2008] LINKS Michael De Vlieger, Table of n, a(n) for n = 0..10000 MATHEMATICA Table[ i=0; While[ StringPosition[ ToString[ i^2 ], ToString[ n ] ]=={}, i++ ]; i, {n, 0, 80} ] CROSSREFS Cf. A018851, A029944, A068165, A091873. Sequence in context: A021068 A286300 A091873 * A154801 A253094 A217015 Adjacent sequences:  A038687 A038688 A038689 * A038691 A038692 A038693 KEYWORD base,nonn AUTHOR STATUS approved

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

Last modified January 19 05:55 EST 2021. Contains 340266 sequences. (Running on oeis4.)