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.

Original entry on oeis.org

124499, 1244990, 12449900, 124499000, 594959999, 1244990000, 1349969999, 5949599990, 12449900000, 13499699990, 59495999900
Offset: 1

Views

Author

Jeppe Stig Nielsen, Aug 18 2015

Keywords

Comments

A comment by M. F. Hasler in A122484 shows that there are infinitely many terms not divisible by 10.

Crossrefs

A122484 is the main sequence.

Programs

  • PARI
    is(n)=sumdigits(n)>sumdigits(n^4) \\ Charles R Greathouse IV, Aug 18 2015
    
  • Python
    from itertools import count, islice
    def A261439_gen(startvalue=1): # generator of terms >= startvalue
        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)))
    A261439_list = list(islice(A261439_gen(),3)) # Chai Wah Wu, Oct 20 2023