The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A131417 Numbers n such that Sum_digits(n)=Sum_digits[n*Sum_digits(n)]. 2
 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; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS 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); MATHEMATICA sdQ[n_]:=Module[{c=Total[IntegerDigits[n]]}, c==Total[ IntegerDigits[ c n]]]; Select[Range[0, 350], sdQ] (* Harvey P. Dale, Nov 13 2011 *) PROG (PARI) isok(n) = my(sn = sumdigits(n)); sn == sumdigits(n*sn); \\ Michel Marcus, May 10 2019 CROSSREFS Cf. A007953, A131418. Sequence in context: A100595 A107433 A090570 * A268135 A058369 A110939 Adjacent sequences:  A131414 A131415 A131416 * A131418 A131419 A131420 KEYWORD easy,nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, Jul 09 2007 STATUS approved

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

Last modified September 24 11:26 EDT 2020. Contains 337318 sequences. (Running on oeis4.)