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.

A239477 Smallest number with additive and multiplicative persistence equal to n.

Original entry on oeis.org

0, 10, 28, 289, 2488888888888888999999999
Offset: 0

Views

Author

Giovanni Resta, Mar 20 2014

Keywords

Comments

The corresponding smallest primes are 2, 11, 29, 487 and 2488888888888898999989999.

Examples

			a(3) = 289 because 289 is the smallest number with additive persistence 3, 289 -> 19 -> 10 -> 1 and multiplicative persistence 3, 289 -> 144 -> 16  -> 6.
		

Crossrefs