|
|
A006094
|
|
Products of 2 successive primes.
(Formerly M4110)
|
|
142
|
|
|
6, 15, 35, 77, 143, 221, 323, 437, 667, 899, 1147, 1517, 1763, 2021, 2491, 3127, 3599, 4087, 4757, 5183, 5767, 6557, 7387, 8633, 9797, 10403, 11021, 11663, 12317, 14351, 16637, 17947, 19043, 20711, 22499, 23707, 25591, 27221, 28891, 30967, 32399, 34571, 36863
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The Huntley reference would suggest prefixing the sequence with an initial 4 - Enoch Haga. [But that would conflict with the definition! - N. J. A. Sloane, Oct 13 2009]
Sequence appears to coincide with the sequence of numbers n such that the largest prime < sqrt(n) and the smallest prime > sqrt(n) divide n. - Benoit Cloitre, Apr 04 2002
This is true: p(n) < [ sqrt(a(n)) = sqrt(p(n)*p(n+1)) ] < p(n+1) by definition. - Jon Perry, Oct 02 2013
Also the area of rectangles whose side lengths are consecutive primes. E.g., the consecutive primes 7,11 produce a 7 X 11 unit rectangle which has area 77 square units. - Cino Hilliard, Jul 28 2006
|
|
REFERENCES
|
H. E. Huntley, The Divine Proportion, A Study in Mathematical Beauty. New York: Dover, 1970. See Chapter 13, Spira Mirabilis, especially Fig. 13-5, page 173.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
A. Bernoff and R. Pennington, Problems Drive 1984, Archimedeans Problems Drive, Eureka, 45 (1985), 22-25, 50. (Annotated scanned copy)
|
|
FORMULA
|
|
|
MAPLE
|
a:= n-> (p-> p(n)*p(n+1))(ithprime):
|
|
MATHEMATICA
|
Times@@@Partition[Prime[Range[60]], 2, 1] (* Harvey P. Dale, Oct 15 2011 *)
|
|
PROG
|
(PARI) g(n) = for(x=1, n, print1(prime(x)*prime(x+1)", ")) \\ Cino Hilliard, Jul 28 2006
(PARI) is(n)=my(p=precprime(sqrtint(n))); p>1 && n%p==0 && isprime(n/p) && nextprime(p+1)==n/p \\ Charles R Greathouse IV, Jun 04 2014
(MuPAD) ithprime(i)*ithprime(i+1) $ i = 1..41 // Zerinvary Lajos, Feb 26 2007
(Magma) [NthPrime(n)*NthPrime(n+1): n in [1..41]]; // Bruno Berselli, Feb 24 2011
(Haskell)
a006094 n = a006094_list !! (n-1)
a006094_list = zipWith (*) a000040_list a065091_list
(Haskell)
a006094_list = pr a000040_list
where pr (n:m:tail) = n*m : pr (m:tail)
pr _ = []
(Python)
from sympy import prime, primerange
def aupton(nn):
alst, prevp = [], 2
for p in primerange(3, prime(nn+1)+1): alst.append(prevp*p); prevp = p
return alst
|
|
CROSSREFS
|
Subset of the squarefree semiprimes, A006881.
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|