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.

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

Original entry on oeis.org

1, 2, 6, 30, 260, 3130, 46662, 823550, 16777224, 387420498, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 21, 23, 26, 32, 40, 50, 62, 76, 92, 110, 31, 34, 41, 60, 98, 160, 252, 380, 550, 768, 41, 45, 58, 107, 300, 670, 1342, 2448, 4144, 6610, 51, 56, 77, 178, 679, 3180
Offset: 0

Views

Author

Jason Earls, Aug 18 2004

Keywords

Examples

			a(2345) = 2370 because 5^2 + 2345 = 2370.
		

Crossrefs

Programs

  • Python
    def a(n): return int(max(s:=str(n)))**int(min(s)) + n
    print([a(n) for n in range(56)]) # Michael S. Branicky, Jul 21 2025

Formula

a(n) = A054055(n)^A054054(n) + n. - Mia Boudreau, Jul 17 2025

Extensions

a(0) corrected and 2 terms merged by Mia Boudreau, Jul 16 2025