Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131382
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131382 Minimal number m such that Sum_digits(n*m)=n. +0
4
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; listen)
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: A023461 A004460 A082126 this_sequence A057430 A010858 A040343

Adjacent sequences: A131379 A131380 A131381 this_sequence A131383 A131384 A131385

KEYWORD

base,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jul 09 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research