login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046301 Product of 3 successive primes. 21
30, 105, 385, 1001, 2431, 4199, 7429, 12673, 20677, 33263, 47027, 65231, 82861, 107113, 146969, 190747, 241133, 290177, 347261, 409457, 478661, 583573, 716539, 871933, 1009091, 1113121, 1201289, 1317919, 1564259, 1879981, 2279269 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

MATHEMATICA

lst={}; Do[p0=Prime[n]; p1=Prime[n+1]; p2=Prime[n+2]; a=p0*p1*p2; AppendTo[lst, a], {n, 5!}]; lst [From Vladimir Joseph Stephan Orlovsky, Mar 10 2009]

PROG

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

(MAGMA) [NthPrime(n)*NthPrime(n+1)*NthPrime(n+2): n in [1..31]]; /* Or: */ [&*[ NthPrime(n+k): k in [0..2] ]: n in [1..31] ]; // Bruno Berselli, Feb 25 2011

CROSSREFS

Cf. A002110, A006094, A046302, A046303, A046324, A046325, A046326, A046327.

Sequence in context: A101056 A081370 A158445 * A193873 A205836 A043466

Adjacent sequences:  A046298 A046299 A046300 * A046302 A046303 A046304

KEYWORD

nonn,easy

AUTHOR

Patrick De Geest, Jun 15 1998.

EXTENSIONS

Offset changed from 0 to 1 by Vincenzo Librandi, Jan 16 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 21 09:05 EDT 2013. Contains 225478 sequences.