Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097639 a(n) is the smallest number m such that for the n-digit number s=10^(n-1)+ m, 10*s+1, 10*s+3, 10*s+7 and 10*s+9 are primes. +0
2
0, 0, 48, 300, 111, 234, 1395, 546, 2526, 5742, 753, 12369, 5658, 94572, 6744, 134649, 32523, 43071, 213927, 256116, 8172, 431904, 57138, 433125, 123225, 711447, 318501, 40758, 150063, 184602, 134661, 377778, 129048, 504678, 88113, 3174738 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n)=A097638(n)-10^(n-1). a(50)= 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++ ];m);

EXAMPLE

a(4)=300 because 10(10^3+300)+ 1, 10(10^3+300)+ 3,10(10^3+300)+ 7 &

10(10^3+300)+1, are primes and 300 is the smallest 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++ ]; m); Table[a[n], {n, 43}]

CROSSREFS

Cf. A097638, A007811.

Sequence in context: A052683 A115056 A001337 this_sequence A134607 A037056 A110275

Adjacent sequences: A097636 A097637 A097638 this_sequence A097640 A097641 A097642

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research