Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090090
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090090 a(n) = prime(n)*prime(n+3). +0
7
14, 33, 65, 119, 209, 299, 493, 589, 851, 1189, 1333, 1739, 2173, 2537, 2867, 3551, 4189, 4453, 5293, 5893, 6497, 7663, 8383, 9167, 10379, 11009, 11639, 13589, 14279, 15481, 17653, 19519, 20687, 21823, 24287, 25217, 27161, 29177, 30227, 33043 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(5) = prime(5)*prime(8) = 11*19 = 209.

MATHEMATICA

Table[ Prime[n] Prime[n + 3], {n, 1, 40}] (from Robert G. Wilson v Jan 22 2004)

PROGRAM

def prime_gaps(n): primegaps = [] nprimes = primes_first_n(n+1) for i in range(3, n+1): primegaps.append(nprimes[i]*nprimes[i-3]) return primegaps print prime_gaps(60) - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 08 2008

CROSSREFS

Subset of the square-free semiprimes, A006881. Cf. A006094, A090076.

Sequence in context: A018959 A107484 A076329 this_sequence A116150 A019272 A018949

Adjacent sequences: A090087 A090088 A090089 this_sequence A090091 A090092 A090093

KEYWORD

easy,nonn

AUTHOR

Felix Tubiana (fat2(AT)columbia.edu), Jan 21 2004

EXTENSIONS

Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 22 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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research