Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057692 Smallest prime which produces exactly n+1 different primes after n applications of the A057628 transform. +0
1
2, 31, 641, 12422153 (list; graph; listen)
OFFSET

0,1

COMMENT

a(4) found by Carlos Rivera (crivera(AT)primepuzzles.net) and confirmed to be the smallest by Paul Jobling (Paul.Jobling(AT)WhiteCross.com)

EXAMPLE

31 becomes 3331, and both 31 and 3331 are primes. 641 becomes 66666644441 and then 66666666666666666666666666666666666644444444444444441 and all 3 are primes.

CROSSREFS

Cf. A057628.

Sequence in context: A071360 A108491 A088104 this_sequence A058244 A024235 A010789

Adjacent sequences: A057689 A057690 A057691 this_sequence A057693 A057694 A057695

KEYWORD

base,hard,nonn

AUTHOR

G. L. Honaker, Jr. (honak3r(AT)bvunet.net), Oct 20 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research