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.

Showing 1-2 of 2 results.

A334828 Numbers that divide the multiplication of its digits raised to their own powers.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 16, 25, 36, 64, 96, 125, 128, 135, 162, 175, 216, 250, 256, 375, 378, 384, 432, 486, 567, 576, 625, 648, 672, 675, 729, 735, 756, 768, 784, 864, 875, 972, 1024, 1176, 1250, 1296, 1372, 1715, 1764, 1944, 2048, 2304, 2500, 2744, 2916, 3087, 3125, 3375, 3456, 3645, 3675, 4096
Offset: 1

Views

Author

Scott R. Shannon, May 13 2020

Keywords

Comments

As in A045503 we take 0^0 = 1.
Numbers m that divide A061510(m).

Examples

			5 is a term as 5^5 = 3125 which is divisible by 5.
16 is a term as 1^1*6^6 = 46656 which is divisible by 16.
375 is a term as 3^3*7^7*5^5 = 69486440625 which is divisible by 375.
1176 is a term as 1^1*1^1*7^7*6^6 = 38423222208 which is divisible by 1176.
		

Crossrefs

Programs

  • Mathematica
    pow[n_] := If[n == 0, 1, n^n]; Select[Range[2^12], Divisible[Times @@ (pow /@ IntegerDigits[#]), #] &] (* Amiram Eldar, May 13 2020 *)
  • PARI
    isok(m) = my(d=digits(m)); (prod(k=1, #d, d[k]^d[k]) % m) == 0; \\ Michel Marcus, May 14 2020

A108406 Numbers k such that concatenating k and the sum of the digits of k raised to their own power (A045503) produces a square.

Original entry on oeis.org

0, 211, 220, 235, 20403, 111416, 1011231, 3444142, 10003400, 22303600, 31151021, 53231032, 121542025, 126423126, 202032110, 243425212, 302434003, 311544033, 324231521, 334130241, 375607602, 406221650, 561620561, 662033363, 1053045074
Offset: 1

Views

Author

Jason Earls, Jul 04 2005

Keywords

Examples

			235 is a term because 2^2 + 3^3 + 5^5 = 3156 and 2353156 = 1534^2.
		

Crossrefs

Programs

  • PARI
    f(n)=if(n, n=digits(n); sum(i=1, #n, n[i]^n[i]), 1); \\ A045503
    isok(k) = issquare(fromdigits(concat(digits(k), digits(f(k))))); \\ Michel Marcus, Mar 05 2024

Extensions

More terms from Ryan Propper, Jul 07 2005
Showing 1-2 of 2 results.