Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087201
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087201 a(n) is the smallest m such that m > A055211(n) and A002110(n)-m is prime. +0
2
11, 13, 17, 19, 47, 37, 61, 67, 79, 107, 53, 149, 97, 89, 109, 223, 107, 179, 181, 101, 197, 101, 257, 139, 137, 197, 313, 257, 257, 223, 449, 373, 233, 463, 479, 409, 257, 409, 383, 317, 587, 607, 401, 463, 347, 313, 751, 313, 443, 349, 809, 661, 587, 367 (list; graph; listen)
OFFSET

3,1

COMMENT

a(1) and a(2) are not defined. a(n) is the second m (first m is A055211(n)) such that m > 1 and A002110(n)-m is prime. I guess every term of this sequence (compare the conjecture about A055211) is prime. I checked this conjecture for n < 418.

FORMULA

A055211[n_] := (For[m=2, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); a[n_] := (For[m=A055211[n]+1, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m);

MATHEMATICA

A055211[n_] := (For[m=2, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); a[n_] := (For[m=A055211[n]+1, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); Table[a[n], {n, 3, 62}]

CROSSREFS

Cf. A055211, A002110, A087200.

Adjacent sequences: A087198 A087199 A087200 this_sequence A087202 A087203 A087204

Sequence in context: A068155 A157175 A132244 this_sequence A068492 A045707 A032591

KEYWORD

easy,nonn

AUTHOR

Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Aug 27 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 November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research