## S000926

Least number of repdigit numbers that sum to n.

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2

0

This sequence starts the same as A088601, but it is different starting at n = 101.

T. D. Noe, Plot of 5001 terms

T. D. Noe, Table of 5001 terms

Eric W. Weisstein, MathWorld: Repdigit

(Mma) maxLen = 4; repNums = Union[Flatten[Table[FromDigits[Table[a, {len}]], {a, 0, 9}, {len, maxLen}]]]; t = Table[Infinity, {10^4}]; Do[ind = i + j + k + l; If[i >= j >= k >= l && ind < 10^4, t[[ind + 1]] = Min[t[[ind + 1]], Sign[i] + Sign[j] + Sign[k] + Sign[l]]], {i, repNums}, {j, repNums}, {k, repNums}, {l, repNums}]; Take[t, Position[t, Infinity, 1, 1][[1, 1]] - 1]

Cf. A088601

nonn,base

T. D. Noe, Jul 26 2016

© Tony D Noe 2014-2016