A066008 -id:A066008 - cp's OEIS frontend

A034727 a(n) = that n-digit number m which gives minimal integral value of m/(sum of digits of m); in case of a tie pick the smallest.

1, 18, 198, 1098, 10989, 109888, 1078999, 10998988, 109989999, 1078999989, 10999999989, 108999999989, 1098999999999, 10899899999998, 104999999999999, 1018899999999999, 10199998999999998, 100999999999999988

Offset: 1

David W. Wilson

S. W. Golomb, Sums and products of digits, IEEE Information Theory Society Newsletter, 51 (No. 3, Sept. 2001), p. 15.

Cf. A034726, A034728, A034686, A066007, A066008.

A066007 a(n) is that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest.

Original entry on oeis.org

1, 19, 199, 1099, 10999, 109999, 1099999, 10999999, 109999999, 1099999999, 10999999999, 109999999999, 1099999999999, 10999999999999, 100999999999999, 1009999999999999, 10099999999999999, 100999999999999999, 1009999999999999999, 10099999999999999999

Offset: 1

N. J. A. Sloane, Dec 11 2001

S. W. Golomb, Sums and products of digits, IEEE Information Theory Society Newsletter, 51 (No. 3, Sept. 2001), p. 15.
S. W. Golomb, Sums and Products of Digits Solutions, IEEE Information Theory Society Newsletter, Vol. 67, No. 1, March 2017, p. 22. Reprint.

Cf. A066008, A034726, A034727.

def k(r): return (10**r - 1)//9 + r + 2
def a(n):
  r = 0
  while k(r+1) <= n: r += 1
  return int('1' + '0'*r + '9'*(n-r-1))
print([a(n) for n in range(1, 21)]) # Michael S. Branicky, Jan 19 2021

1 followed by 0's followed by 9's; the first time r 0's appear is at n = (10^r-1)/9+r+2.

cp's OEIS Frontend

A034727 a(n) = that n-digit number m which gives minimal integral value of m/(sum of digits of m); in case of a tie pick the smallest.

Views

Author

Keywords

Links

Crossrefs

A066007 a(n) is that n-digit number m which minimizes m/(sum of digits of m); in case of a tie pick the smallest.

Views

Author

Keywords

Links

Crossrefs

Programs

Python

Formula