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.

A261439 Sum of the digits of n exceeds the sum of the digits of n^4.

This page as a plain text file.
%I A261439 #17 Oct 20 2023 12:33:09
%S A261439 124499,1244990,12449900,124499000,594959999,1244990000,1349969999,
%T A261439 5949599990,12449900000,13499699990,59495999900
%N A261439 Sum of the digits of n exceeds the sum of the digits of n^4.
%C A261439 A comment by _M. F. Hasler_ in A122484 shows that there are infinitely many terms not divisible by 10.
%o A261439 (PARI) is(n)=sumdigits(n)>sumdigits(n^4) \\ _Charles R Greathouse IV_, Aug 18 2015
%o A261439 (Python)
%o A261439 from itertools import count, islice
%o A261439 def A261439_gen(startvalue=1): # generator of terms >= startvalue
%o A261439     return filter(lambda n: sum(int(d) for d in str(n)) > sum(int(d) for d in str(n**4)), count(max(startvalue,1)))
%o A261439 A261439_list = list(islice(A261439_gen(),3)) # _Chai Wah Wu_, Oct 20 2023
%Y A261439 A122484 is the main sequence.
%Y A261439 Cf. A064209, A064399, A064210, A007953.
%K A261439 nonn,base,more
%O A261439 1,1
%A A261439 _Jeppe Stig Nielsen_, Aug 18 2015