cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A243008 Triangular numbers divisible by the square of the sum of their digits.

This page as a plain text file.
%I A243008 #35 Aug 26 2014 01:46:42
%S A243008 1,10,3240,3321,13041,13203,15400,65341,80200,90100,161028,210276,
%T A243008 260281,265356,266085,300700,346528,500500,937765,947376,1043290,
%U A243008 1228528,1313010,1628110,2049300,2390391,2421100,3357936,3746953,4020030,5250420,6641190,6857956,6939675
%N A243008 Triangular numbers divisible by the square of the sum of their digits.
%C A243008 Intersection of A000217 and A072081.
%H A243008 K. D. Bajpai, <a href="/A243008/b243008.txt">Table of n, a(n) for n = 1..12445</a>
%e A243008 a(3) = 3240 = 80 * (80 + 1)/2 is a triangular number. Since 3240 is divisible by (3 + 2 + 4 + 0)^2 = 81, it appears in the sequence.
%e A243008 a(3) = 3321 = 81 * (81 + 1)/2 is a triangular number. Since 3321 is divisible by (3 + 3 + 2 + 1)^2 = 81, it appears in the sequence.
%t A243008 Select[Table[n*(n + 1)/2, {n, 10000}], Divisible[#, Plus @@ IntegerDigits[#]^2] &]
%o A243008 (PARI)
%o A243008 for(n=1,10^4,s=n*(n+1)/2;if(s%(sumdigits(s)^2)==0,print1(s,", "))) \\ _Derek Orr_, Aug 23 2014
%Y A243008 Cf. A000217, A072081, A076713, A118693.
%K A243008 nonn,base
%O A243008 1,2
%A A243008 _K. D. Bajpai_, Aug 20 2014