The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A122873 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A122873

Triangle T(n,k) = smallest number whose square has largest digit k in base n, 0<=k<n.
(history; published version)

#2 by Russ Cox at Fri Mar 30 17:35:16 EDT 2012

AUTHOR

_Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), _, Oct 23 2006

Discussion

Fri Mar 30

17:35

OEIS Server: https://oeis.org/edit/global/165

#1 by N. J. A. Sloane at Wed Dec 06 03:00:00 EST 2006

NAME

Triangle T(n,k) = smallest number whose square has largest digit k in base n, 0<=k<n.

DATA

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

OFFSET

1,6

COMMENTS

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.

KEYWORD

base,nonn,tabl

AUTHOR

Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 23 2006

STATUS

approved