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.

A218000 Smallest palindrome which has additive persistence n.

Original entry on oeis.org

0, 11, 55, 595, 59999999999999999999995
Offset: 0

Views

Author

Arkadiusz Wesolowski, Oct 17 2012

Keywords

Comments

The next term is too large to include.

Examples

			0 has additive persistence 0.
11 -> 2 has additive persistence 1.
55 -> 10 -> 1 has additive persistence 2.
		

Crossrefs

Programs

  • Mathematica
    lst = {0, 11, 55}; Do[AppendTo[lst, 6*10^(((lst[[-1]] + 5)/3 - 2)/9) - 5], {2}]; lst