A032741 -id:A032741 - cp's OEIS frontend

A039653 a(0) = 0; for n > 0, a(n) = sigma(n)-1.

0, 0, 2, 3, 6, 5, 11, 7, 14, 12, 17, 11, 27, 13, 23, 23, 30, 17, 38, 19, 41, 31, 35, 23, 59, 30, 41, 39, 55, 29, 71, 31, 62, 47, 53, 47, 90, 37, 59, 55, 89, 41, 95, 43, 83, 77, 71, 47, 123, 56, 92, 71, 97, 53, 119, 71, 119, 79, 89, 59, 167, 61, 95, 103, 126, 83, 143, 67, 125, 95

Offset: 0

David W. Wilson

nonn

Call an integer k between 1 and n a "semi-divisor" of n if n leaves a remainder of 1 when divided by k, i.e., n == 1 (mod k). a(n) gives the sum of the semi-divisors of n+1. - Joseph L. Pe, Sep 11 2002

a(n) is also the sum of the strong divisors of n, for n >= 1. - Omar E. Pol, May 01 2015

Antti Karttunen, Table of n, a(n) for n = 0..10000
OEIS Wiki, Cyclotomic Polynomials at x=n, n! and sigma(n)

Cf. A000203, A039649, A039650, A039651, A039652, A039653, A039654, A039655, A039656, A032741.

[0] cat [DivisorSigma(1, n)-1: n in [1..100]]; // Vincenzo Librandi, May 02 2015

with(numtheory): A039653:=n->sigma(n)-1: (0, seq(A039653(n), n=1..100)); # Wesley Ivan Hurt, Jul 09 2015

Join[{0}, Table[DivisorSigma[1, n] - 1, {n, 90}]] (* Vincenzo Librandi, May 02 2015 *)

A039653(n) = if(!n,n,sigma(n)-1); \\ Antti Karttunen, May 26 2017

from sympy import divisor_sigma
def A039653(n): return divisor_sigma(n)-1 if n else 0 # Chai Wah Wu, Mar 14 2023

a(p) = p for p prime.
G.f.: -2*x^2/(Q(0) - 2*x^2 + 2*x), where Q(k) = (2*x^(k+2) - x - 1)*k - 1 - 2*x + 3*x^(k+2) - x*(k+3)*(k+1)*(1-x^(k+2))^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 16 2013
Let A(x) be the g.f. of A039653 and B(x) the g.f. of A155085. Then B(x) = 1/(1-x) + 1/(1-x)^2 + A(x)/x. - Sergei N. Gladkovskii, May 16 2013

A193829 Irregular triangle read by rows in which row n lists the differences between consecutive divisors of n.

Original entry on oeis.org

1, 2, 1, 2, 4, 1, 1, 3, 6, 1, 2, 4, 2, 6, 1, 3, 5, 10, 1, 1, 1, 2, 6, 12, 1, 5, 7, 2, 2, 10, 1, 2, 4, 8, 16, 1, 1, 3, 3, 9, 18, 1, 2, 1, 5, 10, 2, 4, 14, 1, 9, 11, 22, 1, 1, 1, 2, 2, 4, 12, 4, 20, 1, 11, 13, 2, 6, 18, 1, 2, 3, 7, 14, 28, 1, 1, 2, 1, 4, 5, 15, 30

Offset: 2

Omar E. Pol, Aug 31 2011

The sum of row n gives A000027(n-1). The product of row n gives A057449(n). Row n has length A032741(n). The final term of row n is A060681(n). It appears that the first term of row n is A057237(n).

			Written as a triangle:
1,
2,
1, 2,
4,
1, 1, 3,
6,
1, 2, 4,
2, 6,
1, 3, 5,
10,
1, 1, 1, 2, 6

Alois P. Heinz, Rows n = 2..1600, flattened
Omar E. Pol, Illustration of divisors of n
Wikipedia, Table of divisors

Cf. A027750, A032742.

Cf. A060682 (distinct terms per row), A060680 (row minima), A060681 (row maxima).

import Data.List (genericIndex)
a193829 n k = genericIndex a193829_tabf (n - 1) !! (k - 1)
a193829_row n = genericIndex a193829_tabf (n - 1)
a193829_tabf = zipWith (zipWith (-))
                       (map tail a027750_tabf') a027750_tabf'
-- Reinhard Zumkeller, Jun 25 2015, Jun 23 2013

Flatten[Table[Differences[Divisors[n]], {n, 2, 30}]] (* T. D. Noe, Aug 31 2011 *)

T(n,k) = A027750(n,k+1)-A027750(n,k). - R. J. Mathar, Sep 01 2011

A329746 Triangle read by rows where T(n,k) is the number of integer partitions of n > 0 with runs-resistance k, 0 <= k <= n - 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 0, 1, 3, 4, 3, 0, 0, 1, 1, 4, 8, 1, 0, 0, 1, 3, 6, 10, 2, 0, 0, 0, 1, 2, 8, 13, 6, 0, 0, 0, 0, 1, 3, 11, 20, 7, 0, 0, 0, 0, 0, 1, 1, 11, 29, 14, 0, 0, 0, 0, 0, 0, 1, 5, 19, 31, 20, 1, 0, 0, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Nov 21 2019

For the operation of taking the sequence of run-lengths of a finite sequence, runs-resistance is defined as the number of applications required to reach a singleton.

			Triangle begins:
  1
  1  1
  1  1  1
  1  2  1  1
  1  1  2  3  0
  1  3  4  3  0  0
  1  1  4  8  1  0  0
  1  3  6 10  2  0  0  0
  1  2  8 13  6  0  0  0  0
  1  3 11 20  7  0  0  0  0  0
  1  1 11 29 14  0  0  0  0  0  0
  1  5 19 31 20  1  0  0  0  0  0  0
  1  1 17 50 30  2  0  0  0  0  0  0  0
  1  3 25 64 37  5  0  0  0  0  0  0  0  0
  1  3 29 74 62  7  0  0  0  0  0  0  0  0  0
Row n = 8 counts the following partitions:
  (8)  (44)        (53)    (332)      (4211)
       (2222)      (62)    (422)      (32111)
       (11111111)  (71)    (611)
                   (431)   (3221)
                   (521)   (5111)
                   (3311)  (22211)
                           (41111)
                           (221111)
                           (311111)
                           (2111111)

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (rows 1..50)
Claude Lenormand, Deux transformations sur les mots, Preprint, 5 pages, Nov 17 2003.

Row sums are A000041.
Column k = 1 is A032741.
Column k = 2 is A329745.
A similar invariant is frequency depth; see A323014, A325280.
The version for compositions is A329744.
The version for binary words is A329767.
Cf. A098504, A182850, A225485, A242882, A318928, A325410, A329747.

runsres[q_]:=Length[NestWhileList[Length/@Split[#]&,q,Length[#]>1&]]-1;
Table[Length[Select[IntegerPartitions[n],runsres[#]==k&]],{n,10},{k,0,n-1}]

\\ rr(p) gives runs resistance of partition.
rr(p)={my(r=0); while(#p > 1, my(L=List(), k=0); for(i=1, #p, if(i==#p||p[i]<>p[i+1], listput(L, i-k); k=i)); p=Vec(L); r++); r}
row(n)={my(v=vector(n)); forpart(p=n, v[1+rr(Vec(p))]++); v}
{ for(n=1, 10, print(row(n))) } \\ Andrew Howroyd, Jan 19 2023

A091954 Number of odd proper divisors of n. That is, the number of odd divisors of n that are less than n.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 3, 1, 1, 3, 1, 2, 3, 2, 1, 2, 2, 2, 3, 2, 1, 4, 1, 1, 3, 2, 3, 3, 1, 2, 3, 2, 1, 4, 1, 2, 5, 2, 1, 2, 2, 3, 3, 2, 1, 4, 3, 2, 3, 2, 1, 4, 1, 2, 5, 1, 3, 4, 1, 2, 3, 4, 1, 3, 1, 2, 5, 2, 3, 4, 1, 2, 4, 2, 1, 4, 3, 2, 3, 2, 1, 6, 3, 2, 3, 2, 3, 2, 1, 3, 5, 3, 1, 4, 1, 2, 7, 2, 1, 4, 1, 4

Offset: 1

Mohammad K. Azarian, Mar 12 2004

			The odd divisors of 15 that are less than 15 are 1, 3 and 5. Therefore there are three odd divisors of 15 that are less than 15.

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

Cf. A000005, A000035, A001620, A032741, A001227, A293214, A293216.
Sum of the k-th powers of the odd proper divisors of n for k=0..10: this sequence (k=0), A091570 (k=1), A351647 (k=2), A352031 (k=3), A352032 (k=4), A352033 (k=5), A352034 (k=6), A352035 (k=7), A352036 (k=8), A352037 (k=9), A352038 (k=10).
Sum of the k-th powers of the divisor complements of the odd proper divisors of n for k=0..10: this sequence (k=0), A352047 (k=1), A352048 (k=2), A352049 (k=3), A352050 (k=4), A352051 (k=5), A352052 (k=6), A352053 (k=7), A352054 (k=8), A352055 (k=9), A352056 (k=10).

Count[Most[Divisors[#]],?OddQ]&/@Range[100] (* _Harvey P. Dale, Sep 28 2012 *)
a[n_] := DivisorSigma[0, n/2^IntegerExponent[n, 2]] - Boole[OddQ[n]]; Array[a, 100] (* Amiram Eldar, Jun 11 2022 *)

A091954(n) = sumdiv(n,d,(dAntti Karttunen, Oct 04 2017

my(N=66, x='x+O('x^N)); concat(0, Vec(sum(k=2, N, x^k/(1-x^(2*k))))) \\ Seiichi Manyama, Jan 23 2021

From Antti Karttunen, Oct 04 2017: (Start)
a(n) = Sum_{d|n, dA000035(n).
a(n) = A001227(n) - A000035(n).
a(n) = A007814(A293214(n)) = A007814(A293216(n)).
(End)
G.f.: Sum_{k>=2} x^k/(1 - x^(2*k)). - Seiichi Manyama, Jan 23 2021
Sum_{k=1..n} a(k) ~ n*log(n)/2 + (gamma + log(2)/2 - 1)*n, where gamma is Euler's constant (A001620). - Amiram Eldar, Nov 26 2023

Corrected and extended by Harvey P. Dale, Sep 28 2012

A336416 Number of perfect-power divisors of n!.

Original entry on oeis.org

1, 1, 1, 1, 3, 3, 7, 7, 11, 18, 36, 36, 47, 47, 84, 122, 166, 166, 221, 221, 346, 416, 717, 717, 1001, 1360, 2513, 2942, 4652, 4652, 5675, 5675, 6507, 6980, 13892, 17212, 20408, 20408, 39869, 45329, 51018, 51018, 68758, 68758, 105573, 138617, 284718, 284718, 338126, 421126

Offset: 0

Gus Wiseman, Jul 22 2020

nonn

A number is a perfect power iff it is 1 or its prime exponents (signature) are not relatively prime.

			The a(1) = 0 through a(9) = 18 divisors:
       1: 1
       2: 1
       6: 1
      24: 1,4,8
     120: 1,4,8
     720: 1,4,8,9,16,36,144
    5040: 1,4,8,9,16,36,144
   40320: 1,4,8,9,16,32,36,64,128,144,576
  362880: 1,4,8,9,16,27,32,36,64,81,128,144,216,324,576,1296,1728,5184

David A. Corneth, Table of n, a(n) for n = 0..9999

The maximum among these divisors is A090630, with quotient A251753.
The version for distinct prime exponents is A336414.
The uniform version is A336415.
Replacing factorials with Chernoff numbers (A006939) gives A336417.
Prime powers are A000961.
Perfect powers are A001597, with complement A007916.
Prime power divisors are counted by A022559.
Cf. A000005, A001221, A001222, A011371, A032741, A118914, A124010, A130091, A327527.
Factorial numbers: A000142, A007489, A027423, A048656, A071626, A181796, A325272, A325273, A325617.

perpouQ[n_]:=Or[n==1,GCD@@FactorInteger[n][[All,2]]>1];
Table[Length[Select[Divisors[n!],perpouQ]],{n,0,15}]

a(n) = sumdiv(n!, d, (d==1) || ispower(d)); \\ Michel Marcus, Aug 19 2020

addhelp(val, "exponent of prime p in n!")
val(n, p) = my(r=0); while(n, r+=n\=p);r
a(n) = {if(n<=3, return(1)); my(pr = primes(primepi(n\2)), v = vector(#pr, i, val(n, pr[i])), res = 1, cv); for(i = 2, v[1], if(issquarefree(i), cv = v\i; res-=(prod(i = 1, #cv, cv[i]+1)-1)*(-1)^omega(i) ) ); res } \\ David A. Corneth, Aug 19 2020

a(p) = a(p-1) for prime p. - David A. Corneth, Aug 19 2020

a(26)-a(34) from Jinyuan Wang, Aug 19 2020

a(35)-a(49) from David A. Corneth, Aug 19 2020

A135539 Triangle read by rows: T(n,k) = number of divisors of n that are >= k.

Original entry on oeis.org

1, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 4, 3, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Gary W. Adamson, Oct 30 2007

Row sums give A000203.

Left border is A000005.

			First few rows of the triangle:
  1;
  2, 1;
  2, 1, 1;
  3, 2, 1, 1;
  2, 1, 1, 1, 1;
  4, 3, 2, 1, 1, 1;
  2, 1, 1, 1, 1, 1, 1;
  4, 3, 2, 2, 1, 1, 1, 1;
  3, 2, 2, 1, 1, 1, 1, 1, 1;
  4, 3, 2, 2, 2, 1, 1, 1, 1, 1;
  2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
  6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1;
  ...

Seiichi Manyama, Rows n = 1..140, flattened

Column k=1..10 give A000005, A032741, A023645, A321014, A338648, A338649, A338650, A338651, A338652, A338653.
Cf. A051731, A000203.
Cf. A001008, A001620, A002805.

with(numtheory);
f1:=proc(n) local d,s1,t1,t2,i;
d:=tau(n);
s1:=sort(divisors(n));
t1:=Array(1..n,0);
for i from 1 to d do t1[n-s1[i]+1]:=1; od:
t2:=PSUM(convert(t1,list));
[seq(t2[n+1-i],i=1..n)];
end proc;
for n from 1 to 15 do lprint(f1(n)); od: # N. J. A. Sloane, Nov 09 2018

T[n_, k_] := DivisorSum[n, Boole[# >= k]&];
Table[T[n, k], {n, 1, 15}, {k, 1, n}] // Flatten (* Jean-François Alcover, Feb 15 2023 *)

row(n) = my(d=divisors(n)); vector(n, k, #select(x->(x>=k), d)); \\ Michel Marcus, Jul 23 2022

Triangle read by rows, partial sums of A051731 starting from the right. A051731 as a lower triangular matrix times an all 1's lower triangular matrix.
From Seiichi Manyama, Jan 07 2023: (Start)
G.f. of column k: Sum_{j>=1} x^(k*j)/(1 - x^j).
G.f. of column k: Sum_{j>=k} x^j/(1 - x^j). (End)
Sum_{j=1..n} T(j, k) ~ n * (log(n) + 2*gamma - 1 - H(k-1)), where gamma is Euler's constant (A001620), and H(k) = A001008(k)/A002805(k) is the k-th harmonic number. - Amiram Eldar, Jan 08 2024

Clearer definition from N. J. A. Sloane, Nov 09 2018

A152770 Sum of proper divisors minus the number of proper divisors of n: a(n) = sigma(n) - n - d(n) + 1.

Original entry on oeis.org

0, 0, 0, 1, 0, 3, 0, 4, 2, 5, 0, 11, 0, 7, 6, 11, 0, 16, 0, 17, 8, 11, 0, 29, 4, 13, 10, 23, 0, 35, 0, 26, 12, 17, 10, 47, 0, 19, 14, 43, 0, 47, 0, 35, 28, 23, 0, 67, 6, 38, 18, 41, 0, 59, 14, 57, 20, 29, 0, 97, 0, 31, 36, 57, 16, 71, 0, 53, 24, 67, 0, 112, 0, 37, 44, 59, 16, 83, 0, 97

Offset: 1

Omar E. Pol, Dec 12 2008

Sum of divisors of n, minus the number of divisors of n, minus n, plus 1.
Also, sum of proper divisors of n, minus the number of divisors of n, plus 1.
Note that if a(n)>0 then n is a composite number (A002808), otherwise, n is a noncomposite number (A008578) also called prime number at the beginning of the 20th century.
Also, sum of divisors of n, minus the number of proper divisors of n, minus n.
a(A008578(n)) = 0 for all n>=1. - Robert G. Wilson v, Dec 14 2008

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).

Cf. A000005, A000040, A000203, A001065, A002808, A008578, A062249, A065608, A032741.

A152770 := proc(n)
        numtheory[sigma](n)-n-numtheory[tau](n)+1 ;
end proc: # R. J. Mathar, Sep 28 2011

f[n_] := DivisorSigma[1, n] - DivisorSigma[0, n] - n + 1; Array[f, 105] (* Robert G. Wilson v, Dec 14 2008 *)

a(n)=sigma(n)-n-numdiv(n)+1 \\ Charles R Greathouse IV, Mar 09 2014

a(n) = A000203(n) - A000005(n) - n + 1 = A001065(n) - A000005(n) + 1 = A000203(n) - A062249(n) + 1 = A065608(n) - n + 1.
a(n) = A000203(n) - A032741(n) - n.
a(n) = A001065(n) - A032741(n).
a(n) = A158901(n) - n. - Juri-Stepan Gerasimov, Sep 12 2009
From Peter Bala Jan 22 2021: (Start)
G.f.: A(q) = Sum_{n >= 2} (n-1)*q^(2*n)/(1 - q^n) = Sum_{n >= 2} q^(2*n)/(1 - q^n)^2. Cf. A001065.
Faster converging series: A(q) = Sum_{n >= 1} q^(n*(n+1))*((n-1)*q^(3*n+2) - n*q^(2*n+1) + (2-n)*q^(n+1) + n - 1)/((1 - q^n)*(1 - q^(n+1))^2) - apply the operator t*d/dt to equation 1 in Arndt, then set t = q^2 and x = q. (End)

More terms from Omar E. Pol and Robert G. Wilson v, Dec 14 2008

Definition clarified and edited by Omar E. Pol, Dec 21 2008

A336571 Number of sets of divisors d|n, 1 < d < n, all belonging to A130091 (numbers with distinct prime multiplicities) and forming a divisibility chain.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 5, 1, 3, 3, 8, 1, 5, 1, 5, 3, 3, 1, 14, 2, 3, 4, 5, 1, 4, 1, 16, 3, 3, 3, 17, 1, 3, 3, 14, 1, 4, 1, 5, 5, 3, 1, 36, 2, 5, 3, 5, 1, 14, 3, 14, 3, 3, 1, 16, 1, 3, 5, 32, 3, 4, 1, 5, 3, 4, 1, 35, 1, 3, 5, 5, 3, 4, 1, 36, 8, 3, 1

Offset: 1

Gus Wiseman, Jul 29 2020

nonn

A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization, so a number has distinct prime multiplicities iff all the exponents in its prime signature are distinct.

			The a(n) sets for n = 4, 6, 12, 16, 24, 84, 36:
  {}   {}   {}     {}       {}        {}        {}
  {2}  {2}  {2}    {2}      {2}       {2}       {2}
       {3}  {3}    {4}      {3}       {3}       {3}
            {4}    {8}      {4}       {4}       {4}
            {2,4}  {2,4}    {8}       {7}       {9}
                   {2,8}    {12}      {12}      {12}
                   {4,8}    {2,4}     {28}      {18}
                   {2,4,8}  {2,8}     {2,4}     {2,4}
                            {4,8}     {2,12}    {3,9}
                            {2,12}    {2,28}    {2,12}
                            {3,12}    {3,12}    {2,18}
                            {4,12}    {4,12}    {3,12}
                            {2,4,8}   {4,28}    {3,18}
                            {2,4,12}  {7,28}    {4,12}
                                      {2,4,12}  {9,18}
                                      {2,4,28}  {2,4,12}
                                                {3,9,18}

A336423 is the version for chains containing n.
A336570 is the maximal version.
A000005 counts divisors.
A001055 counts factorizations.
A007425 counts divisors of divisors.
A032741 counts proper divisors.
A045778 counts strict factorizations.
A071625 counts distinct prime multiplicities.
A074206 counts strict chains of divisors from n to 1.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A253249 counts chains of divisors.
A336422 counts divisible pairs of divisors, both in A130091.
A336424 counts factorizations using A130091.
A336500 counts divisors of n in A130091 with quotient also in A130091.
Cf. A001222, A002033, A005117, A098859, A118914, A124010, A294068, A305149, A327498, A327523, A336568, A336569.

strchns[n_]:=If[n==1,1,Sum[strchns[d],{d,Select[Most[Divisors[n]],UnsameQ@@Last/@FactorInteger[#]&]}]];
Table[strchns[n],{n,100}]

A319411 Triangle read by rows: T(n,k) = number of binary vectors of length n with runs-resistance k (1 <= k <= n).

Original entry on oeis.org

2, 2, 2, 2, 2, 4, 2, 4, 6, 4, 2, 2, 12, 12, 4, 2, 6, 30, 18, 8, 0, 2, 2, 44, 44, 32, 4, 0, 2, 6, 82, 76, 74, 16, 0, 0, 2, 4, 144, 138, 172, 52, 0, 0, 0, 2, 6, 258, 248, 350, 156, 4, 0, 0, 0, 2, 2, 426, 452, 734, 404, 28, 0, 0, 0, 0, 2, 10, 790, 752, 1500, 938, 104, 0, 0, 0, 0, 0

Offset: 1

N. J. A. Sloane, Sep 20 2018

"Runs-resistance" is defined in A318928.
Row sums are 2,4,8,16,... (the binary vectors may begin with 0 or 1).
This is similar to A329767 but without the k = 0 column and with a different row n = 1. - Gus Wiseman, Nov 25 2019

			Triangle begins:
2,
2, 2,
2, 2, 4,
2, 4, 6, 4,
2, 2, 12, 12, 4,
2, 6, 30, 18, 8, 0,
2, 2, 44, 44, 32, 4, 0,
2, 6, 82, 76, 74, 16, 0, 0,
2, 4, 144, 138, 172, 52, 0, 0, 0,
2, 6, 258, 248, 350, 156, 4, 0, 0, 0,
2, 2, 426, 452, 734, 404, 28, 0, 0, 0, 0,
2, 10, 790, 752, 1500, 938, 104, 0, 0, 0, 0, 0,
...
Lenormand gives the first 20 rows.
The calculation of row 4 is as follows.
We may assume the first bit is a 0, and then double the answers.
vector / runs / steps to reach a single number:
0000 / 4 / 1
0001 / 31 -> 11 -> 2 / 3
0010 / 211 -> 12 -> 11 -> 2 / 4
0011 / 22 -> 2 / 2
0100 / 112 -> 21 -> 11 -> 2 / 4
0101 / 1111 -> 4 / 2
0110 / 121 -> 111 -> 3 / 3
0111 / 13 -> 11 -> 2 / 3
and we get 1 (once), 2 (twice), 3 (three times) and 4 (twice).
So row 4 is: 2,4,6,4.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..1830
Claude Lenormand, Deux transformations sur les mots, Preprint, 5 pages, Nov 17 2003. Apparently unpublished. This is a scanned copy of the version that the author sent to me in 2003.

Row sums are A000079.
Column k = 2 is 2 * A032741 = A319410.
Column k = 3 is 2 * A329745 (because runs-resistance 2 for compositions corresponds to runs-resistance 3 for binary words).
The version for compositions is A329744.
The version for partitions is A329746.
The number of nonzero entries in row n > 0 is A319412(n).
The runs-resistance of the binary expansion of n is A318928.
Cf. A096365, A225485, A245563, A319413, A319414, A319415, A325280, A329747, A329750, A329767, A329870.

runsresist[q_]:=If[Length[q]==1,1,Length[NestWhileList[Length/@Split[#]&,q,Length[#]>1&]]-1];
Table[Length[Select[Tuples[{0,1},n],runsresist[#]==k&]],{n,10},{k,n}] (* Gus Wiseman, Nov 25 2019 *)

A238710 Triangular array: t(n,k) = number of partitions p = {x(1) >= x(2) >= ... >= x(k)} such that max(x(j) - x(j-1)) = k.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 3, 3, 2, 1, 1, 1, 6, 3, 2, 1, 1, 3, 6, 6, 2, 2, 1, 1, 2, 10, 6, 5, 2, 2, 1, 1, 3, 11, 11, 6, 4, 2, 2, 1, 1, 1, 16, 13, 10, 5, 4, 2, 2, 1, 1, 5, 17, 19, 12, 9, 4, 4, 2, 2, 1, 1, 1, 24, 24, 18, 11, 8, 4, 4, 2, 2, 1, 1, 3, 27, 34

Offset: 1

Clark Kimberling, Mar 03 2014

The first two columns are essentially A032741 and A237665. Counting the top row as row 2, the sum of numbers in row n is A000041(n) - 1.

			row 2:  1
row 3:  1 ... 1
row 4:  2 ... 1 ... 1
row 5:  1 ... 3 ... 1 ... 1
row 6:  3 ... 3 ... 2 ... 1 ... 1
row 7:  1 ... 6 ... 3 ... 2 ... 1 ... 1
row 8:  3 ... 6 ... 6 ... 2 ... 2 ... 1 ... 1
row 9:  2 ... 10 .. 6 ... 5 ... 2 ... 2 ... 1 ... 1
Let m = max(x(j) - x(j-1)); then for row 5, the 1 partition with m = 0 is 11111; the 3 partitions with m = 1 are 32, 221, 2111; the 1 partition with m = 2 is 311, and the 1 partition with m = 3 is 41.

Clark Kimberling, Table of n, a(n) for n = 1..400

Cf. A238710, A238709, A238353.

z = 25; p[n_, k_] := p[n, k] = IntegerPartitions[n][[k]]; m[n_, k_] := m[n, k] = Max[-Differences[p[n, k]]]; c[n_] := Table[m[n, h], {h, 1, PartitionsP[n]}]; v = Table[Count[c[n], h], {n, 2, z}, {h, 0, n - 2}]; Flatten[v]
TableForm[v]

cp's OEIS Frontend

A039653 a(0) = 0; for n > 0, a(n) = sigma(n)-1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Formula

A193829 Irregular triangle read by rows in which row n lists the differences between consecutive divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A329746 Triangle read by rows where T(n,k) is the number of integer partitions of n > 0 with runs-resistance k, 0 <= k <= n - 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A091954 Number of odd proper divisors of n. That is, the number of odd divisors of n that are less than n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A336416 Number of perfect-power divisors of n!.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A135539 Triangle read by rows: T(n,k) = number of divisors of n that are >= k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A152770 Sum of proper divisors minus the number of proper divisors of n: a(n) = sigma(n) - n - d(n) + 1.