Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097638
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097638 a(n) is the smallest n-digit number m such that 10*m+1, 10*m+3, 10*m+7 & 10*m+9 are primes. +0
2
1, 10, 148, 1300, 10111, 100234, 1001395, 10000546, 100002526, 1000005742, 10000000753, 100000012369, 1000000005658, 10000000094572, 100000000006744, 1000000000134649, 10000000000032523, 100000000000043071 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is the smallest n-digit term of A007811. a(50)=10^49+10718757, can you find a(100)?

FORMULA

a[n_]:=(For[m=0, !(PrimeQ[10^n+10m+1]&&PrimeQ[10^n+10m+3]&&PrimeQ[10^n+10m+7] &&PrimeQ[10^n+10m+9]), m++ ];10^(n-1)+m);

EXAMPLE

a(4)=1300 because 13001,13003,13007 & 13009 are primes and 1300 is the

smallest 4-digit number with this property.

MATHEMATICA

a[n_]:=(For[m=0, !(PrimeQ[10^n+10m+1]&&PrimeQ[10^n+10m+3]&&PrimeQ[10^n+10m+7] &&PrimeQ[10^n+10m+9]), m++ ]; 10^(n-1)+m); Table[a[n], {n, 28}]

CROSSREFS

Cf. A097639, A007811.

Sequence in context: A134526 A055761 A095889 this_sequence A098270 A116156 A025750

Adjacent sequences: A097635 A097636 A097637 this_sequence A097639 A097640 A097641

KEYWORD

base,nonn

AUTHOR

Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Aug 18 2004

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research