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.

A309017 Numbers that divide the sum of the digits of their cubes.

This page as a plain text file.
%I A309017 #26 Aug 28 2019 12:18:11
%S A309017 1,2,3,8,9,17,18,26,27
%N A309017 Numbers that divide the sum of the digits of their cubes.
%C A309017 There are no further terms since the cubes between 28 and 50 that have the highest sums of digits are 31, 46 and 49. The sum of digits of the cubes of 31, 46 and 49 are 28. 28 is not divisible by 31, 46 or 49. So it is impossible that any number greater than 50 can divide the sum of digits of its cube.
%C A309017 0 is not in the term because 0 divided by 0 is undefined.
%e A309017 8 is in the sequence because 8^3 = 512 and 5 + 1 + 2 = 8, and 8/8 = 1.
%t A309017 Select[Range[1000], Divisible[Plus@@IntegerDigits[#^3], #] &] (* _Alonso del Arte_, Jul 07 2019 *)
%o A309017 (PARI) isok(n) = !(sumdigits(n^3) % n); \\ _Michel Marcus_, Jul 07 2019
%Y A309017 Cf. A000578 (n^3), A004164 (sum of digits of n^3).
%K A309017 nonn,base,full,fini
%O A309017 1,2
%A A309017 _Kritsada Moomuang_, Jul 06 2019