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.

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

Original entry on oeis.org

1, 2, 6, 30, 260, 3130, 46662, 823550, 16777224, 387420498, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 20, 22, 26, 31, 40, 57, 90, 155, 284, 541, 30, 32, 40, 60, 115, 278, 765, 2224, 6599, 19722, 40, 42, 58, 124, 300, 1069, 4142, 16431, 65584, 262193, 50
Offset: 0

Views

Author

Mia Boudreau, Jul 16 2025

Keywords

Comments

0^0 is an indeterminate form, but for the purpose of a(0) it is taken to be 1. - Robert Israel, Jul 22 2025

Examples

			a(563) = 1292 because 3^6 + 563 = 1292.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local L; L:= convert(n,base,10); n + min(L)^max(L) end proc:
    map(f, [$0..100]); # Robert Israel, Jul 22 2025
  • Mathematica
    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 *)
  • Python
    def a(n): return int(min(s:=str(n)))**int(max(s)) + n
    print([a(n) for n in range(51)]) # Michael S. Branicky, Jul 21 2025

Formula

a(n) = A054054(n)^A054055(n) + n.