The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110367 n divided by sum of digits of n if that is an integer, else n multiplied by the same. 1

%I #10 Feb 09 2017 10:34:28

%S 1,1,1,1,1,1,1,1,1,10,22,4,52,70,90,112,136,2,190,10,7,88,115,4,175,

%T 208,3,280,319,10,124,160,198,238,280,4,370,418,468,10,205,7,301,352,

%U 5,460,517,4,637,10,306,364,424,6,550,616,684,754,826,10,427,496,7,640,715

%N n divided by sum of digits of n if that is an integer, else n multiplied by the same.

%H Indranil Ghosh, <a href="/A110367/b110367.txt">Table of n, a(n) for n = 1..50000</a>

%e a(12) = 12/3 = 4. a(22) = 22*4 = 88.

%t sd[n_]:=Module[{s=Total[IntegerDigits[n]]},If[Divisible[n,s],n/s,n*s]]; Array[sd,100] (* _Harvey P. Dale_, Aug 14 2013 *)

%K base,easy,nonn,look

%O 1,10

%A _Amarnath Murthy_, Jul 24 2005

%E More terms from Anthony J. Paglione (ajp267(AT)psu.edu), Sep 13 2005

%E Corrected by _Harvey P. Dale_, Aug 14 2013

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

Last modified June 22 00:43 EDT 2024. Contains 373561 sequences. (Running on oeis4.)