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 A061510 #25 Nov 26 2024 09:51:09 %S A061510 1,1,4,27,256,3125,46656,823543,16777216,387420489,1,1,4,27,256,3125, %T A061510 46656,823543,16777216,387420489,4,4,16,108,1024,12500,186624,3294172, %U A061510 67108864,1549681956,27,27,108,729,6912,84375,1259712,22235661,452984832,10460353203 %N A061510 Write n in decimal, omit 0's, raise each digit k to k-th power and multiply. %C A061510 The empty product is 1. If one accepts 0^0 = 1, then "omit 0's" is unnecessary. - _Michael S. Branicky_, Nov 26 2024 %H A061510 Michael S. Branicky, <a href="/A061510/b061510.txt">Table of n, a(n) for n = 0..10000</a> %H A061510 Wikipedia, <a href="https://en.wikipedia.org/wiki/Zero_to_the_power_of_zero">Zero to the power of zero</a> %e A061510 a(4) = 4^4 = 256. %e A061510 a(123) = 1^1 * 2^2 * 3^3 = 108. %e A061510 a(1024) = 1^1 * 2^2 * 4^4 = 1024. %p A061510 a:= n-> mul(i^i,i=convert(n, base, 10)): %p A061510 seq(a(n), n=0..39); # _Alois P. Heinz_, Nov 26 2024 %t A061510 A061510[n_] := If[n == 0, 1, Times @@ (#^#) & [DeleteCases[IntegerDigits[n], 0]]]; %t A061510 Array[A061510, 50, 0] (* _Paolo Xausa_, Nov 26 2024 *) %o A061510 (Python) %o A061510 from math import prod %o A061510 def a(n): return prod(d**d for d in map(int, str(n)) if d > 1) %o A061510 print([a(n) for n in range(40)]) # _Michael S. Branicky_, Nov 25 2024 %o A061510 (PARI) a(n) = my(d=digits(n)); vecprod(vector(#d, k, d[k]^d[k])); \\ _Michel Marcus_, Nov 25 2024 %Y A061510 Cf. A061509. %K A061510 base,look,nonn %O A061510 0,3 %A A061510 _Amarnath Murthy_, May 06 2001 %E A061510 Corrected and extended by _Matthew Conroy_, May 13 2001