Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075611 a(1) = 1, a(n) = smallest number > a(n-1) such that concatenation a(k) a(n) is prime for all k = 1 to n-1. Stop if no such number exists. +0
3
1, 3, 7, 73, 433, 607, 13381, 37279, 4800307, 1281054613 (list; graph; listen)
OFFSET

1,2

COMMENT

The sequence is probably finite.

EXAMPLE

a(5)=433 since 1433, 3433, 7433 and 73433 are all primes and for every 73<x<433, at least one of 1x, 3x, 7x, 73x is not prime.

CROSSREFS

Sequence in context: A078552 A091259 A088647 this_sequence A119572 A103737 A108537

Adjacent sequences: A075608 A075609 A075610 this_sequence A075612 A075613 A075614

KEYWORD

base,more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 28 2002

EXTENSIONS

Corrected and extended by Giovanni Resta (g.resta(AT)iit.cnr.it), Jun 18 2003

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 December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research