The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A088292

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Smallest prime in which the digit string can be partitioned in n+1 parts (0 parts allowed) such that the sum of the first n parts = the (n+1)th one.
(history; published version)

#4 by N. J. A. Sloane at Thu Dec 05 19:56:34 EST 2013

AUTHOR

_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Sep 30 2003

Discussion

Thu Dec 05

19:56

OEIS Server: https://oeis.org/edit/global/2075

#3 by Russ Cox at Sat Mar 31 13:20:51 EDT 2012

EXTENSIONS

More terms from _David Wasserman (wasserma(AT)spawar.navy.mil), _, Aug 04 2005

Discussion

Sat Mar 31

13:20

OEIS Server: https://oeis.org/edit/global/880

#2 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005

DATA

11, 167, 101, 1427, 10067, 100517, 1000427, 10000247, 100001147, 1000000427, 10000001057, 100000000427, 1000000002227, 10000000002227, 100000000000067, 1000000000011227, 10000000000002137, 100000000000000337

KEYWORD

base,more,nonn,new

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 04 2005

#1 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004

NAME

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

DATA

11, 167, 1427, 10067, 100517

OFFSET

0,1

EXAMPLE

a(1) = 11, 1 = 1.

a(2) = 167, 1+6 = 7

a(3) = 1427, 1+4+2 = 7.

CROSSREFS

Cf. A088291, A088293.

KEYWORD

base,more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 30 2003

STATUS

approved