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!)
A076713 Harshad (Niven) triangular numbers: triangular numbers which are divisible by the sum of their digits. 3

%I #18 Aug 18 2014 12:08:00

%S 1,3,6,10,21,36,45,120,153,171,190,210,300,351,378,465,630,666,780,

%T 820,990,1035,1128,1275,1431,1540,1596,1770,2016,2080,2556,2628,2850,

%U 2926,3160,3240,3321,3486,3570,4005,4465,4560,4950,5050,5460,5565,5778,5886

%N Harshad (Niven) triangular numbers: triangular numbers which are divisible by the sum of their digits.

%C Intersection of A000217 and A005349. - _K. D. Bajpai_, Aug 13 2014

%H K. D. Bajpai, <a href="/A076713/b076713.txt">Table of n, a(n) for n = 1..15436</a>

%H Shyam Sunder Gupta <a href="http://www.shyamsundergupta.com/triangle.htm">Fascinating Triangular Numbers</a>

%e a(5)=21: 21 is a triangular number and also a harshad number as 21 is divisible by 2+1=3. So 21 is harshad triangular number.

%t TriangularNumberQ[k_] := If[IntegerQ[1/2 (Sqrt[1 + 8 k] - 1)], True, False]; Harshad[k_] := Select[Range[k], IntegerQ[ #/(Plus @@ IntegerDigits[ # ])] &]; TriangularHarshad[k_] := Select[Harshad[k], TriangularNumberQ[#] &]; TriangularHarshad[5886] (* _Ant King_, Dec 13 2010 *)

%t A076713 = {}; Do[k = n*(n + 1)*1/2; If[IntegerQ[k/(Plus @@ IntegerDigits[k])], AppendTo[A076713, k]], {n,1000}]; A076713 (* _K. D. Bajpai_, Aug 13 2014 *)

%Y Cf. A000217, A005349.

%K nonn,base

%O 1,2

%A _Shyam Sunder Gupta_, Oct 26 2002

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 May 11 02:25 EDT 2024. Contains 372388 sequences. (Running on oeis4.)