A060735 -id:A060735 - cp's OEIS frontend

A378018 Primes p which can be written as p = (A060735(k) +- next largest prime factor not in A060735(k)) for some k.

3, 5, 7, 11, 13, 17, 19, 23, 29, 37, 53, 67, 83, 97, 113, 127, 157, 173, 199, 409, 431, 619, 641, 829, 1039, 1061, 1249, 1459, 1481, 1669, 1879, 1901, 2089, 2111, 2297, 6917, 9227, 13873, 16183, 18493, 23087, 25423, 27733, 30013, 30047, 60077, 90073

Offset: 1

Daniel D Gibson, Nov 14 2024

nonn

A060735 can be thought of as multiples of primorials, up to the next prime not found in the given primorial. This sequence adds or subtracts that next prime to produce new prime values.
31 is the first prime this does not produce (other than 2).
143 is the first nonprime value that this pattern produces (other than values < 3).
Conjectured to be infinite.

			23 is a term because 23 = 2*3*5 - 7 and it is prime.
67 is a term because 67 = 2*2*3*5 + 7 and it is prime.

Cf. A060735, subset of A000040, superset of A367182, superset of A038708.

rad(n) = factorback(factorint(n)[, 1]);
lista(nn) = my(a=1, list = List()); for (n=2, nn, my(f = factor(a), p = if (a==1, 2, nextprime(vecmax(f[,1])+1))); if (isprime(a-p), listput(list, a-p)); if (isprime(a+p), listput(list, a+p)); a = a + rad(a);); vecsort(Set(list)); \\ Michel Marcus, Dec 14 2024

(not in order) primorial(i) * m +- prime(i+1) where 0

A002110 Primorial numbers (first definition): product of first n primes. Sometimes written prime(n)#.

Original entry on oeis.org

1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810, 304250263527210, 13082761331670030, 614889782588491410, 32589158477190044730, 1922760350154212639070, 117288381359406970983270, 7858321551080267055879090

Offset: 0

N. J. A. Sloane and J. H. Conway

See A034386 for the second definition of primorial numbers: product of primes in the range 2 to n.
a(n) is the least number N with n distinct prime factors (i.e., omega(N) = n, cf. A001221). - Lekraj Beedassy, Feb 15 2002
Phi(n)/n is a new minimum for each primorial. - Robert G. Wilson v, Jan 10 2004
Smallest number stroked off n times after the n-th sifting process in an Eratosthenes sieve. - Lekraj Beedassy, Mar 31 2005
Apparently each term is a new minimum for phi(x)*sigma(x)/x^2. 6/Pi^2 < sigma(x)*phi(x)/x^2 < 1 for n > 1. - Jud McCranie, Jun 11 2005
Let f be a multiplicative function with f(p) > f(p^k) > 1 (p prime, k > 1), f(p) > f(q) > 1 (p, q prime, p < q). Then the record maxima of f occur at n# for n >= 1. Similarly, if 0 < f(p) < f(p^k) < 1 (p prime, k > 1), 0 < f(p) < f(q) < 1 (p, q prime, p < q), then the record minima of f occur at n# for n >= 1. - David W. Wilson, Oct 23 2006
Wolfe and Hirshberg give ?, ?, ?, ?, ?, 30030, ?, ... as a puzzle.
Records in number of distinct prime divisors. - Artur Jasinski, Apr 06 2008
For n >= 2, the digital roots of a(n) are multiples of 3. - Parthasarathy Nambi, Aug 19 2009 [with corrections by Zak Seidov, Aug 30 2015]
Denominators of the sum of the ratios of consecutive primes (see A094661). - Vladimir Joseph Stephan Orlovsky, Oct 24 2009
Where record values occur in A001221. - Melinda Trang (mewithlinda(AT)yahoo.com), Apr 15 2010
It can be proved that there are at least T prime numbers less than N, where the recursive function T is: T = N - N*Sum_{i = 0..T(sqrt(N))} A005867(i)/A002110(i). This can show for example that at least 0.16*N numbers are primes less than N for 29^2 > N > 23^2. - Ben Paul Thurston, Aug 23 2010
The above comment from Parthasarathy Nambi follows from the observation that digit summing produces a congruent number mod 9, so the digital root of any multiple of 3 is a multiple of 3. prime(n)# is divisible by 3 for n >= 2. - Christian Schulz, Oct 30 2013
The peaks (i.e., local maximums) in a graph of the number of repetitions (i.e., the tally of values) vs. value, as generated by taking the differences of all distinct pairs of odd prime numbers within a contiguous range occur at regular periodic intervals given by the primorial numbers 6 and greater. Larger primorials yield larger (relative) peaks, however the range must be >50% larger than the primorial to be easily observed. Secondary peaks occur at intervals of those "near-primorials" divisible by 6 (e.g., 42). See A259629. Also, periodicity at intervals of 6 and 30 can be observed in the local peaks of all possible sums of two, three or more distinct odd primes within modest contiguous ranges starting from p(2) = 3. - Richard R. Forberg, Jul 01 2015
If a number k and a(n) are coprime and k < (prime(n+1))^b < a(n), where b is an integer, then k has fewer than b prime factors, counting multiplicity (i.e., bigomega(k) < b, cf. A001222). - Isaac Saffold, Dec 03 2017
If n > 0, then a(n) has 2^n unitary divisors (A034444), and a(n) is a record; i.e., if k < a(n) then k has fewer unitary divisors than a(n) has. - Clark Kimberling, Jun 26 2018
Unitary superabundant numbers: numbers k with a record value of the unitary abundancy index, A034448(k)/k > A034448(m)/m for all m < k. - Amiram Eldar, Apr 20 2019
Psi(n)/n is a new maximum for each primorial (psi = A001615) [proof in link: Patrick Sole and Michel Planat, proposition 1 page 2]; compare with comment 2004: Phi(n)/n is a new minimum for each primorial. - Bernard Schott, May 21 2020
The term "primorial" was coined by Harvey Dubner (1987). - Amiram Eldar, Apr 16 2021
a(n)^(1/n) is approximately (n log n)/e. - Charles R Greathouse IV, Jan 03 2023
Subsequence of A267124. - Frank M Jackson, Apr 14 2023

			a(9) = 23# = 2*3*5*7*11*13*17*19*23 = 223092870 divides the difference 5283234035979900 in the arithmetic progression of 26 primes A204189. - _Jonathan Sondow_, Jan 15 2012

A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 50.
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, Cambridge, University Press, 1940, p. 49.
P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 4.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 114.
D. Wolfe and S. Hirshberg, Underspecified puzzles, in Tribute to A Mathemagician, Peters, 2005, pp. 73-74.

Alex Ermolaev, Table of n, a(n) for n = 0..350 (terms up to a(100) from T. D. Noe)
Iskander Aliev, Jesús De Loera, Fritz Eisenbrand, Timm Oertel, and Robert Weismantel, The Support of Integer Optimal Solutions, arXiv:1712.08923 [math.OC], 2017.
C. K. Caldwell, The Prime Glossary, Primorial.
Geoffrey Caveney, J.-L. Nicolas and J. Sondow, On SA, CA, and GA numbers, arXiv:1112.6010 [math.NT], 2011-2012; Ramanujan J., 29 (2012), 359-384.
Harvey Dubner, Factorial and primorial primes, J. Rec. Math., Vol. 19, No. 3 (1987), pp. 197-203. (Annotated scanned copy)
F. Ellermann, Illustration for A002110, A005867, A038110, A060753.
S. W. Golomb, The evidence for Fortune's conjecture, Math. Mag. 54 (1981), 209-210.
D. J. Greenhoe, MRA-Wavelet subspace architecture for logic, probability, and symbolic sequence processing, 2014.
Daniel J. Greenhoe, Frames and Bases: Structure and Design, Version 0.20, Signal Processing ABCs series (2019) Vol. 4, pp. 7, 81.
Daniel J. Greenhoe, A Book Concerning Transforms, Version 0.10, Signal Processing ABCs series (2019) Vol. 5, see page 7.
A. W. Lin and S. Zhou, A linear-time algorithm for the orbit problem over cyclic groups, preprint, CONCUR 2014 - Concurrency Theory, Volume 8704 of the series Lecture Notes in Computer Science pp. 327-341.
A. W. Lin and S. Zhou, A linear-time algorithm for the orbit problem over cyclic groups, CONCUR 2014 - Concurrency Theory, Lecture Notes in Computer Science, Volume 8704, 2014, pp. 327-341.
F. E. Masat, Letter to N. J. A. Sloane with attachment: "A note on prime number sequences" (unpublished manuscript), Apr. 1991.
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv:1202.3670 [math.HO], 2012.
Thomas Morrill, Further Development of "Non-Pythagorean" Musical Scales Based on Logarithms, arXiv:1804.08067 [math.HO], 2018.
J.-L. Nicolas, Petites valeurs de la fonction d'Euler, J. Number Theory 17, no.3 (1983), 375-388.
Patrick Sole and Michel Planat, The Robin inequality for 7-free integers, INTEGERS, 2011, #A65.
Andrew V. Sutherland, Order Computations in Generic Groups, Ph. D. Dissertation, Math. Dept., M.I.T., 2007.
G. Villemin's Almanach of Numbers, Primorielle.
Eric Weisstein's World of Mathematics, Primorial.
Robert G. Wilson v, Letter to N. J. A. Sloane, Jan. 1994.
Index to divisibility sequences
Index entries for "core" sequences
Index entries for sequences related to primorial base
Index entries for sequences related to primorial numbers

A034386 gives the second version of the primorial numbers.
Subsequence of A005117 and of A064807. Apart from the first term, a subsequence of A083207.
Cf. A001615, A002182, A002201, A003418, A005235, A006862, A034444 (unitary divisors), A034448, A034387, A033188, A035345, A035346, A036691 (compositorial numbers), A049345 (primorial base representation), A057588, A060735 (and integer multiples), A061742 (squares), A072938, A079266, A087315, A094348, A106037, A121572, A053589, A064648, A132120, A260188.
Cf. A061720 (first differences), A143293 (partial sums).
Cf. also A276085, A276086.
The following fractions are all related to each other: Sum 1/n: A001008/A002805, Sum 1/prime(n): A024451/A002110 and A106830/A034386, Sum 1/nonprime(n): A282511/A282512, Sum 1/composite(n): A250133/A296358.

a002110 n = product $ take n a000040_list
a002110_list = scanl (*) 1 a000040_list
-- Reinhard Zumkeller, Feb 19 2012, May 03 2011

[1] cat [&*[NthPrime(i): i in [1..n]]: n in [1..20]]; // Bruno Berselli, Oct 24 2012

[1] cat [&*PrimesUpTo(p): p in PrimesUpTo(60)]; // Bruno Berselli, Feb 08 2015

A002110 := n -> mul(ithprime(i),i=1..n);

FoldList[Times, 1, Prime[Range[20]]]
primorial[n_] := Product[Prime[i], {i, n}]; Array[primorial,20] (* José María Grau Ribas, Feb 15 2010 *)
Join[{1}, Denominator[Accumulate[1/Prime[Range[20]]]]] (* Harvey P. Dale, Apr 11 2012 *)

a(n)=prod(i=1,n, prime(i)) \\ Washington Bomfim, Sep 23 2008

p=1; for (n=0, 100, if (n, p*=prime(n)); write("b002110.txt", n, " ", p) )  \\ Harry J. Smith, Nov 13 2009

a(n) = factorback(primes(n)) \\ David A. Corneth, May 06 2018

from sympy import primorial
def a(n): return 1 if n < 1 else primorial(n)
[a(n) for n in range(51)]  # Indranil Ghosh, Mar 29 2017

[sloane.A002110(n) for n in (1..20)] # Giuseppe Coppoletta, Dec 05 2014

; with memoization-macro definec
(definec (A002110 n) (if (zero? n) 1 (* (A000040 n) (A002110 (- n 1))))) ;; Antti Karttunen, Aug 30 2016

Asymptotic expression for a(n): exp((1 + o(1)) * n * log(n)) where o(1) is the "little o" notation. - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Apr 08 2001
a(n) = A054842(A002275(n)).
Binomial transform = A136104: (1, 3, 11, 55, 375, 3731, ...). Equals binomial transform of A121572: (1, 1, 3, 17, 119, 1509, ...). - Gary W. Adamson, Dec 14 2007
a(0) = 1, a(n+1) = prime(n)*a(n). - Juri-Stepan Gerasimov, Oct 15 2010
a(n) = Product_{i=1..n} A000040(i). - Jonathan Vos Post, Jul 17 2008
a(A051838(n)) = A116536(n) * A007504(A051838(n)). - Reinhard Zumkeller, Oct 03 2011
A000005(a(n)) = 2^n. - Carlos Eduardo Olivieri, Jun 16 2015
a(n) = A035345(n) - A005235(n) for n > 0. - Jonathan Sondow, Dec 02 2015
For all n >= 0, a(n) = A276085(A000040(n+1)), a(n+1) = A276086(A143293(n)). - Antti Karttunen, Aug 30 2016
A054841(a(n)) = A002275(n). - Michael De Vlieger, Aug 31 2016
a(n) = A270592(2*n+2) - A270592(2*n+1) if 0 <= n <= 4 (conjectured for all n by Alon Kellner). - Jonathan Sondow, Mar 25 2018
Sum_{n>=1} 1/a(n) = A064648. - Amiram Eldar, Oct 16 2020
Sum_{n>=1} (-1)^(n+1)/a(n) = A132120. - Amiram Eldar, Apr 12 2021
Theta being Chebyshev's theta function, a(0) = exp(theta(1)), and for n > 0, a(n) = exp(theta(m)) for A000040(n) <= m < A000040(n+1) where m is an integer. - Miles Englezou, Nov 26 2024

A007947 Largest squarefree number dividing n: the squarefree kernel of n, rad(n), radical of n.

Original entry on oeis.org

1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 2, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38, 77, 78

Offset: 1

R. Muller, Mar 15 1996

Multiplicative with a(p^e) = p.
Product of the distinct prime factors of n.
a(k)=k for k=squarefree numbers A005117. - Lekraj Beedassy, Sep 05 2006
A note on square roots of numbers: we can write sqrt(n) = b*sqrt(c) where c is squarefree. Then b = A000188(n) is the "inner square root" of n, c = A007913(n), b*c = A019554(n) = "outer square root" of n, and a(n) = lcm(a(b),c). Unless n is biquadrateful (A046101), a(n) = lcm(b,c). [Edited by Jeppe Stig Nielsen, Oct 10 2021, and Andrey Zabolotskiy, Feb 12 2025]
a(n) = A128651(A129132(n-1) + 2) for n > 1. - Reinhard Zumkeller, Mar 30 2007
Also the least common multiple of the prime factors of n. - Peter Luschny, Mar 22 2011
The Mobius transform of the sequence generates the sequence of absolute values of A097945. - R. J. Mathar, Apr 04 2011
Appears to be the period length of k^n mod n. For example, n^12 mod 12 has period 6, repeating 1,4,9,4,1,0, so a(12)= 6. - Gary Detlefs, Apr 14 2013
a(n) differs from A014963(n) when n is a term of A024619. - Eric Desbiaux, Mar 24 2014
a(n) is also the smallest base (also termed radix) for which the representation of 1/n is of finite length.  For example a(12) = 6 and 1/12 in base 6 is 0.03, which is of finite length. - Lee A. Newberg, Jul 27 2016
a(n) is also the divisor k of n such that d(k) = 2^omega(n). a(n) is also the smallest divisor u of n such that n divides u^n. - Juri-Stepan Gerasimov, Apr 06 2017

			G.f. = x + 2*x^2 + 3*x^3 + 2*x^4 + 5*x^5 + 6*x^6 + 7*x^7 + 2*x^8 + 3*x^9 + ... - _Michael Somos_, Jul 15 2018

Daniel Forgues, Table of n, a(n) for n = 1..100000 (first 10000 terms from T. D. Noe)
Masum Billal, Divisible Sequence and its Characteristic Sequence, arXiv:1501.00609 [math.NT], 2015, theorem 11 page 5.
Henry Bottomley, Some Smarandache-type multiplicative sequences
Steven R. Finch, Unitarism and Infinitarism, February 25, 2004. [Cached copy, with permission of the author]
Jarosław Grytczuk, Thue type problems for graphs, points and numbers, Discrete Math., 308 (2008), 4419-4429.
Neville Holmes, Integer Sequences [Broken link]
Serge Lang, Old and New Conjectured Diophantine Inequalities, Bull. Amer. Math. Soc., 23 (1990), 37-75. see p. 39.
Wolfdieter Lang, Cantor's List of Real Algebraic Numbers of Heights 1 to 7, arXiv:2307.10645 [math.NT], 2023.
D. H. Lehmer, Euler constants for arithmetical progressions, Collection of articles in memory of Juriĭ Vladimirovič Linnik. Acta Arith. 27 (1975), 125--142. MR0369233 (51 #5468). See N_k on page 131.
Ivar Peterson, The Amazing ABC Conjecture
Paul Tarau, Emulating Primality with Multiset Representations of Natural Numbers, in Theoretical Aspects of Computing, ICTAC 2011, Lecture Notes in Computer Science, 2011, Volume 6916/2011, 218-238
Paul Tarau, Towards a generic view of primality through multiset decompositions of natural numbers, Theoretical Computer Science, Volume 537, 5 June 2014, Pages 105-124.
Wikipedia, Radical of an integer.

See A007913, A062953, A000188, A019554, A003557, A066503, A087207 for other properties related to square and squarefree divisors of n.
More general factorization-related properties, specific to n: A020639, A028234, A020500, A010051, A284318, A000005, A001221, A005361, A034444, A014963, A128651, A267116.
Range of values is A005117.
Cf. A048803, A019565, A024619, A053462, A060735, A073355 (partial sums), A079277, A097945, A129132, A225546.
Bisections: A099984, A099985.
Sequences about numbers that have the same squarefree kernel: A065642, array A284311 (A284457).
A003961, A059896 are used to express relationship between terms of this sequence.
Cf. A001615, A008683, A076479, A078615.

a007947 = product . a027748_row  -- Reinhard Zumkeller, Feb 27 2012

[ &*PrimeDivisors(n): n in [1..100] ]; // Klaus Brockhaus, Dec 04 2008

with(numtheory); A007947 := proc(n) local i,t1,t2; t1 := ifactors(n)[2]; t2 := mul(t1[i][1],i=1..nops(t1)); end;
A007947 := n -> ilcm(op(numtheory[factorset](n))):
seq(A007947(i),i=1..69); # Peter Luschny, Mar 22 2011
A:= n -> convert(numtheory:-factorset(n),`*`):
seq(A(n),n=1..100); # Robert Israel, Aug 10 2014
seq(NumberTheory:-Radical(n), n = 1..78); # Peter Luschny, Jul 20 2021

rad[n_] := Times @@ (First@# & /@ FactorInteger@ n); Array[rad, 78] (* Robert G. Wilson v, Aug 29 2012 *)
Table[Last[Select[Divisors[n],SquareFreeQ]],{n,100}] (* Harvey P. Dale, Jul 14 2014 *)
a[ n_] := If[ n < 1, 0, Sum[ EulerPhi[d] Abs @ MoebiusMu[d], {d, Divisors[ n]}]]; (* Michael Somos, Jul 15 2018 *)
Table[Product[p, {p, Select[Divisors[n], PrimeQ]}], {n, 1, 100}] (* Vaclav Kotesovec, May 20 2020 *)

a(n) = factorback(factorint(n)[,1]); \\ Andrew Lelechenko, May 09 2014

for(n=1, 100, print1(direuler(p=2, n, (1 + p*X - X)/(1 - X))[n], ", ")) \\ Vaclav Kotesovec, Jun 14 2020

from sympy import primefactors, prod
def a(n): return 1 if n < 2 else prod(primefactors(n))
[a(n) for n in range(1, 51)]  # Indranil Ghosh, Apr 16 2017

def A007947(n): return mul(p for p in prime_divisors(n))
[A007947(n) for n in (1..60)] # Peter Luschny, Mar 07 2017

(define (A007947 n) (if (= 1 n) n (* (A020639 n) (A007947 (A028234 n))))) ;; ;; Needs also code from A020639 and A028234. - Antti Karttunen, Jun 18 2017

If n = Product_j (p_j^k_j) where p_j are distinct primes, then a(n) = Product_j (p_j).
a(n) = Product_{k=1..A001221(n)} A027748(n,k). - Reinhard Zumkeller, Aug 27 2011
Dirichlet g.f.: zeta(s)*Product_{primes p} (1+p^(1-s)-p^(-s)). - R. J. Mathar, Jan 21 2012
a(n) = Sum_{d|n} phi(d) * mu(d)^2 = Sum_{d|n} |A097945(d)|. - Enrique Pérez Herrero, Apr 23 2012
a(n) = Product_{d|n} d^moebius(n/d) (see Billal link). - Michel Marcus, Jan 06 2015
a(n) = n/( Sum_{k=1..n} (floor(k^n/n)-floor((k^n - 1)/n)) ) = e^(Sum_{k=2..n} (floor(n/k) - floor((n-1)/k))*A010051(k)*M(k)) where M(n) is the Mangoldt function. - Anthony Browne, Jun 17 2016
a(n) = n/A003557(n). - Juri-Stepan Gerasimov, Apr 07 2017
G.f.: Sum_{k>=1} phi(k)*mu(k)^2*x^k/(1 - x^k). - Ilya Gutkovskiy, Apr 11 2017
From Antti Karttunen, Jun 18 2017: (Start)
a(1) = 1; for n > 1, a(n) = A020639(n) * a(A028234(n)).
a(n) = A019565(A087207(n)). (End)
Dirichlet g.f.: zeta(s-1) * zeta(s) * Product_{primes p} (1 + p^(1-2*s) - p^(2-2*s) - p^(-s)). - Vaclav Kotesovec, Dec 18 2019
From Peter Munn, Jan 01 2020: (Start)
a(A059896(n,k)) = A059896(a(n), a(k)).
a(A003961(n)) = A003961(a(n)).
a(n^2) = a(n).
a(A225546(n)) = A019565(A267116(n)). (End)
Sum_{k=1..n} a(k) ~ c * n^2, where c = A065463/2. - Vaclav Kotesovec, Jun 24 2020
From Richard L. Ollerton, May 07 2021: (Start)
a(n) = Sum_{k=1..n} mu(n/gcd(n,k))^2.
a(n) = Sum_{k=1..n} mu(gcd(n,k))^2*phi(gcd(n,k))/phi(n/gcd(n,k)).
For n>1, Sum_{k=1..n} a(gcd(n,k))*mu(a(gcd(n,k)))*phi(gcd(n,k))/gcd(n,k) = 0.
For n>1, Sum_{k=1..n} a(n/gcd(n,k))*mu(a(n/gcd(n,k)))*phi(gcd(n,k))*gcd(n,k) = 0. (End)
a(n) = (-1)^omega(n) * Sum_{d|n} mu(d)*psi(d), where omega = A001221 and psi = A001615. - Ridouane Oudra, Aug 01 2025

More terms from several people including David W. Wilson

Definition expanded by Jonathan Sondow, Apr 26 2013

A267263 Number of nonzero digits in representation of n in primorial base.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 3, 4, 1, 2

Offset: 0

Cade Brown, Jan 12 2016

			a(3) = 2 because 3 written in primorial base is 11 with 2 nonzero digits.

Cf. A001221, A002110, A049345, A235168, A276086.
Cf. A060735 (positions of ones).
A060130 is an analogous sequence for the factorial base, from which this differs for the first time at n=30, where a(30) = 1, while A060130(30) = 2.

a:= proc(n) local m, p, r; m, p, r:= n, 2, 0;
       while m>0 do r:= r+`if`(irem(m, p, 'm')>0, 1, 0);
                    p:= nextprime(p)
       od; r
    end:
seq(a(n), n=0..100);  # Alois P. Heinz, Jan 15 2016

Table[Length[IntegerDigits[n, MixedRadix@ Prime@ Reverse@ Range@ PrimePi@ n] /. 0 -> Nothing], {n, 0, 120}] (* Michael De Vlieger, Jan 12 2016, Version 10.2 *)
f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], Times @@ Prime@ Range[# - i]]], {i, 0, #}] &@ NestWhile[# + 1 &, 0, Times @@ Prime@ Range[# + 1] <= n &]; Rest[a][[All, 1]]]; Table[Count[f@ n, d_ /; d > 0], {n, 0, 73}] (* Michael De Vlieger, Aug 29 2016 *)

cnz(n) = my(d = digits(n)); sum(k=1, #d, d[k]!=0);
A049345(n, p=2) = if(nA049345(n\p, nextprime(p+1))*10 + n%p)
a(n) = cnz(A049345(n)); \\ Michel Marcus, Jan 12 2016

a(n)=my(s); forprime(p=2,, if(n%p, s++, if(n==0, return(s))); n\=p) \\ Charles R Greathouse IV, Nov 17 2016

a(n) = A001221(A276086(n)). - Antti Karttunen, Aug 21 2016

A351228 Numbers k for which A003415(k) >= A276086(k), where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.

Original entry on oeis.org

6, 30, 32, 36, 60, 210, 212, 213, 214, 216, 240, 420, 2310, 2312, 2313, 2314, 2315, 2316, 2317, 2318, 2319, 2320, 2322, 2324, 2328, 2340, 2342, 2343, 2344, 2346, 2348, 2349, 2352, 2370, 2372, 2376, 2400, 2520, 2522, 2523, 2524, 2526, 2528, 2550, 2552, 2730, 4620, 4622, 4623, 4624, 4626, 4628, 4632, 4650, 4652, 4656

Offset: 1

Antti Karttunen, Feb 05 2022

Conjecture: Apart from the initial 6, the rest of terms are the numbers k for which A003415(k) > A276086(k), thus giving the positions of zeros in A351232. In other words, it seems that only k=6 satisfies A003415(k) = A276086(k). See also comments in A351088.

Antti Karttunen, Table of n, a(n) for n = 1..11643 (terms up to 3*A002110(9))
Victor Ufnarovski and Bo Åhlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003, #03.3.4.
Index entries for sequences related to primorial base

Cf. A003415, A024451, A048103, A060735, A235991, A276085, A276086, A327862, A351088, A351089, A351232, A369656, A369663, A369664, A371104.
Union of A370127 and A370128.
Subsequence of A328118.
Subsequences: A351229, A369959, A369960, A369970 (after its two initial terms).
Cf. also A369650.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
isA351228(n) = (A003415(n)>=A276086(n));

A147576 Numbers with exactly 3 distinct odd prime divisors {3,5,7}.

Original entry on oeis.org

105, 315, 525, 735, 945, 1575, 2205, 2625, 2835, 3675, 4725, 5145, 6615, 7875, 8505, 11025, 13125, 14175, 15435, 18375, 19845, 23625, 25515, 25725, 33075, 36015, 39375, 42525, 46305, 55125, 59535, 65625, 70875, 76545, 77175, 91875, 99225

Offset: 1

Artur Jasinski, Nov 07 2008

nonn

Numbers k such that phi(k)/k = m
( Family of sequences for successive n odd primes )
m=2/3 numbers with exactly 1 distinct prime divisor {3} see A000244
m=8/15 numbers with exactly 2 distinct prime divisors {3,5} see A033849
m=16/35 numbers with exactly 3 distinct prime divisors {3,5,7} see A147576
m=32/77 numbers with exactly 4 distinct prime divisors {3,5,7,11} see A147577
m=384/1001 numbers with exactly 5 distinct prime divisors {3,5,7,11,13} see A147578
m=6144/17017 numbers with exactly 6 distinct prime divisors {3,5,7,11,13,17} see A147579
m=3072/323323 numbers with exactly 7 distinct prime divisors {3,5,7,11,13,17,19} see A147580
m=110592/323323 numbers with exactly 8 distinct prime divisors {3,5,7,11,13,17,19,23} see A147581

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..100 from Harvey P. Dale)

Cf. A060735, A108347, A143207, A147571-A147575, A147576-A147580.

a = {}; Do[If[EulerPhi[x]/x == 16/35, AppendTo[a, x]], {x, 1, 100000}]; a
Select[Range[100000],EulerPhi[#]/#==16/35&] (* Harvey P. Dale, Dec 01 2013 *)

a(n) = 105 * A108347(n). - Amiram Eldar, Mar 10 2020

Sum_{n>=1} 1/a(n) = 1/48. - Amiram Eldar, Dec 22 2020

A147580 Numbers with exactly 7 distinct odd prime divisors {3,5,7,11,13,17,19}.

Original entry on oeis.org

4849845, 14549535, 24249225, 33948915, 43648605, 53348295, 63047985, 72747675, 82447365, 92147055, 101846745, 121246125, 130945815, 160044885, 169744575, 189143955, 218243025, 237642405, 247342095, 266741475, 276441165, 305540235, 315239925, 363738375, 373438065

Offset: 1

Artur Jasinski, Nov 07 2008

nonn

Numbers k such that phi(k)/k = m
( Family of sequences for successive n odd primes )
m=2/3 numbers with exactly 1 distinct prime divisor {3} see A000244
m=8/15 numbers with exactly 2 distinct prime divisors {3,5} see A033849
m=16/35 numbers with exactly 3 distinct prime divisors {3,5,7} see A147576
m=32/77 numbers with exactly 4 distinct prime divisors {3,5,7,11} see A147577
m=384/1001 numbers with exactly 5 distinct prime divisors {3,5,7,11,13} see A147578
m=6144/17017 numbers with exactly 6 distinct prime divisors {3,5,7,11,13,17} see A147579
m=3072/323323 numbers with exactly 7 distinct prime divisors {3,5,7,11,13,17,19} see A147580
m=110592/323323 numbers with exactly 8 distinct prime divisors {3,5,7,11,13,17,19,23} see A147581

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

Cf. A060735, A143207, A147571-A147575, A147576-A147580.

a = {}; Do[If[EulerPhi[4849845 x] == 1658880 x, AppendTo[a, 4849845 x]], {x, 1, 100}]; a

Sum_{n>=1} 1/a(n) = 1/1658880. - Amiram Eldar, Dec 22 2020

More terms from Amiram Eldar, Mar 11 2020

A147575 Numbers with exactly 8 distinct prime divisors {2,3,5,7,11,13,17,19}.

Original entry on oeis.org

9699690, 19399380, 29099070, 38798760, 48498450, 58198140, 67897830, 77597520, 87297210, 96996900, 106696590, 116396280, 126095970, 135795660, 145495350, 155195040, 164894730, 174594420, 184294110, 193993800, 203693490, 213393180, 232792560, 242492250, 252191940

Offset: 1

Artur Jasinski, Nov 07 2008

nonn

Successive numbers k such that EulerPhi(x)/x = m:
( Family of sequences for successive n primes )
m=1/2 numbers with exactly 1 distinct prime divisor {2} see A000079
m=1/3 numbers with exactly 2 distinct prime divisors {2,3} see A033845
m=4/15 numbers with exactly 3 distinct prime divisors {2,3,5} see A143207
m=8/35 numbers with exactly 4 distinct prime divisors {2,3,5,7} see A147571
m=16/77 numbers with exactly 5 distinct prime divisors {2,3,5,7,11} see A147572
m=192/1001 numbers with exactly 6 distinct prime divisors {2,3,5,7,11,13} see A147573
m=3072/17017 numbers with exactly 7 distinct prime divisors {2,3,5,7,11,13,17} see A147574
m=55296/323323 numbers with exactly 8 distinct prime divisors {2,3,5,7,11,13,17,19} see A147575

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

Cf. A060735, A080682, A143207, A147571-A147575, A147576-A147580.

a = {}; Do[If[EulerPhi[9699690 x] == 1658880 x, AppendTo[a, 9699690 x]], {x, 1, 100}]; a

a(n) = 9699690 * A080682(n). - Amiram Eldar, Mar 10 2020

Sum_{n>=1} 1/a(n) = 1/1658880. - Amiram Eldar, Nov 12 2020

More terms from Amiram Eldar, Mar 10 2020

Showing 1-10 of 50 results. Next

A060735(n) belongs to A168264 if and only if a(n) belongs to A168267.

Looking at A060735 as an irregular triangle T(n,k) = k*A002110(n) with 1 <= k < prime(n+1), this sequence a(n) = k. - Michael De Vlieger, Jul 26 2016

After a(9), all terms are congruent to +-1 (mod 30).

More generally, for any primorial P (cf. A002110), all terms >= P-1 are congruent to +/- 1 (mod P).- This sequence is essentially the same as A087715. - M. F. Hasler, Jul 27 2015

cp's OEIS Frontend

A168265 a(n) = A003557(A060735(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A257658 Primes of the form A060735(k) +- 1, where A060735 lists multiples of primorials (A002110) less than the next larger primorial.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A378018 Primes p which can be written as p = (A060735(k) +- next largest prime factor not in A060735(k)) for some k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A002110 Primorial numbers (first definition): product of first n primes. Sometimes written prime(n)#.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Sage

Scheme

Formula

A007947 Largest squarefree number dividing n: the squarefree kernel of n, rad(n), radical of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Scheme

Formula

Extensions

A267263 Number of nonzero digits in representation of n in primorial base.

Views

Author

Keywords

Examples

Links