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.

Table of values

n a(n)
1 11
2 167
3 1427
4 12227
5 111227
6 11117213
7 11111117
8 1111111411
9 11111111917
10 111111118319
11 1111111111717
12 11111111132923
13 111111111114823
14 1111111111113823
15 11111111111111923
16 111111111111112319
17 1111111111111116223
18 11111111111111121119
19 111111111111111111523

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.