_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, May 12 2002
_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, May 12 2002
Edited and extended by _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Feb 10 2009
0, 1, 2, 11, 3, 111, 4, 22, 1111, 5, 11111, 6, 33, 222, 111111, 7, 1111111, 8, 44, 2222, 11111111, 9, 333, 111111111, 55, 22222, 1111111111, 11111111111, 66, 444, 3333, 222222, 111111111111, 1111111111111, 77, 2222222, 11111111111111, 555, 33333
0,2
1,3
If n has no divisors among 2,3,5 or 7 then the only term with digit sum n is the repunit RA002275(n) = 1111... n times.
Cf. A070841.
Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 10 2009
If n has no divisors among 2,3,5 or 7 then the only term with a digit sum of digt n is the repunit R(n) = 1111... n times.
base,nonn,new
Smallest number with identical digits with a sum of digits >= previous terms.
1, 2, 11, 3, 111, 4, 22, 1111, 5, 11111, 6, 33, 222, 111111, 7, 1111111, 8, 44, 2222, 11111111, 9, 333, 111111111, 55, 22222, 1111111111, 11111111111, 66, 444, 3333, 222222, 111111111111
0,2
If n has no divisors among 2,3,5 or 7 then the only term with a sum of digt n is the repunit R(n) = 1111... n times.
base,nonn
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 12 2002
approved