|
|
A053014
|
|
a(n) is the smallest number which has n consecutive divisors k, k+1, ..., k+n-1 such that the quotients all begin with the same digit.
|
|
0
|
|
|
1, 30, 60, 840, 10080, 110880, 1441440, 15135120, 21162960, 21162960, 232792560, 26771144400, 26771144400, 2730656728800, 30278164316400, 33977306563200, 38000934972000, 3610088822340000, 37400520199442400, 390033996365613600, 438120379479182400, 4505020423775071200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The smallest values of k corresponding to the first 22 terms are 1, 2, 4, 5, 6, 6, 8, 8, 12, 12, 12, 14, 14, 14, 16, 18, 20, 19, 19, 20, 22, 24. Since m > 0 and 2*m never share the first digit, k is always greater than or equal to n. - Giovanni Resta, May 14 2020
|
|
LINKS
|
Denis Borris, Close Divisors, Ken Duisenberg's Puzzle of the Week, Feb 20 2000.
|
|
EXAMPLE
|
a(4)=840 since 840/5=168, 840/6=140, 840/7=120 and 840/8=105 all start with 1.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|