login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131382 Minimal number m such that Sum_digits(n*m)=n. 5
1, 1, 1, 1, 1, 1, 1, 1, 1, 19, 19, 4, 19, 19, 13, 28, 28, 11, 46, 199, 19, 109, 73, 37, 199, 73, 37, 271, 172, 1333, 289, 559, 1303, 847, 1657, 833, 1027, 1576, 1282, 17497, 4339, 2119, 2323, 10909, 11111, 12826, 14617, 14581, 16102, 199999, 17449, 38269 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

LINKS

T. D. Noe, Table of n, a(n) for n=1..90

EXAMPLE

n=23 --> a=73 because 23*73 = 1679 and 1+6+7+9=23.

n=34 --> a=847 because 34*847 = 28798 and 2+8+7+9+8=34.

MAPLE

P:=proc(n) local i, j, k, w; for i from 1 by 1 to n do for j from 1 to n do w:=0; k:=i*j; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if i=w then print(j); break; fi; od; od; end: P(1000000);

CROSSREFS

Cf. A002998

Sequence in context: A004460 A082126 A176411 * A057430 A010858 A168525

Adjacent sequences:  A131379 A131380 A131381 * A131383 A131384 A131385

KEYWORD

base,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Jul 09 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:46 EST 2012. Contains 205835 sequences.