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.

A371337 Numbers k>0 such that k = (sum of digits of k^2) + (product of nonzero digits of k^2).

Original entry on oeis.org

127, 1467, 3052, 5860, 653230, 3483702, 43352128, 783820873, 8092385362, 622196951140, 1061882796441600145, 178949702436677222562
Offset: 1

Views

Author

René-Louis Clerc, Mar 19 2024

Keywords

Examples

			1467^2 = 2152089, (2+1+5+2+8+9) + (2*1*5*2*8*9) = 27 + 1440 = 1467.
		

Crossrefs

Programs

  • PARI
    SplusP(k,r) = my(d=select(x->(x>0),digits(k^r))); vecsum(d) + vecprod(d) == k;
            resuSplusP(p,r)=for(k=1,10^p,if(SplusP(k,r) ==1,print1(k,",")))

Extensions

a(9)-a(12) from Chai Wah Wu, Apr 20 2024