login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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);
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
Sequence in context: A100595 A107433 A090570 * A268135 A058369 A110939
KEYWORD
easy,nonn,base
AUTHOR
STATUS
approved