A166329 -id:A166329 - cp's OEIS frontend

A006094 Products of 2 successive primes.

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

Offset: 1

N. J. A. Sloane

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
a(n+1) = smallest number such that gcd(a(n), a(n+1)) = prime(n+1). - Alexandre Wajnberg and Ray Chandler, Oct 14 2005
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
a(n) = A001358(A172348(n)); A046301(n) = lcm(a(n), a(n+1)); A065091(n) = gcd(a(n), a(n+1)); A066116(n+2) = a(n+1)*a(n); A109805(n) = a(n+1) - a(n). - Reinhard Zumkeller, Mar 13 2011
See A209329 for the sum of the reciprocals. - M. F. Hasler, Jan 22 2013
A078898(a(n)) = 3. - Reinhard Zumkeller, Apr 06 2015

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).

Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
A. Bernoff and R. Pennington, Problems Drive 1984, Archimedeans Problems Drive, Eureka, 45 (1985), 22-25, 50. (Annotated scanned copy)
C. Cobeli and A. Zaharescu, A game with divisors and absolute differences of exponents, Journal of Difference Equations and Applications, Vol. 20, #11 (2014) pp. 1489-1501, DOI: 10.1080/10236198.2014.940337. Also available as arXiv:1411.1334 [math.NT], 2014.

Subset of the squarefree semiprimes, A006881.
Cf. A090076, A090090.
Cf. A166329, A152241, A030664, A219603.
Cf. A046301, A046302, A046303, A046324, A046325, A046326, A046327.
Subsequence of A256617 and A097889.
Cf. A000040, A078898.

a006094 n = a006094_list !! (n-1)
a006094_list = zipWith (*) a000040_list a065091_list
-- Reinhard Zumkeller, Mar 13 2011

a006094_list = pr a000040_list
  where pr (n:m:tail) = n*m : pr (m:tail)
        pr _ = []
-- Jean-François Antoniotti, Jan 08 2020

[NthPrime(n)*NthPrime(n+1): n in [1..41]]; // Bruno Berselli, Feb 24 2011

a:= n-> (p-> p(n)*p(n+1))(ithprime):
seq(a(n), n=1..43);  # Alois P. Heinz, Jan 02 2021

Table[ Prime[n] Prime[n + 1], {n, 40}] (* Robert G. Wilson v, Jan 22 2004 *)
Times@@@Partition[Prime[Range[60]], 2, 1] (* Harvey P. Dale, Oct 15 2011 *)

ithprime(i)*ithprime(i+1) $ i = 1..41 // Zerinvary Lajos, Feb 26 2007

g(n) = for(x=1,n,print1(prime(x)*prime(x+1)",")) \\ Cino Hilliard, Jul 28 2006

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

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
print(aupton(43)) # Michael S. Branicky, Jun 15 2021

from sympy import prime, nextprime
def A006094(n): return (p:=prime(n))*nextprime(p) # Chai Wah Wu, Oct 18 2024

A209329 = Sum_{n>=2} 1/a(n). - M. F. Hasler, Jan 22 2013

a(n) = A000040(n) * A000040(n+1). - Alois P. Heinz, Jan 02 2021

A348717 a(n) is the least k such that A003961^i(k) = n for some i >= 0 (where A003961^i denotes the i-th iterate of A003961).

Original entry on oeis.org

1, 2, 2, 4, 2, 6, 2, 8, 4, 10, 2, 12, 2, 14, 6, 16, 2, 18, 2, 20, 10, 22, 2, 24, 4, 26, 8, 28, 2, 30, 2, 32, 14, 34, 6, 36, 2, 38, 22, 40, 2, 42, 2, 44, 12, 46, 2, 48, 4, 50, 26, 52, 2, 54, 10, 56, 34, 58, 2, 60, 2, 62, 20, 64, 14, 66, 2, 68, 38, 70, 2, 72, 2

Offset: 1

Rémy Sigrist, Oct 31 2021

nonn

All terms except a(1) = 1 are even.
To compute a(n) for n > 1:
- if n = Product_{j = 1..o} prime(p_j)^e_j (where prime(i) denotes the i-th prime number, p_1 < ... < p_o and e_1 > 0)
- then a(n) = Product_{j = 1..o} prime(p_j + 1 - p_1)^e_j.
This sequence has similarities with A304776: here we shift down prime indexes, there prime exponents.
Smallest number generated by uniformly decrementing the indices of the prime factors of n. Thus, for n > 1, the smallest m > 1 such that the first differences of the indices of the ordered prime factors (including repetitions) are the same for m and n. As a function, a(.) preserves properties such as prime signature. - Peter Munn, May 12 2022

Positions of particular values (see formula section): A000040, A001248, A006094, A030078, A030514, A046301, A050997, A090076, A090090, A166329, A251720.
Also see formula section for the relationship to: A000265, A003961, A004277, A005940, A020639, A046523, A055396, A071364, A122111, A156552, A243055, A243074, A297845, A322993.
Sequences with comparable definitions: A304776, A316437.
Cf. A246277 (terms halved), A305897 (restricted growth sequence transform), A354185 (Möbius transform), A354186 (Dirichlet inverse), A354187 (sum with it).

a[1] = 1; a[n_] := Module[{f = FactorInteger[n], d}, d = PrimePi[f[[1, 1]]] - 1; Times @@ ((Prime[PrimePi[#[[1]]] - d]^#[[2]]) & /@ f)]; Array[a, 100] (* Amiram Eldar, Oct 31 2021 *)

a(n) = { my (f=factor(n)); if (#f~>0, my (pi1=primepi(f[1,1])); for (k=1, #f~, f[k,1] = prime(primepi(f[k,1])-pi1+1))); factorback(f) }

a(n) = n iff n belongs to A004277.
A003961^(A055396(n)-1)(a(n)) = n for any n > 1.
a(n) = 2 iff n belongs to A000040 (prime numbers).
a(n) = 4 iff n belongs to A001248 (squares of prime numbers).
a(n) = 6 iff n belongs to A006094 (products of two successive prime numbers).
a(n) = 8 iff n belongs to A030078 (cubes of prime numbers).
a(n) = 10 iff n belongs to A090076.
a(n) = 12 iff n belongs to A251720.
a(n) = 14 iff n belongs to A090090.
a(n) = 16 iff n belongs to A030514.
a(n) = 30 iff n belongs to A046301.
a(n) = 32 iff n belongs to A050997.
a(n) = 36 iff n belongs to A166329.
a(1) = 1, for n > 1, a(n) = 2*A246277(n). - Antti Karttunen, Feb 23 2022
a(n) = A122111(A243074(A122111(n))). - Peter Munn, Feb 23 2022
From Peter Munn and Antti Karttunen, May 12 2022: (Start)
a(1) = 1; a(2n) = 2n; a(A003961(n)) = a(n). [complete definition]
a(n) = A005940(1+A322993(n)) = A005940(1+A000265(A156552(n))).
Equivalently, A156552(a(n)) = A000265(A156552(n)).
A297845(a(n), A020639(n)) = n.
A046523(a(n)) = A046523(n).
A071364(a(n)) = A071364(n).
a(n) >= A071364(n).
A243055(a(n)) = A243055(n).
(End)

A152241 Products of cubes of 2 successive primes.

Original entry on oeis.org

216, 3375, 42875, 456533, 2924207, 10793861, 33698267, 83453453, 296740963, 726572699, 1509003523, 3491055413, 5479701947, 8254655261, 15456856771, 30576209383, 46617130799, 68267486503, 107646386093, 139233463487, 191800552663, 281913290693, 403092109603

Offset: 1

N. J. A. Sloane, Oct 13 2009

nonn

			a(1) = (2*3)^3 = 216.

Cf. A006094, A166329.

A334110 The squares of squarefree numbers (A062503), ordered lexicographically according to their prime factors. a(n) = Product_{k in I} prime(k+1)^2, where I are the indices of nonzero binary digits in n = Sum_{k in I} 2^k.

Original entry on oeis.org

1, 4, 9, 36, 25, 100, 225, 900, 49, 196, 441, 1764, 1225, 4900, 11025, 44100, 121, 484, 1089, 4356, 3025, 12100, 27225, 108900, 5929, 23716, 53361, 213444, 148225, 592900, 1334025, 5336100, 169, 676, 1521, 6084, 4225, 16900, 38025, 152100, 8281, 33124, 74529, 298116, 207025, 828100, 1863225, 7452900, 20449, 81796, 184041

Offset: 0

Antti Karttunen and Peter Munn, May 01 2020

nonn

For the lexicographic ordering, the prime factors must be written in nonincreasing order. If we write the factors in nondecreasing order, we get a lexicographically ordered set with an order type that is greater than a natural number index - the resulting sequence does not include all qualifying numbers. (Note also that the symbols used for the lexicographic order are the prime numbers, not their digits.)
a(n) is the n-th power of 4 in the monoid defined in A331590.
Conjecture: a(n) is the position of the first occurrence of n in A334109.

			The initial terms are shown below, equated with the product of their prime factors to exhibit the lexicographic ordering. The list starts with 1, since 1 is factored as the empty product and the empty list is first in lexicographic order.
    1 = .
    4 = 2*2.
    9 = 3*3.
   36 = 3*3*2*2.
   25 = 5*5.
  100 = 5*5*2*2.
  225 = 5*5*3*3.
  900 = 5*5*3*3*2*2.
   49 = 7*7.
  196 = 7*7*2*2.
  441 = 7*7*3*3.

Cf. A000079, A019565 (square roots), A048675, A097248, A225546, A267116, A332382, A334109 (a left inverse).
Column 2 of A329332. Permutation of A062503.
After 1, the right children of the leftmost edge of A334860, or respectively, the left children of the rightmost edge of A334866.
Subsequences: A001248, A061742, A166329.
Subsequence of A052330.
A003961, A003987, A059897, A331590 are used to express relationship between terms of this sequence.

Array[If[# == 0, 1, Times @@ Flatten@ Map[Function[{p, e}, Map[Prime[Log2@ # + 1]^(2^(PrimePi@ p - 1)) &, DeleteCases[NumberExpand[e, 2], 0]]] @@ # &, FactorInteger[3^#]]] &, 51, 0] (* Michael De Vlieger, May 26 2020 *)

A334110(n) = { my(p=2,m=1); while(n, if(n%2, m *= p^2); n >>= 1; p = nextprime(1+p)); (m); };

a(n) = A019565(n)^2.
For n >= 1, a(A000079(n-1)) = A001248(n).
For all n >= 0, A334109(a(n)) = n.
a(n+k) = A331590(a(n), a(k)).
a(n XOR k) = A059897(a(n), a(k)), where XOR denotes bitwise exclusive-or, A003987.
a(n) = A225546(3^n).
a(2n) = A003961(a(n)).
a(2n+1) = 4 * a(2n).
a(2^k-1) = A061742(k).
A267116(a(n)) = 2.
A048675(a(n)) = 2n.
A097248(a(n)) = A332382(n) = A019565(2n).

A069075 a(n) = (4*n^2 - 1)^2.

Original entry on oeis.org

1, 9, 225, 1225, 3969, 9801, 20449, 38025, 65025, 104329, 159201, 233289, 330625, 455625, 613089, 808201, 1046529, 1334025, 1677025, 2082249, 2556801, 3108169, 3744225, 4473225, 5303809, 6245001, 7306209, 8497225, 9828225, 11309769

Offset: 0

Benoit Cloitre, Apr 05 2002

Products of squares of 2 successive odd numbers. - Peter Munn, Nov 17 2019

L. B. W. Jolley, Summation of Series, Dover, 1961.
Konrad Knopp, Theory and application of infinite series, Dover, 1990, p. 269.

Konrad Knopp, Theorie und Anwendung der unendlichen Reihen, Berlin, J. Springer, 1922. (Original german edition of "Theory and Application of Infinite Series")
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000466, A123092, A166329.

(4*Range[0,30]^2-1)^2 (* or *) LinearRecurrence[{5,-10,10,-5,1},{1,9,225,1225,3969},30] (* Harvey P. Dale, Feb 23 2018 *)

Sum_{n>=1} 1/a(n) = (Pi^2 - 8)/16 = 0.1168502750680... (A123092) [Jolley eq. 247]
G.f.: (-1 - 4*x - 190*x^2 - 180*x^3 - 9*x^4) / (x-1)^5. - R. J. Mathar, Oct 03 2011
a(n) = A000466(n)^2. - Peter Munn, Nov 17 2019
E.g.f.: exp(x)*(1 + 8*x + 104*x^2 + 96*x^3 + 16*x^4). - Stefano Spezia, Nov 17 2019
Sum_{n>=0} (-1)^n/a(n) = Pi/8 + 1/2. - Amiram Eldar, Feb 08 2022

A166502 The n-th power of the product prime(n)*prime(n+1) of 2 successive primes.

Original entry on oeis.org

6, 225, 42875, 35153041, 59797108943, 116507435287321, 366790143213462347, 1329999555322686599521, 26129584584668699724236347, 344823548950275944213556441001, 4520615782446712879799718786455203, 148534373731547764810930925932451123761

Offset: 1

Jonathan Vos Post, Oct 15 2009

			A[k,n] = n-th product of k-th power of 2 successive primes begins:
===============================================================================
...|.n=1|..n=2|....n=3|.....n=4|......n=5|......n=6|......n=7|......n=8|.in.OEIS
================================================================================
k=1|...6|...15|.....35|......77|......143|......221|......323|......437|A006094
k=2|..36|..225|...1225|....5929|....20449|....48841|...104329|...104329|A166329
k=3|.216|.3375|..42875|..456533|..2924207|.10793861|.33698267|.83453453|A152241
k=4|1296|50625|1500625|35153041|418161601|.........|.........|.........|.......
================================================================================

Harvey P. Dale, Table of n, a(n) for n = 1..166

Cf. A000040, A006094, A166329, A152241.

A166502 := proc(n) ithprime(n)*ithprime(n+1) ; %^n ; end: seq(A166502(n),n=1..15) ; # R. J. Mathar, Oct 16 2009

With[{nn=20},(Times@@#[[2]])^#[[1]]&/@Thread[{Range[nn-1],Partition[ Prime[ Range[ nn]],2,1]}]] (* Harvey P. Dale, Jan 12 2015 *)

a(n) = (prime(n)*prime(n+1))^n; \\ Michel Marcus, May 05 2019

a(n) = Product_{i=n..n+1} prime(i)^n = (A000040(n)*A000040(n+1))^n. [corrected by R. J. Mathar, Oct 16 2009]

a(n) = A006094(n)^n. - Michel Marcus, May 05 2019

A258155 Products of squares of three successive primes.

Original entry on oeis.org

900, 11025, 148225, 1002001, 5909761, 17631601, 55190041, 160604929, 427538329, 1106427169, 2211538729, 4255083361, 6865945321, 11473194769, 21599886961, 36384418009, 58145123689, 84202691329, 120590202121, 167655034849, 229116352921, 340557446329, 513428138521

Offset: 1

K. D. Bajpai, May 22 2015

			a(1) = 900 = 2^2 * 3^2 * 5^2;
a(2) = 11025 = 3^2 * 5^2 * 7^2.

K. D. Bajpai, Table of n, a(n) for n = 1..10000

Cf. A000040, A006094, A046301, A152241, A166329.

Table[Prime[n]^2 Prime[n + 1]^2 Prime[n + 2]^2, {n, 50}]

for( n= 1,100, k= prime(n)^2 * prime(n+1)^2 * prime(n+2)^2; print1(k, ", "))

a(n) = A046301(n)^2. - Michel Marcus, May 22 2015

a(n) ~ n^3 log^3 n. - Charles R Greathouse IV, May 22 2015

cp's OEIS Frontend

A006094 Products of 2 successive primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Haskell

Magma

Maple

Mathematica

MuPAD

PARI

PARI

Python

Python

Formula

A348717 a(n) is the least k such that A003961^i(k) = n for some i >= 0 (where A003961^i denotes the i-th iterate of A003961).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A152241 Products of cubes of 2 successive primes.

Views

Author

Keywords

Examples

Crossrefs

A334110 The squares of squarefree numbers (A062503), ordered lexicographically according to their prime factors. a(n) = Product_{k in I} prime(k+1)^2, where I are the indices of nonzero binary digits in n = Sum_{k in I} 2^k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A069075 a(n) = (4*n^2 - 1)^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A166502 The n-th power of the product prime(n)*prime(n+1) of 2 successive primes.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A258155 Products of squares of three successive primes.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs