login
A340270
a(n) = (n')^A054054(n), where n' is the number resulting from removing the rightmost occurrence of the smallest digit of n, A054054(n).
2
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 4, 9, 16, 25, 36, 49, 64, 81, 1, 3, 9, 27, 64, 125, 216, 343, 512, 729, 1, 4, 16, 64, 256, 625, 1296, 2401, 4096, 6561, 1, 5, 25, 125, 625, 3125, 7776, 16807, 32768, 59049, 1
OFFSET
1,12
COMMENTS
Suggested by Eric Angelini's posting to Math-Fun mailing list, Dec. 29, 2020.
EXAMPLE
a(201) = 21^0 = 1, a(21) = 2^1 = 2, a(232) = 23^2 = 529.
MAPLE
leastdigit:=proc(n)
min(convert(n, base, 10));
end:
locationdigit:=proc(n, d)
local L, i;
L:=convert(n, base, 10);
for i from 1 to nops(L) do
if d = L[i] then return (nops(L)+1-i); fi;
od:
end:
cutout:=proc(X, i) [seq(X[j], j=1..i-1), seq(X[j], j=i+1..nops(X))]; end:
ToNum:=proc(X)
add(X[i]*10^(nops(X)-i), i=1..nops(X));
end:
removeleastdigit:=proc(n)
local i, X;
i:=locationdigit(n, leastdigit(n));
X:=ListTools:-Reverse(convert(n, base, 10));
ToNum(cutout(X, i));
end proc:
a:=proc(n)
removeleastdigit(n)^leastdigit(n);
end:
PROG
(Python)
def A340270(n): return A340184(n)**int(min(str(n)))
print([A340270(n) for n in range(1, 61)]) # Michael S. Branicky, Jan 03 2021
(PARI) apply( {A340270(n, m=vecmin(n=digits(n)))=#n>1&& forstep( i=#n, 1, -1, n[i]==m && return(fromdigits(n[^i])^m))}, [1..99]) \\ M. F. Hasler, Jan 03 2021
CROSSREFS
Sequence in context: A247796 A355370 A326344 * A115026 A360075 A101337
KEYWORD
base,easy,nonn
AUTHOR
W. Edwin Clark, Jan 02 2021
EXTENSIONS
Changed definition as suggested by M. F. Hasler
STATUS
approved