Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131417
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131417 Numbers n such that Sum_digits(n)=Sum_digits[n*Sum_digits(n)]. +0
3
0, 1, 9, 10, 18, 19, 27, 28, 36, 37, 45, 46, 55, 64, 73, 82, 90, 91, 99, 100, 109, 117, 118, 126, 127, 135, 136, 145, 154, 163, 172, 180, 181, 190, 198, 199, 208, 217, 225, 226, 234, 235, 244, 253, 262, 270, 271, 280, 288, 289, 297, 298, 307, 316, 325, 334, 343 (list; graph; listen)
OFFSET

1,3

EXAMPLE

n=271 --> 2+7+1=10 --> 271*10=2710 and 2+7+1+0=10.

n=468 --> 4+6+8=18 --> 468*18=8424 and 8+4+2+4=18.

MAPLE

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

CROSSREFS

Cf. A131418.

Sequence in context: A100595 A107433 A090570 this_sequence A058369 A110939 A015898

Adjacent sequences: A131414 A131415 A131416 this_sequence A131418 A131419 A131420

KEYWORD

easy,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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research