This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122873 Triangle T(n,k) = smallest number whose square has largest digit k in base n, 0<=k
 0, 0, 1, 0, 1, 4, 0, 1, 3, 7, 0, 1, 6, 4, 2, 0, 1, 7, 3, 2, 14, 0, 1, 3, 11, 2, 6, 12, 0, 1, 4, 5, 2, 13, 7, 11, 0, 1, 10, 91, 2, 7, 28, 4, 20, 0, 1, 11, 111, 2, 5, 4, 24, 9, 3, 0, 1, 12, 5, 2, 4, 26, 9, 24, 3, 19, 0, 1, 5, 6, 2, 8, 19, 32, 10, 3, 11, 40, 0, 1, 14, 4, 2, 24, 9, 35, 28, 3, 6, 12, 5 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS Repunits in base n are an upper bound, since 11...11^2 = 12...(k)...21 in any sufficiently large base. LINKS EXAMPLE Row 10: 0,1,11,111,2,5,4,24,9,3, has squares 0,1,121,12321,4,25,16,576,81,9, with digits 0,...,9 as the respective largest digits. CROSSREFS Cf. A055129, A000290, A054055. Sequence in context: A298712 A127538 A096008 * A221275 A176803 A115715 Adjacent sequences:  A122870 A122871 A122872 * A122874 A122875 A122876 KEYWORD base,nonn,tabl AUTHOR Franklin T. Adams-Watters, Oct 23 2006 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 October 14 09:25 EDT 2019. Contains 327995 sequences. (Running on oeis4.)