A070826 -id:A070826 - cp's OEIS frontend

A111059 a(n) = Product_{k=1..n} A005117(k), the product of the first n squarefree positive integers.

1, 2, 6, 30, 180, 1260, 12600, 138600, 1801800, 25225200, 378378000, 6432426000, 122216094000, 2566537974000, 56463835428000, 1298668214844000, 33765373585944000, 979195833992376000, 29375875019771280000

Offset: 1

Leroy Quet, Oct 07 2005

nonn

Do all terms belong to A242031 (weakly decreasing prime signature)? - Gus Wiseman, May 14 2021

			Since the first 6 squarefree positive integers are 1, 2, 3, 5, 6, 7, the 6th term of the sequence is 1*2*3*5*6*7 = 1260.
From _Gus Wiseman_, May 14 2021: (Start)
The sequence of terms together with their prime signatures begins:
             1: ()
             2: (1)
             6: (1,1)
            30: (1,1,1)
           180: (2,2,1)
          1260: (2,2,1,1)
         12600: (3,2,2,1)
        138600: (3,2,2,1,1)
       1801800: (3,2,2,1,1,1)
      25225200: (4,2,2,2,1,1)
     378378000: (4,3,3,2,1,1)
    6432426000: (4,3,3,2,1,1,1)
  122216094000: (4,3,3,2,1,1,1,1)
(End)

Charles R Greathouse IV, Table of n, a(n) for n = 1..417

A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes.
A072047 applies Omega to each squarefree number.
A246867 groups squarefree numbers by Heinz weight (row sums: A147655).
A261144 groups squarefree numbers by smoothness (row sums: A054640).
A319246 gives the sum of prime indices of each squarefree number.
A329631 lists prime indices of squarefree numbers (reversed: A319247).
Cf. A001221, A002110, A014466, A070826, A338901, A339360.

Rest[FoldList[Times,1,Select[Range[40],SquareFreeQ]]] (* Harvey P. Dale, Jun 14 2011 *)

m=30;k=1;for(n=1,m,if(issquarefree(n),print1(k=k*n,",")))

More terms from Klaus Brockhaus, Oct 08 2005

A118750 a(n) = product[k=1..n] P(k), where P(k) is the largest prime <= 3*k. a(n) = product[k=1..n] A118749(k).

Original entry on oeis.org

3, 15, 105, 1155, 15015, 255255, 4849845, 111546435, 2565568005, 74401472145, 2306445636495, 71499814731345, 2645493145059765, 108465218947450365, 4664004414740365695, 219208207492797187665, 10302785752161467820255

Offset: 1

Jonathan Vos Post, Apr 29 2006

Differs from (after first term) A048599 "Partial products of the sequence (A001097) of twin primes" after 8th term. Differs from (after first term) A070826 "One half of product of first n primes A000040" after 9th term. Analogous to A118455 a(1)=1. a(n) = product{k=1..n} P(k), where P(k) is the largest prime <= k.

Cf. A020482, A049653, A060266-A060268, A060264, A060265, A060308, A118455, A118456, A118748.

A260442 Sequence A260443 sorted into ascending order.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 15, 17, 18, 19, 23, 29, 30, 31, 35, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 75, 77, 79, 83, 89, 90, 97, 101, 103, 105, 107, 109, 113, 127, 131, 137, 139, 143, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 210, 211, 221, 223, 227, 229, 233, 239, 241, 245, 251, 257, 263, 269, 270, 271, 277, 281, 283, 293, 307, 311

Offset: 0

Antti Karttunen, Jul 29 2015

nonn

Each term is a prime factorization encoding of one of the Stern polynomials. See A260443 for details.

Numbers n for which A260443(A048675(n)) = n. - Antti Karttunen, Oct 14 2016

Antti Karttunen, Table of n, a(n) for n = 0..10000

Cf. A003961, A048675, A260443.
Subsequence of A073491.
From 2 onward the positions of nonzeros in A277333.
Various subsequences: A000040, A002110, A070826, A277317, A277200 (even terms).  Also all terms of A277318 are included here.
Cf. also A277323, A277324 and permutation pair A277415 & A277416.

allocatemem(2^30);
A048675(n) = my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; \\ Michel Marcus, Oct 10 2016
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From Michel Marcus
A260443(n) = if(n<2, n+1, if(n%2, A260443(n\2)*A260443(n\2+1), A003961(A260443(n\2))));
isA260442(n) = (A260443(A048675(n)) == n);  \\ The most naive version.
A055396(n) = if(n==1, 0, primepi(factor(n)[1, 1])) \\ Charles R Greathouse IV, Apr 23 2015
A061395(n) =  if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); \\ After M. F. Hasler's code for A006530.
isA260442(n) = ((1==n) || isprime(n) || ((omega(n) == 1+(A061395(n)-A055396(n))) && (A260443(A048675(n)) == n))); \\ Somewhat optimized.
i=0; n=0; while(i < 10001, n++; if(isA260442(n), write("b260442.txt", i, " ", n); i++));
\\ Antti Karttunen, Oct 14 2016

from sympy import factorint, prime, primepi
from operator import mul
from functools import reduce
def a048675(n):
    F=factorint(n)
    return 0 if n==1 else sum([F[i]*2**(primepi(i) - 1) for i in F])
def a003961(n):
    F=factorint(n)
    return 1 if n==1 else reduce(mul, [prime(primepi(i) + 1)**F[i] for i in F])
def a(n): return n + 1 if n<2 else a003961(a(n//2)) if n%2==0 else a((n - 1)//2)*a((n + 1)//2)
print([n for n in range(301) if a(a048675(n))==n]) # Indranil Ghosh, Jun 21 2017

;; With Antti Karttunen's IntSeq-library.
(define A260442 (FIXED-POINTS 0 1 (COMPOSE A260443 A048675)))
;; An optimized version:
(define A260442 (MATCHING-POS 0 1 (lambda (n) (or (= 1 n) (= 1 (A010051 n)) (and (not (< (A001221 n) (+ 1 (A243055 n)))) (= n (A260443 (A048675 n))))))))
;; Antti Karttunen, Oct 14 2016

A285615 Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).

Original entry on oeis.org

30030, 39270, 43890, 46410, 51870, 53130, 62790, 66990, 67830, 71610, 79170, 82110, 84630, 85470, 91770, 94710, 99330, 101010, 103530, 108570, 111930, 117390, 122430, 128310, 136290, 140910, 144690, 154770, 161070, 164010, 166530, 168630, 182490, 191730

Offset: 1

Amiram Eldar, Apr 22 2017

nonn

Unitary 3-abundant numbers, correspond to 3-abundant numbers (A023197).
Similarly, the first numbers k such that usigma(k) >= 4*k are 200560490130, 7420738134810, 8222980095330, and 8624101075590. - Giovanni Resta, Apr 23 2017
The least odd term in this sequence is A070826(17) = 961380175077106319535 and the least odd number k such that usigma(k) >= 4*k is A070826(52) = 5.312...*10^95. - Amiram Eldar, Dec 26 2020

Amiram Eldar, Table of n, a(n) for n = 1..100

Cf. A034448, A023197, A034683, A070826.

usigma[n_] := If[n == 1, 1, Times @@ (1 + Power @@@ FactorInteger[n])]; Select[Range[100000], usigma[#] >= 3*# &]

isok(k) = sumdivmult(k, d, if(gcd(d, k/d)==1, d)) >= 3*k; \\ Michel Marcus, Dec 26 2020

A056606 Squarefree kernel of lcm(binomial(n,0), ..., binomial(n,n)).

Original entry on oeis.org

1, 1, 2, 3, 6, 10, 30, 105, 70, 42, 210, 2310, 2310, 4290, 6006, 15015, 30030, 170170, 510510, 1939938, 1385670, 881790, 9699690, 223092870, 44618574, 17160990, 74364290, 31870410, 223092870, 6469693230, 6469693230, 100280245065

Offset: 0

Labos Elemer, Aug 07 2000

nonn

Also squarefree kernel of A001142; row products in table A256113. - Reinhard Zumkeller, Mar 21 2015
a(2372) has 1001 decimal digits. - Michael De Vlieger, Jul 14 2017
Also the squarefree kernel of the cumulative product of n^n/n!. - Peter Luschny, Dec 21 2019
Conjecture: the few odd values belong to A070826. - Bill McEachen, Jun 24 2023
And their indices appear to be A007053. - Michel Marcus, Jul 01 2023

			a(7) = 105 because lcm(1, 7, 21, 35) = 105 is already squarefree.
a(0) = 1 because n^n/n! = 1 for the integer n = 0. - _Peter Luschny_, Dec 21 2019

Michael De Vlieger, Table of n, a(n) for n = 0..2371

Cf. A002944, A034386, A048633, A003418, A000142, A001405.
Cf. A007947, A001142, A256113, A002109, A000178, A329947.
Cf. A070826.

a056606 = a007947 . a001142  -- Reinhard Zumkeller, Mar 21 2015

h := n -> mul(k^k/factorial(k), k=0..n):
rad := n -> mul(k, k = numtheory[factorset](n)):
seq(rad(h(n)), n=0..31); # Peter Luschny, Dec 21 2019

Table[Apply[Times, FactorInteger[Product[k^(2 k - 1 - n), {k, n}]][[All, 1]]], {n, 0, 31}] (* or *)
Table[Apply[Times, FactorInteger[Apply[LCM, Range@ n]/n][[All, 1]]], {n, 1, 32}] (* Michael De Vlieger, Jul 14 2017 *)

rad(n) = factorback(factorint(n)[, 1]); \\ A007947
a(n) = rad(lcm(vector(n+1, k, binomial(n,k-1)))); \\ Michel Marcus, Jun 24 2023

a(n) = A007947(A002944(n+1)). - Michel Marcus, Dec 21 2019

a(n) = radical(hyperfactorial(n)/superfactorial(n)) = A007947(A002109(n)/ A000178(n)) for n >= 0. - Peter Luschny, Dec 21 2019

Extended with a(0) = 1 by Peter Luschny, Dec 21 2019

A096177 Primes p such that primorial(p)/2 + 2 is prime.

Original entry on oeis.org

2, 3, 5, 7, 13, 29, 31, 37, 47, 59, 109, 223, 307, 389, 457, 1117, 1151, 2273, 9137, 10753, 15727, 25219, 26459, 29251, 30259, 52901, 194471

Offset: 1

Hugo Pfoertner, Jun 27 2004

a(27) > 172000. - Robert Price, May 10 2019

Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - Hugo Pfoertner, Nov 16 2019

			a(3)=7 because primorial(7)/2 + 2 = A070826(4) + 2 = 2*3*5*7/2 + 2 = 107 is prime.

Cf. A070826, A096178 primes of the form primorial(p)/2+2, A096547 primes p such that primorial(p)/2-2 is prime, A067024 smallest p+2 that has n distinct prime factors, A014545 primorial primes, A087398.

k = 1; Do[If[PrimeQ[n], k = k*n; If[PrimeQ[k/2 + 2], Print[n]]], {n, 2, 100000}] (* Ryan Propper, Jul 03 2005 *)

P=1/2;forprime(p=2,1e4,if(isprime((P*=p)+2), print1(p", "))) \\ Charles R Greathouse IV, Mar 14 2011

7 additional terms, corresponding to probable primes, from Ryan Propper, Jul 03 2005
Edited by T. D. Noe, Oct 30 2008
a(26) from Robert Price, May 10 2019
a(27) from Tyler Busby, Mar 17 2024

A128281 a(n) is the least product of n distinct odd primes m=p_1p_2...*p_n, such that (d+m/d)/2 are all primes for each d dividing m.

Original entry on oeis.org

3, 21, 105, 1365, 884037

Offset: 1

Kok Seng Chua (chuakokseng(AT)hotmail.com), Mar 05 2007

From Iain Fox, Aug 26 2020: (Start)
a(6) > 10^9 if it exists.
All terms are members of A076274 since the definition requires that (1+m)/2 be prime.
The number of prime factors of m congruent to 3 (mod 4) must be even except for n=1.
(End)
a(6) > 2*10^11 if it exists. - David A. Corneth, Aug 27 2020
a(n) >= A070826(n+1) by definition of the sequence. - Iain Fox, Aug 28 2020

			105=3*5*7, (3*5*7+1)/2=53, (3+5*7)/2=19, (5+3*7)/2=13, (7+3*5)/2=11 are all primes and 105 is the least such number which is the product of 3 primes, so a(3)=3.

Subsequence of A076274.
Lower bound: A070826.
Cf. A002145, A128276, A128282, A128283, A128284, A128285, A128286, A168352.

a(n)=if(n==1, return(3)); my(p=prod(k=1, n, prime(k+1))); forstep(m=p+if(p%4-1, 2), +oo, 4, if(bigomega(m)==n && omega(m)==n, fordiv(m, d, if(!isprime((d+m/d)/2), next(2))); return(m))) \\ Iain Fox, Aug 27 2020

Definition corrected by Iain Fox, Aug 25 2020

A136358 Increasing sequence obtained by union of two sequences {b(n)} and {c(n)}, where b(n) is the smallest odd composite number m such that both m-2 and m+2 are prime and the set of distinct prime factors of m consists of the first n odd primes and c(n) is the smallest composite number m such that both m-1 and m+1 are primes and the set of the distinct prime factors of m consists of the first n primes.

Original entry on oeis.org

4, 6, 9, 15, 30, 105, 420, 2310, 3465, 15015, 180180, 765765, 4084080, 106696590, 247342095, 892371480, 3011753745, 9704539845, 100280245065, 103515091680, 4412330782860, 29682952539240, 634473110526255, 22514519501013540

Offset: 1

Enoch Haga, Dec 25 2007

This sequence is different from A070826 and A118750.

			a(1)=4 is preceded by 3 and followed by 5, both primes; a(3)=9, preceded by 7 and followed by 11, both primes.

Cf. A136349-A136357, A070826, A118750.

b[n_]:=(d=Product[Prime[k],{k,n}]; For[m=1,!(!PrimeQ[d*m]&&PrimeQ[d*m-1] &&PrimeQ[d*m+1]&&Length[FactorInteger[c*m]]==n),m++ ]; d*m); c[n_]:=(d=Product [Prime[k],{k,2,n+1}]; For[m=1,!(!PrimeQ[d*(2*m-1)]&&PrimeQ[d(2m-1)-2]&&PrimeQ [d(2m-1)+2]&&Length[FactorInteger[d(2m-1)]]==n),m++ ]; d(2m-1)); Take[Union[Table [b[k],{k,24}],Table[c[k],{k,24}]],24] (* Farideh Firoozbakht, Aug 13 2009 *)

10 'A136358, Enoch Haga, Jun 19 2009'
11 'compute and combine input 2 or 3 separately; begin with 4 and 9
20 input "prime, 2 or 3";A
30 if A=2 or A=3 then B=nxtprm(A)
40 print A;B;:R=A*B:print R;:stop
50 if even(R)=1 then if R-1=prmdiv(R-1) and R+1=prmdiv(R+1) then print "*"
60 if even(R)=0 then if R-2=prmdiv(R-2) and R+2=prmdiv(R+2) then print "+"
61 print R:stop
70 B=nxtprm(B):R=B*R
90 print B;R:stop
100 goto 50
- Enoch Haga, Jul 11 2009

Edited, corrected and extended by Farideh Firoozbakht, Aug 13 2009

A355537 Number of ways to choose a sequence of prime factors, one of each integer from 2 to n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 8, 8, 16, 32, 32, 32, 64, 64, 128, 256, 512, 512, 1024, 1024, 2048, 2048, 4096, 4096, 12288, 12288, 12288, 24576, 49152, 98304, 196608, 196608, 393216, 786432, 1572864, 1572864, 4718592, 4718592, 9437184, 18874368, 37748736

Offset: 1

Gus Wiseman, Jul 20 2022

nonn

Also partial products of A001221 without the first term 0, sum A013939.

For initial terms up to n = 29 we have a(n) = 2^A355538(n). The first non-power of 2 is a(30) = 12288.

			The a(n) choices for n = 2, 6, 10, 12, with prime(k) replaced by k:
  (1)  (12131)  (121314121)  (12131412151)
       (12132)  (121314123)  (12131412152)
                (121324121)  (12131412351)
                (121324123)  (12131412352)
                             (12132412151)
                             (12132412152)
                             (12132412351)
                             (12132412352)

The sum of the same integers is A000096.
The product of the same integers is A000142, Heinz number A070826.
The version for divisors instead of prime factors is A066843.
The integers themselves are the rows of A131818.
The version with multiplicity is A327486.
Using prime indices instead of 2..n gives A355741, for multisets A355744.
Counting sequences instead of multisets gives A355746.
A001221 counts distinct prime factors, with sum A001414.
A001222 counts prime factors with multiplicity.
A003963 multiplies together the prime indices of n.
A056239 adds up prime indices, row sums of A112798.
Cf. A000005, A000040, A000720, A002110, A013939, A076610, A355538, A355731, A355733, A355745, A355747.

Table[Times@@PrimeNu/@Range[2,m],{m,2,30}]

A096334 Triangle read by rows: T(n,k) = prime(n)#/prime(k)#, 0<=k<=n.

Original entry on oeis.org

1, 2, 1, 6, 3, 1, 30, 15, 5, 1, 210, 105, 35, 7, 1, 2310, 1155, 385, 77, 11, 1, 30030, 15015, 5005, 1001, 143, 13, 1, 510510, 255255, 85085, 17017, 2431, 221, 17, 1, 9699690, 4849845, 1616615, 323323, 46189, 4199, 323, 19, 1, 223092870, 111546435, 37182145, 7436429, 1062347, 96577, 7429, 437, 23, 1

Offset: 0

Reinhard Zumkeller, Aug 03 2004

T(n,k) is the (k+1)-th product of (n-k) successive primes (k, n-(k+1) >= 0). - Alois P. Heinz, Jan 21 2022

			Triangle begins:
    1;
    2,   1;
    6,   3,  1;
   30,  15,  5, 1;
  210, 105, 35, 7, 1;
  ...

Alois P. Heinz, Rows n = 0..140, flattened

T(n-1+j,n-1) give (j=1-12): A000040, A006094, A046301, A046302, A046303, A046324, A046325, A046326, A046327, A127342, A127343, A127344.
Columns k=0-1 give: A002110, A070826.
T(2n,n) gives A107712.
Row sums give A350895.
Antidiagonal sums give A350758.
Cf. A073485 (distinct values sorted).

T:= proc(n, k) option remember;
     `if`(n=k, 1, T(n-1, k)*ithprime(n))
    end:
seq(seq(T(n, k), k=0..n), n=0..10);  # Alois P. Heinz, Jan 21 2022

T[n_, k_] := Times @@ Prime[Range[k + 1, n]];
Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 13 2021 *)

pr(n) = factorback(primes(n)); \\ A002110
row(n) = my(P=pr(n)); vector(n+1, k, P/pr(k-1)); \\ Michel Marcus, Jan 21 2022

T(n,0) = A002110(n); T(n,n) = 1;
T(n,n-1) = A000040(n) for n>0;
T(n,k) = A002110(n)/A002110(k), 0<=k<=n.
T(n,k) = Product_{j=k+1..n} prime(j). - Alois P. Heinz, Jan 21 2022

cp's OEIS Frontend

A111059 a(n) = Product_{k=1..n} A005117(k), the product of the first n squarefree positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A118750 a(n) = product[k=1..n] P(k), where P(k) is the largest prime <= 3*k. a(n) = product[k=1..n] A118749(k).

Views

Author

Keywords

Comments

Crossrefs

A260442 Sequence A260443 sorted into ascending order.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Python

Scheme

A285615 Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A056606 Squarefree kernel of lcm(binomial(n,0), ..., binomial(n,n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A096177 Primes p such that primorial(p)/2 + 2 is prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A128281 a(n) is the least product of n distinct odd primes m=p_1*p_2*...*p_n, such that (d+m/d)/2 are all primes for each d dividing m.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Extensions

Views

Author

Keywords

Comments

A128281 a(n) is the least product of n distinct odd primes m=p_1p_2...*p_n, such that (d+m/d)/2 are all primes for each d dividing m.