Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131418
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131418 Number n such that Sum_digits(n)=Sum_digits[n+Sum_digits(n)], with n>=0. +0
3
0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 108, 117, 126, 135, 144, 153, 162, 171, 207, 216, 225, 234, 243, 252, 261, 279, 306, 315, 324, 333, 342, 351, 369, 378, 405, 414, 423, 432, 441, 459, 468, 477, 504, 513, 522, 531, 549, 558, 567, 576, 603, 612, 621, 639 (list; graph; listen)
OFFSET

0,2

EXAMPLE

n=315 --> 3+1+5=9 --> 315+9=324 --> 3+2+4=9.

n=873 --> 8+7+3=18 --> 873+18=891 --> 8+9+1=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. A131417.

Sequence in context: A085132 A111708 A044052 this_sequence A130692 A043453 A028439

Adjacent sequences: A131415 A131416 A131417 this_sequence A131419 A131420 A131421

KEYWORD

easy,nonn,base

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 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research