A034836 -id:A034836 - cp's OEIS frontend

A122179 Number of ways to write n as n = xyz with 1

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

Offset: 1

Rick L. Shepherd, Aug 23 2006

nonn

x,y,z are proper factors of n. a(n) > 0 iff n is a term of A033942; a(n) = 0 iff n is a term of A037143.

			a(24) = 2 because 24 = 2*2*6 = 2*3*4, two products of three proper factors of 24.

Seiichi Manyama, Table of n, a(n) for n = 1..8192 (terms 1..2048 from Antti Karttunen)

Cf. A034836, A033942, A037143, A088432, A088433, A088434, A122180.

for(n=1,105, t=0; for(x=2,n-1, for(y=x,n-1, for(z=y,n-1, if(x*y*z==n, t++)))); print1(t,", "))

A122179(n) = { my(s=0); fordiv(n, x, if((x>1)&&(xAntti Karttunen, Aug 24 2017

A218320 Number of ways to write n as n = abc*d with 1 <= a <= b <= c <= d <= n.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 2, 5, 1, 4, 1, 4, 2, 2, 1, 7, 2, 2, 3, 4, 1, 5, 1, 6, 2, 2, 2, 9, 1, 2, 2, 7, 1, 5, 1, 4, 4, 2, 1, 11, 2, 4, 2, 4, 1, 7, 2, 7, 2, 2, 1, 11, 1, 2, 4, 9, 2, 5, 1, 4, 2, 5, 1, 15, 1, 2, 4, 4, 2, 5, 1, 11, 5, 2, 1, 11, 2

Offset: 1

Michel Lagneau, Oct 25 2012

nonn

Starts the same as, but is different from A001055. First values of n such that a(n) differs from A001055(n) are 32, 48, 64, 72, 80, ... .

The value of a is the same for all numbers n with the same prime signature. For prime p we have a(p^n) = A001400(n), the number of partitions of n into at most 4 parts. - Alois P. Heinz, Nov 03 2012

			a(12) = 4 because we can write 12 = 1*1*1*12 = 1*1*2*6 = 1*1*3*4 = 1*2*2*3.

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Cf. A001055, A034836.

for n from 1 to 90 do:t1:=0: for a from 1 to n do: for b from a to n do :for c from b to n do : for d from c to n do :if a*b*c*d = n then t1:=t1+1: else fi: od: od: od: od:printf(`%d, `,t1):od:
# second Maple program
with(numtheory):
b:= proc(n, i, t) option remember;
      `if`(n=1, 1, `if`(t=1, `if`(n<=i, 1, 0),
       add(b(n/d, d, t-1), d=select(x->x<=i, divisors(n)))))
    end:
a:= proc(n) local l, m;
      l:= sort(ifactors(n)[2], (x, y)-> x[2]>y[2]);
      m:= mul(ithprime(i)^l[i][2], i=1..nops(l));
      b(m, m, 4)
    end:
seq(a(n), n=1..100);  # Alois P. Heinz, Nov 03 2012

b[n_, i_, t_] := b[n, i, t] = If[n==1, 1, If[t==1, If[n <= i, 1, 0], Sum[b[n/d, d, t-1], {d, Select[Divisors[n], # <= i&]}]]];
a[n_] := (l = Sort[FactorInteger[n], #1[[2]] > #2[[2]]&]; m = Times @@ Power @@@ l; b[m, m, 4]);
Array[a, 100] (* Jean-François Alcover, Mar 22 2017, after Alois P. Heinz *)

A061202 (tau<=)_4(n).

Original entry on oeis.org

1, 5, 9, 19, 23, 39, 43, 63, 73, 89, 93, 133, 137, 153, 169, 204, 208, 248, 252, 292, 308, 324, 328, 408, 418, 434, 454, 494, 498, 562, 566, 622, 638, 654, 670, 770, 774, 790, 806, 886, 890, 954, 958, 998, 1038, 1054, 1058, 1198, 1208, 1248, 1264, 1304, 1308

Offset: 1

Vladeta Jovovic, Apr 21 2001

(tau<=)_k(n) = |{(x_1,x_2,...,x_k): x_1*x_2*...*x_k <= n}|, i.e., (tau<=)_k(n) is number of solutions to x_1*x_2*...*x_k <= n, x_i > 0.
Partial sums of A007426.
Equals row sums of triangle A140703. - Gary W. Adamson, May 24 2008

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
Vaclav Kotesovec, Graph - The asymptotic ratio (1000000 terms)
Eric Weisstein's World of Mathematics, Stieltjes Constants
Wikipedia, Stieltjes constants

Cf. tau_2(n): A000005, tau_3(n): A007425, tau_4(n): A007426, tau_5(n): A061200, tau_6(n): A034695, (unordered) 2-factorizations of n: A038548, (unordered) 3-factorizations of n: A034836, A001055, (tau<=)_2(n): A006218, (tau<=)_3(n): A061201, (tau<=)_5(n): A061203, (tau<=)_6(n): A061204.
Equals left column of triangle A140705.
Cf. A140703.

(* Asymptotics: *) n * (Log[n]^3/6 + (2*EulerGamma - 1/2)*Log[n]^2 + (6*EulerGamma^2 - 4*EulerGamma - 4*StieltjesGamma[1] + 1)*Log[n] + 4*EulerGamma^3 - 6*EulerGamma^2 + 4*EulerGamma + 4*StieltjesGamma[1]*(1 - 3*EulerGamma) + 2*StieltjesGamma[2] - 1) (* Vaclav Kotesovec, Sep 09 2018 *)

(tau<=)k(n) = Sum{i=1..n} tau_k(i).
a(n) = Sum_{k = 1..n} tau_{3}(k)*floor (n/k), where tau_{3} is A007425. - Enrique Pérez Herrero, Jan 23 2013
a(n) ~ n * (log(n)^3/6 + (2*g - 1/2)*log(n)^2 + (6*g^2 - 4*g - 4*g1 + 1)*log(n) + 4*g^3 - 6*g^2 + 4*g + 4*g1*(1 - 3*g) + 2*g2 - 1), where g is the Euler-Mascheroni constant A001620, g1 and g2 are the Stieltjes constants, see A082633 and A086279. - Vaclav Kotesovec, Sep 09 2018
a(n) = Sum_{i=1..n} tau(i)*A006218(floor(n/i)). - Ridouane Oudra, Sep 17 2021
a(n) = Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} floor(n/(i*j*k)). - Ridouane Oudra, Oct 31 2022

A140773 Consider the products of all pairs of (not necessarily distinct) positive divisors of n. a(n) is the number of these products that divide n. a(n) also is the number of the products that are divisible by n.

Original entry on oeis.org

1, 2, 2, 4, 2, 5, 2, 6, 4, 5, 2, 10, 2, 5, 5, 9, 2, 10, 2, 10, 5, 5, 2, 16, 4, 5, 6, 10, 2, 14, 2, 12, 5, 5, 5, 20, 2, 5, 5, 16, 2, 14, 2, 10, 10, 5, 2, 24, 4, 10, 5, 10, 2, 16, 5, 16, 5, 5, 2, 28, 2, 5, 10, 16, 5, 14, 2, 10, 5, 14, 2, 32, 2, 5, 10, 10, 5, 14, 2, 24, 9, 5, 2, 28, 5, 5, 5, 16, 2, 28, 5

Offset: 1

Leroy Quet, May 29 2008

nonn

Number of 3D grids of n congruent boxes with two different edge lengths, in a box, modulo rotation (cf. A034836 for cubes instead of boxes and A007425 for boxes with three different edge lengths; cf. A000005 for the 2D case). - Manfred Boergens, Feb 25 2021

Number of distinct faces obtainable by arranging n unit cubes into a cuboid. - Chris W. Milson, Mar 14 2021

			The divisors of 20 are 1,2,4,5,10,20. There are 10 pairs of divisors whose product divides 20: 1*1=1, 1*2=2, 1*4=4, 1*5=5, 1*10=10, 1*20=20, 2*2=4, 2*5=10, 2*10=20, 4*5 = 20. Likewise, there are 10 products that are divisible by 20: 4*5=20, 2*10=20, 4*10=40, 10*10=100, 1*20=20, 2*20=40, 4*20=80, 5*20=100, 10*20=200, 20*20=400. So a(20) = 10.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Chris W. Milson, Constructing Cuboids
Chris W. Milson, A faster algorithm for a(n)

Cf. A140774.
Cf. A000005, A034836, A038548, A007425, A046951.
Cf. A369255 (parity), A369256 (positions of odd terms), A378213 (Dirichlet inverse).

(* first do *) Needs["Combinatorica`"] (* then *) f[n_] := Count[ n/Times @@@ Union[Sort /@ Tuples[Divisors@ n, 2]], Integer]; Array[f, 91] (* _Robert G. Wilson v, May 31 2008 *)
d=Divisors[n]; r=Length[d]; Sum[Ceiling[Length[Divisors[d[[j]]]]/2],{j,r}] (* Manfred Boergens, Feb 25 2021 *)

\\ Two implementations, after the two different interpretations given by the author of the sequence:
A140773v1(n) = { my(ds = divisors(n),s=0); for(i=1,#ds,for(j=i,#ds,if(!(n%(ds[i]*ds[j])),s=s+1))); s; }
A140773v2(n) = { my(ds = divisors(n),s=0); for(i=1,#ds,for(j=i,#ds,if(!((ds[i]*ds[j])%n),s=s+1))); s; }
\\ Antti Karttunen, May 19 2017

Python
```
# See C. W. Milson link.
```

a(n) = Sum_{m|n} A038548(m) = Sum_{m|n} ceiling(d(m)/2), where d(m) = number of divisors of m (A000005). - Manfred Boergens, Feb 25 2021
a(n) = Sum_{d|n} A135539(d,n/d). - Ridouane Oudra, Jul 10 2021
a(n) = (A007425(n) + A046951(n))/2. - Ridouane Oudra, Apr 10 2024
G.f.: Sum_{k>=1} Sum_{d|k} x^(k^2/d)/(1 - x^k). - Miles Wilson, Jun 12 2025

Corrected and extended by Robert G. Wilson v, May 31 2008

A122180 Number of ways to write n as n = xyz with 1 < x < y < z < n.

Original entry on oeis.org

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

Offset: 1

Rick L. Shepherd, Aug 23 2006

nonn

x,y,z are distinct proper factors of n. See A122181 for n such that a(n) > 0.

If n has at most five divisors then a(n) = 0. - David A. Corneth, Oct 24 2024

			a(48) = 2 because 48 = 2*3*8 = 2*4*6, two products of three distinct proper factors of 48.

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1001 terms from Antti Karttunen)
Index entries for sequences computed from exponents in factorization of n

Cf. A034836, A088432, A088433, A088434, A122179, A122181, A200214.

for(n=1,105, t=0; for(x=2,n-1, for(y=x+1,n-1, for(z=y+1,n-1, if(x*y*z==n, t++)))); print1(t,", "))

A122180(n) = { my(s=0); fordiv(n, x, if((x>1)&&(xAntti Karttunen, Jul 08 2017

a(n) = {
	my(d = divisors(n));
	if(#d <= 5, return(0));
	my(res = 0, q);
	for(i = 2, #d,
		q = d[#d + 1 - i];
		if(d[i]^2 > q,
			return(res)
		);
		for(j = i + 1, #d,
			qj = q/d[j];
			if(qj <= d[j],
				next(2)
			);
			if(denominator(qj) == 1 && n % qj == 0,
				res++
			);
		);
	);
	res
} \\ David A. Corneth, Oct 24 2024

a(n) = A200214(n)/6. - Antti Karttunen, Jul 08 2017

A061203 (tau<=)_5(n).

Original entry on oeis.org

1, 6, 11, 26, 31, 56, 61, 96, 111, 136, 141, 216, 221, 246, 271, 341, 346, 421, 426, 501, 526, 551, 556, 731, 746, 771, 806, 881, 886, 1011, 1016, 1142, 1167, 1192, 1217, 1442, 1447, 1472, 1497, 1672, 1677, 1802, 1807, 1882, 1957, 1982, 1987, 2337, 2352

Offset: 1

Vladeta Jovovic, Apr 21 2001

(tau<=)_k(n) = |{(x_1,x_2,...,x_k): x_1*x_2*...*x_k <= n}|, i.e., (tau<=)_k(n) is number of solutions to x_1*x_2*...*x_k <= n, x_i > 0.
Partial sums of A061200.
Equals row sums of triangle A140705. - Gary W. Adamson, May 24 2008

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
Vaclav Kotesovec, Graph - The asymptotic ratio (100000 terms)

Cf. tau_2(n): A000005, tau_3(n): A007425, tau_4(n): A007426, tau_5(n): A061200, tau_6(n): A034695, (unordered) 2-factorizations of n: A038548, (unordered) 3-factorizations of n: A034836, A001055, (tau<=)_2(n): A006218, (tau<=)_3(n): A061201, (tau<=)_4(n): A061202, (tau<=)_6(n): A061204.

Cf. A140705.

b:= proc(k, n) option remember; uses numtheory;
     `if`(k=1, 1, add(b(k-1, d), d=divisors(n)))
    end:
a:= proc(n) option remember; `if`(n=0, 0, b(5, n)+a(n-1)) end:
seq(a(n), n=1..49);  # Alois P. Heinz, Feb 13 2022

nmax = 50;
tau4 = Table[DivisorSum[n, DivisorSigma[0, n/#]*DivisorSigma[0, #] &], {n, 1, nmax}];
Accumulate[Table[Sum[tau4[[d]], {d, Divisors[n]}], {n, nmax}]] (* Vaclav Kotesovec, Sep 10 2018 *)

(tau<=)k(n) = Sum{i=1..n} tau_k(i).
a(n) = Sum_{k=1..n} tau_{4}(k) * floor(n/k), where tau_{4} is A007426. - Enrique Pérez Herrero, Jan 23 2013
a(n) ~ n*(log(n)^4/24 + (5*g/6 - 1/6)*log(n)^3 + 10*g1^2 + (5*g^2 - 5*g/2 - 5*g1/2 + 1/2)*log(n)^2 + (10*g^3 - 10*g^2 + (5 - 20*g1)*g + 5*g1 + 5*g2/2 - 1)*log(n) + 5*g^4 - 10*g^3 + (10 - 30*g1)*g^2 + (20*g1 + 10*g2 - 5)*g - 5*g1 - 5*g2/2 - 5*g3/6 + 1), where g is the Euler-Mascheroni constant A001620 and g1, g2, g3 are the Stieltjes constants, see A082633, A086279 and A086280. - Vaclav Kotesovec, Sep 10 2018

A061204 (tau<=)_6(n).

Original entry on oeis.org

1, 7, 13, 34, 40, 76, 82, 138, 159, 195, 201, 327, 333, 369, 405, 531, 537, 663, 669, 795, 831, 867, 873, 1209, 1230, 1266, 1322, 1448, 1454, 1670, 1676, 1928, 1964, 2000, 2036, 2477, 2483, 2519, 2555, 2891, 2897, 3113, 3119, 3245, 3371, 3407, 3413

Offset: 1

Vladeta Jovovic, Apr 21 2001

(tau<=)_k(n) = |{(x_1,x_2,...,x_k): x_1*x_2*...*x_k<=n}|, i.e. (tau<=)_k(n) is number of solutions to x_1*x_2*...*x_k<=n, x_i>0.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
Vaclav Kotesovec, Graph - The asymptotic ratio (100000 terms)

Cf. tau_2(n): A000005, tau_3(n): A007425, tau_4(n): A007426, tau_5(n): A061200, tau_6(n): A034695, (unordered) 2-factorizations of n: A038548, (unordered) 3-factorizations of n: A034836, A001055, (tau<=)_2(n): A006218, (tau<=)_3(n): A061201, (tau<=)_4(n): A061202, (tau<=)_5(n): A061203.

nmax = 50; tau4 = Table[DivisorSum[n, DivisorSigma[0, n/#]*DivisorSigma[0, #] &], {n, 1, nmax}]; tau5 = Table[Sum[tau4[[d]], {d, Divisors[n]}], {n, nmax}]; Accumulate[Table[Sum[tau5[[d]], {d, Divisors[n]}], {n, nmax}]] (* Vaclav Kotesovec, Sep 10 2018 *)

(tau<=)k(n)=Sum{i=1..n} tau_k(i). a(n)=partial sums of A034695.
a(n) = Sum_{k=1..n} tau_{5}(k) * floor(n/k), where tau_{5} is A061200. - Enrique Pérez Herrero, Jan 23 2013
a(n) ~ n*(log(n)^5/120 + (g/4 - 1/24)*log(n)^4 + (5*g^2/2 - g - g1 + 1/6)*log(n)^3 + (10*g^3 - 15*g^2/2 + (3 - 15*g1)*g + 3*g1 + 3*g2/2 - 1/2)*log(n)^2 + (15*g^4 - 20*g^3 + (15 - 60*g1)*g^2 + (30*g1 + 15*g2 - 6)*g + 15*g1^2 - 6*g1 - 3*g2 - g3 + 1)*log(n) + 6*g^5 - 15*g^4 + (20 - 60*g1)*g^3 + (60*g1 + 30*g2 - 15)*g^2 + (60*g1^2 - 30*g1 - 15*g2 - 5*g3 + 6)*g - 15*g1^2 + g1*(6 - 15*g2) + 3*g2 + g3 + g4/4 - 1), where g is the Euler-Mascheroni constant A001620 and g1, g2, g3, g4 are the Stieltjes constants, see A082633, A086279, A086280 and A086281. - Vaclav Kotesovec, Sep 10 2018

A088434 Number of ways to write n as n = uvw with 1 <= u < v < w.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 4, 0, 1, 1, 2, 0, 4, 0, 2, 1, 1, 1, 4, 0, 1, 1, 4, 0, 4, 0, 2, 2, 1, 0, 6, 0, 2, 1, 2, 0, 4, 1, 4, 1, 1, 0, 8, 0, 1, 2, 3, 1, 4, 0, 2, 1, 4, 0, 8, 0, 1, 2, 2, 1, 4, 0, 6, 1, 1, 0, 8, 1, 1, 1, 4, 0, 8, 1, 2, 1, 1, 1, 9, 0, 2, 2, 4, 0, 4, 0, 4, 4, 1, 0, 8, 0, 4, 1, 6, 0, 4, 1, 2, 2, 1, 1, 14

Offset: 1

Reinhard Zumkeller, Oct 01 2003

nonn

a(n)=0 iff n=1 or n prime or n prime^2: a(A000430(n)) = 0.

The integers a(n)+1 equal A045778(n) for n < 120 and differ at all n that admit factorization into 4 or more distinct factors, the smallest ones being n = 120 = 2*3*4*5, n = 144 = 2*3*4*6, n = 168 = 2*3*4*7, n = 180 = 2*3*5*6, ..., later continuing n = 312 = 2*3*4*13, n = 320 = 2*4*5*8, n = 324 = 2*3*6*9, n = 330 = 2*3*5*11, ... Coincidentally, A068350(5) to A068350(19) start this list. - R. J. Mathar, Jul 19 2007

			n=12: (1,2,6), (1,3,4): therefore a(12)=2;
n=18: (1,2,9), (1,3,6): therefore a(18)=2.

Antti Karttunen and Michael De Vlieger, Table of n, a(n) for n = 1..10000 (first 2048 terms from Antti Karttunen.)
Michael De Vlieger, Records and first positions of records in A088434.

Cf. A034836, A088432, A088433, A122179, A122180.

Table[Length[Select[Cases[Subsets[Divisors[n],{3}],{x_,y_,z_}->x*y*z],#==n &]],{n,102}] (* Jayanta Basu, May 23 2013 *)

A088434(n) = { my(s=0); fordiv(n, u, for(v=u+1, n-1, for(w=v+1, n, if(u*v*w==n, s++)))); (s); }; \\ Antti Karttunen, Aug 24 2017

Data section extended to 120 terms by Antti Karttunen, Aug 24 2017

A088432 Number of ways to write n as n = uvw with 1 <= u < v <= w.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 2, 0, 1, 1, 2, 0, 3, 0, 2, 1, 1, 0, 4, 1, 1, 1, 2, 0, 4, 0, 3, 1, 1, 1, 5, 0, 1, 1, 4, 0, 4, 0, 2, 2, 1, 0, 7, 1, 3, 1, 2, 0, 4, 1, 4, 1, 1, 0, 8, 0, 1, 2, 4, 1, 4, 0, 2, 1, 4, 0, 9, 0, 1, 3, 2, 1, 4, 0, 6, 2, 1, 0, 8, 1, 1, 1, 4, 0, 8, 1, 2, 1, 1, 1, 9, 0, 3, 2, 6, 0, 4, 0, 4, 4, 1, 0, 9, 0, 4, 1, 6, 0, 4, 1, 2, 2, 1, 1, 14

Offset: 1

Reinhard Zumkeller, Oct 01 2003

nonn

			n=12: (1,2,6), (1,3,4): therefore a(12)=2;
n=18: (1,2,9), (1,3,6), (2,3,3): therefore a(18)=3.
For n = p*q, p < q primes:  n = 1 * p * q, so a(n) = 1.
For n = p^2, p prime: n = 1 * p * p, so a(n) = 1.
For n = p^3, p prime: n = 1 * p * p^2, so a(n) = 1.
For n = p*q^2, p < q < p^2: n = 1 * p * pq = 1* q * p^2, so a(n) = 2 (see n=12).
For n = p*q^2, p < p^2 < q: n = 1 * p * pq = 1 * p^2 * q, so a(n) = 2
For n = p^4, p prime: n = 1 * p * p^3 = 1 * p^2 * p^2, so a(n) = 2.

Antti Karttunen, Table of n, a(n) for n = 1..3003

Cf. A034836, A088433, A088434, A122179, A122180, A323644.

a[n_] := Module[{s = 0}, Do[Do[Do[If[u v w == n, s++], {w, v, n}], {v, u + 1, n - 1}], {u, Divisors[n]}]; s];
Array[a, 120] (* Jean-François Alcover, Dec 10 2021, after Antti Karttunen *)

A088432(n) = { my(s=0); fordiv(n, u, for(v=u+1, n-1, for(w=v, n, if(u*v*w==n, s++)))); (s); }; \\ Antti Karttunen, Aug 24 2017

a(n) = 0 iff n=1 or n is prime: a(A008578(n)) = 0, a(A002808(n)) > 0.
a(n) = 1 iff n has 3 or 4 divisors (A323644) (see examples). - Bernard Schott, Dec 13 2021
a(n) = 2 if n = p^2*q, pA096156) or n = p^4 (A030514) (see examples). - Bernard Schott, Dec 16 2021

Data section extended to 120 terms by Antti Karttunen, Aug 24 2017

A088433 Number of ways to write n as n = uvw with 1<=u<=v

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 4, 2, 2, 1, 6, 1, 2, 2, 4, 1, 5, 1, 4, 2, 2, 2, 7, 1, 2, 2, 6, 1, 5, 1, 4, 4, 2, 1, 8, 1, 3, 2, 4, 1, 6, 2, 6, 2, 2, 1, 10, 1, 2, 4, 5, 2, 5, 1, 4, 2, 5, 1, 11, 1, 2, 3, 4, 2, 5, 1, 9, 3, 2, 1, 10, 2, 2, 2, 6, 1, 10, 2, 4, 2, 2, 2, 12, 1, 3, 4, 6

Offset: 1

Reinhard Zumkeller, Oct 01 2003

nonn

a(n) = 1 iff n prime or n prime^2: a(A000430(n))=1.

			n=12: (1,1,12), (1,2,6), (1,3,4), (2,2,3): therefore a(12)=4;
n=18: (1,1,18), (1,2,9), (1,3,6): therefore a(18)=3.

Antti Karttunen, Table of n, a(n) for n = 1..2048

Cf. A034836, A088432, A088434, A122179, A122180.

A088433(n) = { my(s=0); fordiv(n, u, for(v=u, n-1, for(w=v+1, n, if(u*v*w==n, s++)))); (s); }; \\ Antti Karttunen, Aug 24 2017

cp's OEIS Frontend

A122179 Number of ways to write n as n = x*y*z with 1

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

A218320 Number of ways to write n as n = a*b*c*d with 1 <= a <= b <= c <= d <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A061202 (tau<=)_4(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A140773 Consider the products of all pairs of (not necessarily distinct) positive divisors of n. a(n) is the number of these products that divide n. a(n) also is the number of the products that are divisible by n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A122180 Number of ways to write n as n = x*y*z with 1 < x < y < z < n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

PARI

Formula

A061203 (tau<=)_5(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A061204 (tau<=)_6(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A122179 Number of ways to write n as n = xyz with 1

A218320 Number of ways to write n as n = abc*d with 1 <= a <= b <= c <= d <= n.

A122180 Number of ways to write n as n = xyz with 1 < x < y < z < n.

A088434 Number of ways to write n as n = uvw with 1 <= u < v < w.

A088432 Number of ways to write n as n = uvw with 1 <= u < v <= w.

A088433 Number of ways to write n as n = uvw with 1<=u<=v