|
Search: id:A122873
|
|
|
| A122873 |
|
Triangle T(n,k) = smallest number whose square has largest digit k in base n, 0<=k<n. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
Repunits in base n are an upper bound, since 11...11^2 = 12...(k)...21 in any sufficiently large base.
|
|
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: A155998 A127538 A096008 this_sequence A115715 A115636 A124321
Adjacent sequences: A122870 A122871 A122872 this_sequence A122874 A122875 A122876
|
|
KEYWORD
|
base,nonn,tabl
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 23 2006
|
|
|
Search completed in 0.002 seconds
|
