cp's OEIS Frontend

A386253 a(n) = (smallest digit of n)^(largest digit of n) + n.

%I A386253 #19 Jul 27 2025 19:49:32
%S A386253 1,2,6,30,260,3130,46662,823550,16777224,387420498,10,12,13,14,15,16,
%T A386253 17,18,19,20,20,22,26,31,40,57,90,155,284,541,30,32,40,60,115,278,765,
%U A386253 2224,6599,19722,40,42,58,124,300,1069,4142,16431,65584,262193,50
%N A386253 a(n) = (smallest digit of n)^(largest digit of n) + n.
%C A386253 0^0 is an indeterminate form, but for the purpose of a(0) it is taken to be 1. - _Robert Israel_, Jul 22 2025
%H A386253 Mia Boudreau, <a href="/A386253/b386253.txt">Table of n, a(n) for n = 0..10000</a>
%F A386253 a(n) = A054054(n)^A054055(n) + n.
%e A386253 a(563) = 1292 because 3^6 + 563 = 1292.
%p A386253 f:= proc(n) local L; L:= convert(n,base,10); n + min(L)^max(L) end proc:
%p A386253 map(f, [$0..100]); # _Robert Israel_, Jul 22 2025
%t A386253 Unprotect[Power]; 0^0:=1; Protect[Power]; a[n_]:= (Min[IntegerDigits[n]])^(Max[IntegerDigits[n]]) + n; Array[a,51,0] (* _Stefano Spezia_, Jul 17 2025 *)
%o A386253 (Python)
%o A386253 def a(n): return int(min(s:=str(n)))**int(max(s)) + n
%o A386253 print([a(n) for n in range(51)]) # _Michael S. Branicky_, Jul 21 2025
%Y A386253 Cf. A054054, A054055, A097385.
%K A386253 nonn,base,easy
%O A386253 0,2
%A A386253 _Mia Boudreau_, Jul 16 2025