A169594 -id:A169594 - cp's OEIS frontend

A342530 Number of strict chains of divisors ending with n and having distinct first quotients.

1, 2, 2, 3, 2, 6, 2, 6, 3, 6, 2, 12, 2, 6, 6, 9, 2, 12, 2, 12, 6, 6, 2, 28, 3, 6, 6, 12, 2, 26, 2, 14, 6, 6, 6, 31, 2, 6, 6, 28, 2, 26, 2, 12, 12, 6, 2, 52, 3, 12, 6, 12, 2, 28, 6, 28, 6, 6, 2, 66, 2, 6, 12, 25, 6, 26, 2, 12, 6, 26, 2, 76, 2, 6, 12, 12, 6, 26

Offset: 1

Gus Wiseman, Mar 25 2021

nonn

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the quotients of (6,3,1) are (1/2,1/3).

			The a(1) = 1 through a(12) = 12 chains (reversed):
  1  2    3    4    5    6      7    8      9    10      11    12
     2/1  3/1  4/1  5/1  6/1    7/1  8/1    9/1  10/1    11/1  12/1
               4/2       6/2         8/2    9/3  10/2          12/2
                         6/3         8/4         10/5          12/3
                         6/2/1       8/2/1       10/2/1        12/4
                         6/3/1       8/4/1       10/5/1        12/6
                                                               12/2/1
                                                               12/3/1
                                                               12/4/1
                                                               12/4/2
                                                               12/6/1
                                                               12/6/2
Not counted under a(12) are: 12/4/2/1, 12/6/2/1, 12/6/3, 12/6/3/1.

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version for weakly increasing first quotients is A057567.
The version for equal first quotients is A169594.
The case of chains starting with 1 is A254578.
The version for strictly increasing first quotients is A342086.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A067824 counts strict chains of divisors ending with n.
A167865 counts strict chains of divisors > 1 summing to n.
A253249 counts strict chains of divisors.
A334997 counts chains of divisors of n by length.
A342495/A342529 count compositions with equal/distinct quotients.
A342496/A342514 count partitions with equal/distinct quotients.
A342515/A342520 count strict partitions with equal/distinct quotients.
A342522/A342521 rank partitions with equal/distinct quotients.
Cf. A000009, A003238, A003242, A122651, A179254, A318991, A318992, A325545.

cmi[n_]:=Prepend[Prepend[#,n]&/@Join@@cmi/@Most[Divisors[n]],{n}];
Table[Length[Select[cmi[n],UnsameQ@@Divide@@@Partition[#,2,1]&]],{n,100}]

a(n) = Sum_{d|n} A254578(d). - Ridouane Oudra, Jun 17 2025

A342521 Heinz numbers of integer partitions with distinct first quotients.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 82

Offset: 1

Gus Wiseman, Mar 23 2021

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

			The prime indices of 1365 are {2,3,4,6}, with first quotients (3/2,4/3,3/2), so 1365 is not in the sequence.
Most small numbers are in the sequence, but the sequence of non-terms together with their prime indices begins:
    8: {1,1,1}
   16: {1,1,1,1}
   24: {1,1,1,2}
   27: {2,2,2}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   40: {1,1,1,3}
   42: {1,2,4}
   48: {1,1,1,1,2}
   54: {1,2,2,2}
   56: {1,1,1,4}
   64: {1,1,1,1,1,1}
   72: {1,1,1,2,2}
   80: {1,1,1,1,3}
   81: {2,2,2,2}
   84: {1,1,2,4}
   88: {1,1,1,5}
   96: {1,1,1,1,1,2}
  100: {1,1,3,3}

Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

For multiplicities (prime signature) instead of quotients we have A130091.
For differences instead of quotients we have A325368 (count: A325325).
These partitions are counted by A342514 (strict: A342520, ordered: A342529).
The equal instead of distinct version is A342522.
The version counting strict divisor chains is A342530.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A167865 counts strict chains of divisors > 1 summing to n.
A318991/A318992 rank reversed partitions with/without integer quotients.
Cf. A003242, A005117, A056239, A067824, A098859, A112798, A169594, A253249, A325326, A325337, A325405.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],UnsameQ@@Divide@@@Reverse/@Partition[primeptn[#],2,1]&]

A342524 Heinz numbers of integer partitions with strictly increasing first quotients.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 51, 52, 53, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 71, 73, 74, 76, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91

Offset: 1

Gus Wiseman, Mar 23 2021

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

			The prime indices of 84 are {1,1,2,4}, with first quotients (1,2,2), so 84 is not in the sequence.
Most small numbers are in the sequence, but the sequence of non-terms together with their prime indices begins:
    8: {1,1,1}
   16: {1,1,1,1}
   18: {1,2,2}
   24: {1,1,1,2}
   27: {2,2,2}
   30: {1,2,3}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   40: {1,1,1,3}
   42: {1,2,4}
   48: {1,1,1,1,2}
   50: {1,3,3}
   54: {1,2,2,2}
   56: {1,1,1,4}
   60: {1,1,2,3}
   64: {1,1,1,1,1,1}

Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

For differences instead of quotients we have A325456 (count: A240027).
For multiplicities (prime signature) instead of quotients we have A334965.
The version counting strict divisor chains is A342086.
These partitions are counted by A342498 (strict: A342517, ordered: A342493).
The weakly increasing version is A342523.
The strictly decreasing version is A342525.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A167865 counts strict chains of divisors > 1 summing to n.
A318991/A318992 rank reversed partitions with/without integer quotients.
A342098 counts (strict) partitions with all adjacent parts x > 2y.
Cf. A048767, A056239, A112798, A124010, A130091, A169594, A253249, A325351, A325352, A334997, A342530.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],Less@@Divide@@@Reverse/@Partition[primeptn[#],2,1]&]

A342525 Heinz numbers of integer partitions with strictly decreasing first quotients.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 21, 22, 23, 25, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 65, 67, 69, 70, 71, 73, 74, 75, 77, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 98

Offset: 1

Gus Wiseman, Mar 23 2021

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the first quotients of (6,3,1) are (1/2,1/3).

			The prime indices of 150 are {1,2,3,3}, with first quotients (2,3/2,1), so 150 is in the sequence.
Most small numbers are in the sequence, but the sequence of non-terms together with their prime indices begins:
    8: {1,1,1}
   12: {1,1,2}
   16: {1,1,1,1}
   20: {1,1,3}
   24: {1,1,1,2}
   27: {2,2,2}
   28: {1,1,4}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   40: {1,1,1,3}
   42: {1,2,4}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}

Eric Weisstein's World of Mathematics, Logarithmically Concave Sequence.
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

For multiplicities (prime signature) instead of quotients we have A304686.
For differences instead of quotients we have A325457 (count: A320470).
The version counting strict divisor chains is A342086.
These partitions are counted by A342499 (strict: A342518, ordered: A342494).
The strictly increasing version is A342524.
The weakly decreasing version is A342526.
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A167865 counts strict chains of divisors > 1 summing to n.
A318991/A318992 rank reversed partitions with/without integer quotients.
A342098 counts (strict) partitions with all adjacent parts x > 2y.
Cf. A056239, A067824, A112798, A124010, A130091, A169594, A253249, A325351, A325352, A325405, A334997, A342530.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],Greater@@Divide@@@Reverse/@Partition[primeptn[#],2,1]&]

A286564 Triangular table A286563 reversed.

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, May 20 2017

See A286563.

			The first fifteen rows of this triangular table:
  1,
  1, 1,
  1, 0, 1,
  1, 0, 2, 1,
  1, 0, 0, 0, 1,
  1, 0, 0, 1, 1, 1,
  1, 0, 0, 0, 0, 0, 1,
  1, 0, 0, 0, 1, 0, 3, 1,
  1, 0, 0, 0, 0, 0, 2, 0, 1,
  1, 0, 0, 0, 0, 1, 0, 0, 1, 1,
  1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 1,
  1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1,
  1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1

Antti Karttunen, Table of n, a(n) for n = 1..7875; the first 125 rows of the triangle

Cf. A286561, A286563.

Cf. A169594 (row sums).

Table[If[k == 1, 1, IntegerExponent[n, k]], {n, 15}, {k, n, 1, -1}] // Flatten (* Michael De Vlieger, May 20 2017 *)

def T(n, k):
    i=1
    if k==1: return 1
    while n%(k**i)==0:
        i+=1
    return i-1
for n in range(1, 21): print([T(n, k) for k in range(1, n + 1)] [::-1]) # Indranil Ghosh, May 20 2017

(define (A286564 n) (A286561bi (A002024 n) (A004736 n))) ;; For A286561bi see A286561.

A178638 a(n) is the number of divisors d of n such that d^k is not equal to n for any k >= 1.

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 2, 1, 3, 1, 5, 1, 3, 3, 2, 1, 5, 1, 5, 3, 3, 1, 7, 1, 3, 2, 5, 1, 7, 1, 4, 3, 3, 3, 7, 1, 3, 3, 7, 1, 7, 1, 5, 5, 3, 1, 9, 1, 5, 3, 5, 1, 7, 3, 7, 3, 3, 1, 11, 1, 3, 5, 3, 3, 7, 1, 5, 3, 7, 1, 11, 1, 3, 5, 5, 3, 7, 1, 9, 2, 3, 1, 11, 3, 3, 3, 7, 1, 11, 3, 5, 3, 3, 3, 11, 1, 5, 5, 7

Offset: 1

Jaroslav Krizek, Dec 25 2010

nonn

			For n = 16, set of such divisors is {1, 8}; a(16) = 2.

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

Cf. A000005, A089723, A169594, A186643, A286561.

Table[DivisorSum[n, 1 &, If[# > 1, #^IntegerExponent[n, #], 1] != n &], {n, 100}] (* Michael De Vlieger, May 27 2017 *)

A286561(n,k) = if(1==k, 1, valuation(n, k));
A178638(n) = sumdiv(n,d,if((d^A286561(n,d))<>n,1,0)); \\ Antti Karttunen, May 26 - 27 2017

a(n) = if(n==1, return(0)); my(f=factor(n), g = f[1, 2]); for(i=2, matsize(f)[1], g=gcd(g, f[i, 2])); numdiv(n) - numdiv(g) \\ David A. Corneth, May 27 2017

a(n) = A000005(n) - A089723(n).

a(1) = 0, a(p) = 1, a(pq) = 3, a(pq...z) = 2^k-1, a(p^k) = k+1-A000005(k), for p, q = primes, k = natural numbers, pq...z = product of k (k > 2) distinct primes p, q, ..., z.

A382944 Table read by rows: T(n, k) = valuation(n, k) for k >= 2, 1 for k = 1 and 0^n for k = 0.

Original entry on oeis.org

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

Offset: 0

Peter Luschny, Apr 09 2025

If a term T(n, k) > 1 is replaced by 1 the triangle reduces to the divisibility triangle A113704. In addition to divisibility, T(n, k) indicates the order of divisibility. For n, k >= 2 this is defined as the multiplicity of a divisor, i.e., the exponent of the highest order of k that divides n. For a prime number p T(n, p) is called p-adic valuation or p-adic order of n. See also the comments in A382883.

			Triangle starts:
  [0] 1;
  [1] 0, 1;
  [2] 0, 1, 1;
  [3] 0, 1, 0, 1;
  [4] 0, 1, 2, 0, 1;
  [5] 0, 1, 0, 0, 0, 1;
  [6] 0, 1, 1, 1, 0, 0, 1;
  [7] 0, 1, 0, 0, 0, 0, 0, 1;
  [8] 0, 1, 3, 0, 1, 0, 0, 0, 1;
  [9] 0, 1, 0, 2, 0, 0, 0, 0, 0, 1;

Cf. A169594 (row sums), A113704, A382881 (inverse), A382883, A057427.

A382944 := proc(n, k) if k = 0 then 0^n elif k = 1 then 1 else padic:-ordp(n, k) fi end: seq(seq(A382944(n, k), k = 0..n), n = 0..12);

T[n_, 0] := T[n, 0] = Boole[n == 0]; T[n_, 1] := T[n, 1] = 1; T[n_, k_] := T[n, k] = IntegerExponent[n, k]; Table[T[n, k], {n, 0, 12}, {k, 0, n}] // Flatten (* Amiram Eldar, Apr 29 2025 *)

@cached_function
def A382944(n: int, k: int) -> int:
    if not ZZ(k).divides(n) or k > n: return 0
    if k == n or k == 1: return 1
    return valuation(n, k)
for n in range(13): print([n], [A382944(n, k) for k in range(n + 1)])

A113704(n, k) = A057427(T(n, k)). - Amiram Eldar, Apr 29 2025

A356242 a(n) is the number of Fermat numbers dividing n, counted with multiplicity.

Original entry on oeis.org

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

Offset: 1

Amiram Eldar, Jul 30 2022

nonn

The multiplicity of a divisor d (not necessarily a prime) of n is defined in A169594 (see also the first formula).
A000244(n) is the least number k such that a(k) = n.
The asymptotic density of occurrences of 0 is 1/2.
The asymptotic density of occurrences of 1 is (1/2) * Sum_{k>=0} 1/(2^(2^k)+1) = (1/2) * A051158 = 0.2980315860... .

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Fermat Number.
Wikipedia, Fermat number.

Cf. A000244, A000215, A007404, A051158, A051179, A169594, A356241.

Cf. A080307 (positions of nonzeros), A080308 (positions of 0's).

f = Table[(2^(2^n) + 1), {n, 0, 5}]; a[n_] := Total[IntegerExponent[n, f]]; Array[a, 100]

a(n) = Sum_{k>=1} v(A000215(k), n), where v(m, n) is the exponent of the largest power of m that divides n.
a(A000215(n)) = 1.
a(A000244(n)) = a(A000351(n)) = a(A001026(n)) = n.
a(A003593(n)) = A112754(n).
a(n) >= A356241(n).
a(A051179(n)) = n.
a(A080307(n)) > 0 and a(A080308(n)) = 0.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=0} 1/(2^(2^k)) = 0.8164215090... (A007404).

A342929 Number of divisors of A025487(n), counting divisor multiplicity in A025487(n).

Original entry on oeis.org

1, 2, 4, 4, 6, 7, 9, 10, 8, 11, 12, 14, 13, 15, 16, 17, 18, 17, 22, 21, 22, 16, 22, 24, 21, 26, 28, 25, 25, 29, 29, 24, 33, 37, 30, 34, 34, 34, 36, 28, 38, 37, 39, 39, 44, 34, 44, 43, 44, 41, 30, 49, 44, 32, 52, 45, 54, 39, 53, 48, 58, 48, 36, 58, 49, 49, 67, 56

Offset: 1

David A. Corneth, Mar 29 2021

nonn

This sequence is the primitive version of A169594.

			a(11) = 12 as A025487(11) = 36 and the divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36 which occur with a multiplicity of 1, 2, 2, 1, 2, 1, 1, 1, 1 respectively (1^m = 1 for all m >= 0). These multiplicities sum to 1 + 1 + 2 + 2 + 1 + 2 + 1 + 1 + 1 + 1 = 12.

David A. Corneth, Table of n, a(n) for n = 1..10000

Cf. A025487, A169594.

a(n) = A309947(n) + 1.

a(n) = A169594(A025487(n)).

cp's OEIS Frontend

A342530 Number of strict chains of divisors ending with n and having distinct first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A342521 Heinz numbers of integer partitions with distinct first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A342524 Heinz numbers of integer partitions with strictly increasing first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A342525 Heinz numbers of integer partitions with strictly decreasing first quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A286564 Triangular table A286563 reversed.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Scheme

A178638 a(n) is the number of divisors d of n such that d^k is not equal to n for any k >= 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A382944 Table read by rows: T(n, k) = valuation(n, k) for k >= 2, 1 for k = 1 and 0^n for k = 0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

SageMath

Formula

A356242 a(n) is the number of Fermat numbers dividing n, counted with multiplicity.

Views