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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235507 Harshad numbers which when divided by sum of their digits, give a quotient which is a Harshad number. 6

%I #23 Sep 02 2017 10:54:30

%S 1,2,3,4,5,6,7,8,9,10,12,18,20,21,24,27,30,36,40,42,45,48,50,54,60,63,

%T 70,72,80,81,84,90,100,108,120,162,180,200,210,216,240,243,270,300,

%U 324,360,378,400,405,420,432,450,480,486,500,540,600,630,648,700,720

%N Harshad numbers which when divided by sum of their digits, give a quotient which is a Harshad number.

%C These numbers are also called MHN-2 or Multiple Harshad Numbers-2.

%H Ray Chandler, <a href="/A235507/b235507.txt">Table of n, a(n) for n = 1..10796</a> (all a(n) <= 10^6)

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Harshad_number">Harshad Number</a>

%e 486 is a MHN as it is divisible by the sum of its digits i.e. 18. The quotient obtained, 27, is also divisible by the sum of its digits, i.e. 9.

%t mhnQ[n_]:=Module[{s=Total[IntegerDigits[n]]},Divisible[n,s]&&Divisible[ n/s,Total[IntegerDigits[n/s]]]]; Select[Range[800],mhnQ] (* _Harvey P. Dale_, Sep 02 2017 *)

%Y Cf. A005349, A235697.

%K nonn,base

%O 1,2

%A _Mihir Mathur_, Jan 14 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)