A261199 Minimal prime concatenation sequence with base 10 and seed 10.

10, 101, 1013, 10133, 101333, 10133303, 1013330309, 10133303093, 101333030933, 10133303093323, 1013330309332339, 101333030933233921, 10133303093323392109, 101333030933233921097, 10133303093323392109703, 1013330309332339210970311, 10133303093323392109703113

Offset: 1

Author

Clark Kimberling, Sep 16 2015

Keywords

• nonn
• easy
• base

Examples

			The least prime starting with seed 10 is 101; the least prime starting with 101 is 1013; the least prime starting with 1013 is 10133. Triangular format:
10
101
1013
10133
101333
10133303
1013330309
		

Links

• Clark Kimberling, Table of n, a(n) for n = 1..500

Crossrefs

Cf. A261199.

Programs

Mathematica

b = 10; s = {{10}};
Do[NestWhile[# + 1 &, 0, ! (PrimeQ[FromDigits[tmp = Join[Last[s], (nn = #;
IntegerDigits[nn - Sum[b^n, {n, l = NestWhile[# + 1 &, 1, ! (nn - (Sum[b^n, {n, #}]) < 0) &] - 1}], b, l + 1])], b]]) &]; AppendTo[s, tmp], {20}]; Map[FromDigits, s] (* Peter J. C. Moses, Aug 06 2015 *)