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.

A236750 Positive integers k such that k^3 divided by the digital sum of k is a square.

This page as a plain text file.
%I A236750 #28 Sep 08 2022 08:46:06
%S A236750 1,2,3,4,5,6,7,8,9,12,24,36,48,81,100,144,150,192,196,200,225,242,288,
%T A236750 300,320,324,375,400,441,484,500,512,600,640,648,700,704,735,800,832,
%U A236750 882,900,960,1014,1088,1200,1250,1452,1458,1521,1815,2023,2025,2028
%N A236750 Positive integers k such that k^3 divided by the digital sum of k is a square.
%C A236750 The sequence is infinite since if m = 10^(2*j) then m^3 / digitsum(m) = m^(6*k). - _Marius A. Burtea_, Dec 21 2018
%H A236750 Colin Barker, <a href="/A236750/b236750.txt">Table of n, a(n) for n = 1..1000</a>
%e A236750 192 is in the sequence because the digital sum of 192 is 12, and 192^3/12 = 589824 = 768^2.
%o A236750 (PARI)
%o A236750 s=[]; for(n=1, 5000, d=sumdigits(n); if(n^3%d==0 && issquare(n^3\d), s=concat(s, n))); s
%o A236750 (Magma) [n: n in [1..1500] | IsIntegral((n^3)/(&+Intseq(n))) and IsSquare((n^3)/(&+Intseq(n)))]; // _Marius A. Burtea_, Dec 21 2018
%Y A236750 Cf. A001102, A007953, A236748, A236749, A236751.
%K A236750 nonn,base
%O A236750 1,2
%A A236750 _Colin Barker_, Jan 30 2014