A085056 -id:A085056 - cp's OEIS frontend

A246465 Triangle read by rows: T(n,k) = A085056(n)/(A085056(k) * A085056(n-k)).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 2, 4, 4, 4, 1, 1, 3, 12, 12, 6, 6, 12, 12, 3, 1, 1, 1, 3, 12, 6, 6, 6, 12, 3, 1, 1, 1, 1, 1, 3, 6, 6, 6, 6, 3, 1, 1, 1, 1, 2, 2, 2, 3, 12, 12

Offset: 0

Tom Edgar, Aug 27 2014

We assume that A085056(0)=1 since it would be the empty product.

These are the generalized binomial coefficients associated with the sequence A003557.

			The first five terms in A003557 are: 1, 1, 1, 2, 1 and so T(4,2) = 2*1*1*1/((1*1)*(1*1))=2 and T(5,4) = 1*2*1*1*1/((2*1*1*1)*(1))=1.
The triangle begins:
1,
1, 1,
1, 1, 1,
1, 1, 1, 1,
1, 2, 2, 2, 1,
1, 1, 2, 2, 1, 1,
1, 1, 1, 2, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1,
1, 4, 4, 4, 2, 4, 4, 4, 1,
1, 3, 12, 12, 6, 6, 12, 12, 3, 1.

Tom Edgar, Totienomial Coefficients, INTEGERS, 14 (2014), #A62.
Tom Edgar and Michael Z. Spivey, Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6.
Donald E. Knuth and Herbert S. Wilf, The power of a prime that divides a generalized binomial coefficient, J. Reine Angew. Math., 396:212-219, 1989.

Cf. A003557, A085056, A048804.

q=100 #change q for more rows
P=[0]+[n/prod([x for x in prime_divisors(n)]) for n in [1..q]]
[[prod(P[1:n+1])/(prod(P[1:k+1])*prod(P[1:(n-k)+1])) for k in [0..n]] for n in [0..len(P)-1]] # generates the triangle up to q rows.

T(n,k) = A085056(n)/(A085056(k) * A085056(n-k)).
T(n,k) = prod_{i=1..n} A003557(i)/(prod_{i=1..k} A003557(i)*prod_{i=1..n-k} A003557(i)).
T(n,k) = A003557(n)/n*(k/A003557(k)*T(n-1,k-1)+(n-k)/A003557(n-k)*T(n-1,k)).

A003557 n divided by largest squarefree divisor of n; if n = Product p(k)^e(k) then a(n) = Product p(k)^(e(k)-1), with a(1) = 1.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 5, 1, 9, 2, 1, 1, 1, 16, 1, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 1, 8, 7, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, 2, 1, 1, 3, 32, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 5, 2, 1, 1, 1, 8, 27, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 16, 1, 7

Offset: 1

Marc LeBrun

a(n) is the size of the Frattini subgroup of the cyclic group C_n - Ahmed Fares (ahmedfares(AT)my-deja.com), Jun 07 2001.
Also of the Frattini subgroup of the dihedral group with 2*n elements. - Sharon Sela (sharonsela(AT)hotmail.com), Jan 01 2002
Number of solutions to x^m==0 (mod n) provided that n < 2^(m+1), i.e. the sequence of sequences A000188, A000189, A000190, etc. converges to this sequence. - Henry Bottomley, Sep 18 2001
a(n) is the number of nilpotent elements in the ring Z/nZ. - Laszlo Toth, May 22 2009
The sequence of partial products of a(n) is A085056(n). - Peter Luschny, Jun 29 2009
The first occurrence of n in this sequence is at A064549(n). - Franklin T. Adams-Watters, Jul 25 2014
From Hal M. Switkay, Jul 03 2025: (Start)
For n > 1, a(n) is a proper divisor of n. Thus the sequence n, a(n), a(a(n)), ... eventually becomes 1. This yields a minimal factorization of n as a product of squarefree numbers (A005117), each factor dividing all larger factors, in a factorization that is conjugate to the minimal factorization of n as a product of prime powers (A000961), as follows.
Let f(n,0) = n, and let f(n,k) = a(f(n,k-1)) for k > 0. A051903(n) is the minimal value of k such that f(n,k) = 1. A051903(n) <= log(n)/log(2). Since n/a(n) = A007947(n) is always squarefree by definition, n is a product of squarefree factors in the form Product_{i=1..A051903(n)} [f(n,i-1)/f(n,i)].
The two factorizations correspond to conjugate partitions of bigomega(n) = A001222(n). (End)

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Henry Bottomley, Some Smarandache-type multiplicative sequences.
Steven R. Finch, Idempotents and Nilpotents Modulo n, arXiv:math/0605019 [math.NT], 2006-2017.

Cf. A007947, A062378, A062379, A064549, A300717 (Möbius transform), A326306 (inv. Möbius transf.), A328572.
Sequences that are multiples of this sequence (the other factor of a pointwise product is given in parentheses): A000010 (A173557), A000027 (A007947), A001615 (A048250), A003415 (A342001), A007434 (A345052), A057521 (A071773).
Cf. A082695 (Dgf at s=2), A065487 (Dgf at s=3).
Cf. A000961, A001222, A005117, A051903.

a003557 n = product $ zipWith (^)
                      (a027748_row n) (map (subtract 1) $ a124010_row n)
-- Reinhard Zumkeller, Dec 20 2013

using Nemo
function A003557(n)
    n < 4 && return 1
    q = prod([p for (p, e) ∈ Nemo.factor(fmpz(n))])
    return n == q ? 1 : div(n, q)
end
[A003557(n) for n in 1:90] |> println  # Peter Luschny, Feb 07 2021

[(&+[(Floor(k^n/n)-Floor((k^n-1)/n)): k in [1..n]]): n in [1..100]]; // G. C. Greubel, Nov 02 2018

A003557 := n -> n/ilcm(op(numtheory[factorset](n))):
seq(A003557(n), n=1..98); # Peter Luschny, Mar 23 2011
seq(n / NumberTheory:-Radical(n), n = 1..98); # Peter Luschny, Jul 20 2021

Prepend[ Array[ #/Times@@(First[ Transpose[ FactorInteger[ # ] ] ])&, 100, 2 ], 1 ] (* Olivier Gérard, Apr 10 1997 *)

a(n)=n/factorback(factor(n)[,1]) \\ Charles R Greathouse IV, Nov 17 2014

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

from sympy.ntheory.factor_ import core
from sympy import divisors
def a(n): return n / max(i for i in divisors(n) if core(i) == i)
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Apr 16 2017

from math import prod
from sympy import primefactors
def A003557(n): return n//prod(primefactors(n)) # Chai Wah Wu, Nov 04 2022

def A003557(n) : return n*mul(1/p for p in prime_divisors(n))
[A003557(n) for n in (1..98)] # Peter Luschny, Jun 10 2012

Multiplicative with a(p^e) = p^(e-1). - Vladeta Jovovic, Jul 23 2001
a(n) = n/rad(n) = n/A007947(n) = sqrt(J_2(n)/J_2(rad(n))), where J_2(n) is A007434. - Enrique Pérez Herrero, Aug 31 2010
a(n) = (J_k(n)/J_k(rad(n)))^(1/k), where J_k is the k-th Jordan Totient Function: (J_2 is A007434 and J_3 A059376). - Enrique Pérez Herrero, Sep 03 2010
Dirichlet convolution of A000027 and A097945. - R. J. Mathar, Dec 20 2011
a(n) = A000010(n)/|A023900(n)|. - Eric Desbiaux, Nov 15 2013
a(n) = Product_{k = 1..A001221(n)} (A027748(n,k)^(A124010(n,k)-1)). - Reinhard Zumkeller, Dec 20 2013
a(n) = Sum_{k=1..n}(floor(k^n/n)-floor((k^n-1)/n)). - Anthony Browne, May 11 2016
a(n) = e^[Sum_{k=2..n} (floor(n/k)-floor((n-1)/k))*(1-A010051(k))*Mangoldt(k)] where Mangoldt is the Mangoldt function. - Anthony Browne, Jun 16 2016
a(n) = Sum_{d|n} mu(d) * phi(d) * (n/d), where mu(d) is the Moebius function and phi(d) is the Euler totient function (rephrases formula of Dec 2011). - Daniel Suteu, Jun 19 2018
G.f.: Sum_{k>=1} mu(k)*phi(k)*x^k/(1 - x^k)^2. - Ilya Gutkovskiy, Nov 02 2018
Dirichlet g.f.: Product_{primes p} (1 + 1/(p^s - p)). - Vaclav Kotesovec, Jun 24 2020
From Richard L. Ollerton, May 07 2021: (Start)
a(n) = Sum_{k=1..n} mu(n/gcd(n,k))*gcd(n,k).
a(n) = Sum_{k=1..n} mu(gcd(n,k))*(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
a(n) = A001615(n)/A048250(n) = A003415/A342001(n) = A057521(n)/A071773(n). - Antti Karttunen, Jun 08 2021

Secondary definition added to the name by Antti Karttunen, Jun 08 2021

A048803 a(n) = Product_{k=1..n} rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947.

Original entry on oeis.org

1, 1, 2, 6, 12, 60, 360, 2520, 5040, 15120, 151200, 1663200, 9979200, 129729600, 1816214400, 27243216000, 54486432000, 926269344000, 5557616064000, 105594705216000, 1055947052160000, 22174888095360000, 487847538097920000, 11220493376252160000, 67322960257512960000

Offset: 0

Christian G. Bower, Apr 15 1999

Squarefree factorials: a(1) = 1, a(n+1) = a(n)* largest squarefree divisor of (n+1). - Amarnath Murthy, Nov 28 2004
LCM over all partitions of n of the product of the part sizes in the partition. - Franklin T. Adams-Watters, May 04 2010
a(n) is the product of the lcm of the set of prime factors of k over the range k = 1..n. - Peter Luschny, Jun 10 2011
a(n) is a divisor of n! and n!/a(n) = A085056(n). - Robert FERREOL, Aug 09 2021
In consequence of the definition, pseudo-binomial coefficients a(m+n)/(a(m)*a(n)) are natural numbers for all whole numbers m and n, and this is the minimal increasing sequence (for n >= 1) with that property. In consequence of the comment of Adams-Watters, the corresponding pseudo-multinomial coefficients are natural numbers as well. - Hal M. Switkay, May 26 2024

Paul-Jean Cahen and Jean-Luc Chabert, Integer-valued Polynomials, AMS, Providence, RI, 1997. Math. Rev. 98a:13002. See p. 246.

Reinhard Zumkeller, Table of n, a(n) for n = 0..500
Abdelmalek Bedhouche and Bakir Farhi, On some products taken over the prime numbers, arXiv:2207.07957 [math.NT], 2022. See rho_n p. 3.
Bakir Farhi, On the derivatives of the integer-valued polynomials, arXiv:1810.07560 [math.NT], 2018.
Index entries for sequences related to lcm's

Partial products of A007947.

a048803 n = a048803_list !! n
a048803_list = scanl (*) 1 a007947_list
-- Reinhard Zumkeller, Jul 01 2013

A048803 := proc(n) local i; mul(ilcm(op(numtheory[factorset](i))), i=1..n) end; seq(A048803(i),i=0..22); # Peter Luschny, Jun 10 2011
a := n -> mul(NumberTheory:-Radical(i), i=1..n): # Peter Luschny, Mar 14 2022

a[0] = 1; a[n_] := a[n] = a[n-1] First @ Select[Reverse @ Divisors[n], SquareFreeQ, 1]; Array[a,22,0] (* Jean-François Alcover, May 04 2011 *)
A048803[n_] := Times @@ ResourceFunction["IntegerRadical"][Range[1, n]];
Table[A048803[n], {n, 0, 24}]  (* Peter Luschny, Aug 18 2025 *)

a(n)=local(f); f=n>=0; if(n>1, forprime(p=2,n,f*=p^(n\p))); f

from functools import cache
@cache
def a_rec(n):
    if n == 0: return 1
    return radical(n) * a_rec(n - 1)
print([a_rec(n) for n in range(23)]) # Peter Luschny, Dec 12 2023

a(0) = 1, a(1) = 1; for n > 1, a(n) = lcm( 1, 2, ..., n, a(1)*a(n-1), a(2)*a(n-2), ..., a(n-1)*a(1) ). [Original name.]
a(n) = Product_{p prime} p^floor(n/p). See Farhi link p. 16. - Michel Marcus, Oct 18 2018
For n >=1, a(n) = lcm(1^floor(n/1),2^floor(n/2),...,n^floor(n/n)). - Robert FERREOL, Aug 05 2021
Rephrasing Murthy's comment: a(n) = a(n-1) * A007947(n). - Hal M. Switkay, Dec 31 2024

Entry improved by comments from Michael Somos, Nov 24 2001

New name based on a comment of Amarnath Murthy by Peter Luschny, Aug 18 2025

A084744 Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.

Original entry on oeis.org

1, 2, 8, 24, 48, 384, 1152, 2304, 9216, 46080, 414720, 829440, 13271040, 79626240, 318504960, 637009920, 1911029760, 15288238080, 107017666560, 535088332800, 1070176665600, 9631589990400, 38526359961600, 77052719923200

Offset: 1

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 26 2003

nonn

More precisely the denominator equals the product of the largest squarefree divisors of composite numbers up to n.

			a(4) = (1*4*6*8*9)/((2)*(2*3)*(2)*(3)) = 24.

Cf. A085056.

A084744 := proc(n) sort(convert(convert(A085056(n),set),list)) end: # Peter Luschny, Jun 29 2009

PrimeFactors[ n_Integer ] := Flatten[ Table[ # [ [ 1 ] ], {1} ] & /@ FactorInteger[ n ] ]; a[ 1 ] := 1; a[ n_ ] := a[ n ] = a[ n - 1 ]*n / Times @@ PrimeFactors[ n ]; Union[ Table[ a[ n ], {n, 1, 63} ] ]

a(1)=1, a(n) = a(n-1)*n/(n's prime factors).

Edited and extended by Robert G. Wilson v, Jun 27 2003

cp's OEIS Frontend

A246465 Triangle read by rows: T(n,k) = A085056(n)/(A085056(k) * A085056(n-k)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Sage

Formula

A003557 n divided by largest squarefree divisor of n; if n = Product p(k)^e(k) then a(n) = Product p(k)^(e(k)-1), with a(1) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Julia

Magma

Maple

Mathematica

PARI

PARI

Python

Python

Sage

Formula

Extensions

A048803 a(n) = Product_{k=1..n} rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A084744 Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions