login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175690 a(n) is the least number such that k = n*a(n) has sum of digits n and ends with the digit string n, or 0 if no such number exists. 0

%I #5 Feb 02 2021 22:48:40

%S 1,1,1,1,1,1,1,1,1,91,0,76,901,451,61,226,901,51,901,496,901,451,3601,

%T 826,397,1801,701,676,2701,3331,18901,12151,0,5851,8281,2776,2701,

%U 12601,5101,49996,72901,70951,69301,22726,22221,102151,101701,62476,61201

%N a(n) is the least number such that k = n*a(n) has sum of digits n and ends with the digit string n, or 0 if no such number exists.

%e a(13) = 901 because 13 * 901 = 11713, and 1+1+7+1+3 = 13 and 11713 ends with the string "13".

%K base,nonn

%O 1,10

%A _Claudio Meller_, Aug 09 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)