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.
%I A266315 #9 Sep 08 2022 08:46:15 %S A266315 0,171,324,378,468,684,1710,3240,3780,4680,6840,17100,28845,29241, %T A266315 32400,34884,37800,46800,46944,48924,68400,69174,84348,171000,242424, %U A266315 288450,292410,324000,348840,378000,467424,468000,469440,489240,493794,684000,691740 %N A266315 Numbers n such that 2*n and n^3 have the same digit sum. %H A266315 G. C. Greubel, <a href="/A266315/b266315.txt">Table of n, a(n) for n = 1..160</a> %e A266315 171 is in the sequence because 171^3 = 5000211 and 2*171 = 342 have the same digit sum: 9. %t A266315 Select[Range[0, 7 10^5], Total[IntegerDigits[2 #]] == Total[IntegerDigits[#^3]] &] %o A266315 (Magma) [n: n in [0..2*10^6] | &+Intseq(2*n) eq &+Intseq(n^3)]; %o A266315 (PARI) isok(n) = sumdigits(2*n)==sumdigits(n^3); \\ _Michel Marcus_, Jan 02 2016 %Y A266315 Cf. A000578, A005843, A070276, A260906. %K A266315 nonn,base %O A266315 1,2 %A A266315 _Vincenzo Librandi_, Jan 01 2016