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.

A088293 Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one.

Original entry on oeis.org

11, 167, 1427, 12227, 111227, 11117213, 11111117, 1111111411, 11111111917, 111111118319, 1111111111717, 11111111132923, 111111111114823, 1111111111113823, 11111111111111923, 111111111111112319, 1111111111111116223, 11111111111111121119, 111111111111111111523
Offset: 1

Views

Author

Amarnath Murthy, Sep 30 2003

Keywords

Examples

			a(1) = 11, 1 = 1.
a(2) = 167, 1+6 = 7
a(3) = 1427, 1+4+2 = 7.
a(4) = 12227, 1+2+2+2 = 7.
a(5) = 111227, 1+1+1+2+2 = 7.
a(6) = 11117213, 1+1+1+1+7+2 = 13.
a(7) = 11111117, 1+1+1+1+1+1+1 = 7.
a(8) = 1111111411, 1+1+1+1+1+1+1+4 = 11.
		

Crossrefs

Extensions

a(6)-a(8) from Randy L. Ekl, Jan 08 2017
Offset corrected by Omar E. Pol, Jan 09 2017
a(9)-a(19) from Giovanni Resta, Apr 24 2017