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 A362953 #37 Jun 02 2023 10:20:58 %S A362953 0,34,352,540,1167,1942,2176,3312,4093,5454,8019,9380,12025,12130, %T A362953 13068,13158,15344,15991,16279,16675,21149,22699,22789,30988,32257, %U A362953 32365,35238,37883,37955,41866,45549,54523,57906,58530,62579,72588,83692,83782,89604,102952 %N A362953 Numbers N such that N + the sum of the cubes of its digits is again a third power. %H A362953 Karl-Heinz Hofmann, <a href="/A362953/b362953.txt">Table of n, a(n) for n = 0..10000</a> %H A362953 Karl-Heinz Hofmann, <a href="/A362953/a362953.png">Visualization of n = 0 to 11.</a> %e A362953 The sum of the cubes of the digits of N = 34 is 3^3 + 4^3 = 27 + 64 = 91; added to the number N itself yields 125 which is again a cube, 5^3. Therefore 34 is in this sequence. %o A362953 (PARI) select( {is(n,p=3)=ispower(vecsum([d^p|d<-digits(n)])+n,p)}, [0..10^5]) %o A362953 (Python) %o A362953 aupto = 103000 %o A362953 A362953 = [] %o A362953 A000578 = set(cu**3 for cu in range(0, int(aupto**(1/3)+3))) %o A362953 for n in range(0,aupto+1): %o A362953 if n + sum(int(digit)**3 for digit in str(n)) in A000578: A362953.append(n) %o A362953 print(A362953) # _Karl-Heinz Hofmann_, May 24 2023 %Y A362953 Cf. A000578 (the cubes), A055012 (sum of cubes of decimal digits of n). %Y A362953 Cf. A362954 (the same for 4th powers). %K A362953 nonn,base %O A362953 0,2 %A A362953 _Will Gosnell_ and _M. F. Hasler_, May 09 2023