A168019 -id:A168019 - cp's OEIS frontend

A168021 Triangle T(n,k) read by rows in which row n lists the number of partitions of n into parts divisible by k.

1, 2, 1, 3, 0, 1, 5, 2, 0, 1, 7, 0, 0, 0, 1, 11, 3, 2, 0, 0, 1, 15, 0, 0, 0, 0, 0, 1, 22, 5, 0, 2, 0, 0, 0, 1, 30, 0, 3, 0, 0, 0, 0, 0, 1, 42, 7, 0, 0, 2, 0, 0, 0, 0, 1, 56, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 77, 11, 5, 3, 0, 2, 0, 0, 0, 0, 0, 1

Offset: 1

Omar E. Pol, Nov 20 2009, Nov 21 2009

The row-reversed version is A168016.

Also see A168020.

			Triangle begins:
==============================================
...... k: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10 11 12
==============================================
n=1 ..... 1,
n=2 ..... 2, 1,
n=3 ..... 3, 0, 1,
n=4 ..... 5, 2, 0, 1,
n=5 ..... 7, 0, 0, 0, 1,
n=6 .... 11, 3, 2, 0, 0, 1,
n=7 .... 15, 0, 0, 0, 0, 0, 1,
n=8 .... 22, 5, 0, 2, 0, 0, 0, 1,
n=9 .... 30, 0, 3, 0, 0, 0, 0, 0, 1,
n=10 ... 42, 7, 0, 0, 2, 0, 0, 0, 0, 1,
n=11 ... 56, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
n=12 ... 77,11, 5, 3, 0, 2, 0, 0, 0, 0, 0, 1,
...

G. C. Greubel, Rows n = 1..50 of the triangle, flattened
Omar E. Pol, Illustration of the shell model of partitions (2D and 3D)
Omar E. Pol, Illustration of the shell model of partitions (2D view)
Omar E. Pol, Illustration of the shell model of partitions (3D view)

Cf. A000007, A000012, A000041, A035377, A035444, A047968 (row sums).

Cf. A135010, A138121, A168016, A168017, A168018, A168019, A168020.

T[n_, k_]:= If[IntegerQ[n/k], PartitionsP[n/k], 0];
Table[T[n, k], {n,15}, {k,n}]//Flatten (* G. C. Greubel, Jan 12 2023 *)

def A168021(n,k): return number_of_partitions(n/k) if (n%k)==0 else 0
flatten([[A168021(n,k) for k in range(1,n+1)] for n in range(1,16)]) # G. C. Greubel, Jan 12 2023

T(n,k) = A000041(n/k) if k|n, else T(n,k)=0.
Sum_{k=1..n} T(n, k) = A047968(n).
From G. C. Greubel, Jan 12 2023: (Start)
T(2*n, n) = 2*A000012(n).
T(2*n-1, n+1) = A000007(n-2). (End)

Edited by Charles R Greathouse IV, Mar 23 2010

A168020 Square array read by antidiagonals in which row n lists the number of partitions of n into parts divisible by k.

Original entry on oeis.org

1, 2, 0, 3, 1, 0, 5, 0, 0, 0, 7, 2, 1, 0, 0, 11, 0, 0, 0, 0, 0, 15, 3, 0, 1, 0, 0, 0, 22, 0, 2, 0, 0, 0, 0, 0, 30, 5, 0, 0, 1, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 0, 0, 56, 7, 3, 2, 0, 1, 0, 0, 0, 0, 0, 77, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 101, 11, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0

Offset: 1

Omar E. Pol, Nov 20 2009

In the square array, note that the column k starts with k-1 zeros. Then list each partition number of positive integers followed by k-1 zeros. See A000041, which is the main entry for this sequence.

			The array, A(n, k), begins:
   n | k = 1   2   3   4   5   6   7   8   9  10  11  12
  ---+--------------------------------------------------
   1 |     1   0   0   0   0   0   0   0   0   0   0   0
   2 |     2   1   0   0   0   0   0   0   0   0   0   0
   3 |     3   0   1   0   0   0   0   0   0   0   0   0
   4 |     5   2   0   1   0   0   0   0   0   0   0   0
   5 |     7   0   0   0   1   0   0   0   0   0   0   0
   6 |    11   3   2   0   0   1   0   0   0   0   0   0
   7 |    15   0   0   0   0   0   1   0   0   0   0   0
   8 |    22   5   0   2   0   0   0   1   0   0   0   0
   9 |    30   0   3   0   0   0   0   0   1   0   0   0
  10 |    42   7   0   0   2   0   0   0   0   1   0   0
  11 |    56   0   0   0   0   0   0   0   0   0   1   0
  12 |    77  11   5   3   0   2   0   0   0   0   0   1
  ...
Antidiagonal triangle, T(n,k), begins as:
   1;
   2, 0;
   3, 1, 0;
   5, 0, 0, 0;
   7, 2, 1, 0, 0;
  11, 0, 0, 0, 0, 0;
  15, 3, 0, 1, 0, 0, 0;
  22, 0, 2, 0, 0, 0, 0, 0;
  30, 5, 0, 0, 1, 0, 0, 0, 0;
  42, 0, 0, 0, 0, 0, 0, 0, 0, 0;

G. C. Greubel, Antidiagonals n = 1..50, flattened
Omar E. Pol, Illustration of the shell model of partitions (2D and 3D)
Omar E. Pol, Illustration of the shell model of partitions (2D view)
Omar E. Pol, Illustration of the shell model of partitions (3D view)

Cf. A000007, A000041, A035377, A035444, A135010, A138121.

Cf. A168016, A168017, A168018, A168019, A168021. [From Omar E. Pol, Nov 23 2009]

T[n_, k_]:= If[IntegerQ[(n-k+1)/k], PartitionsP[(n-k+1)/k], 0];
Table[T[n, k], {n,15}, {k,n}]//Flatten (* G. C. Greubel, Jan 12 2023 *)

def A168020(n,k): return number_of_partitions((n-k+1)/k) if ((n-k+1)%k)==0 else 0
flatten([[A168020(n,k) for k in range(1,n+1)] for n in range(1,16)]) # G. C. Greubel, Jan 12 2023

A(n, k) = A000041(n/k) if k divides n, otherwise A(n, k) = 0 (array).
A(n, 1) = A(n*k, k) = A000041(n).
From G. C. Greubel, Jan 12 2023: (Start)
T(n, k) = A000041((n-k+1)/k) if k divides (n-k+1), otherwise T(n, k) = 0 (triangle).
T(n, 1) = A000041(n).
T(2*n, n) = 2*A000007(n-1), n >= 1. (End)

Edited by Omar E. Pol, Nov 21 2009
Edited by Charles R Greathouse IV, Mar 23 2010
Edited by Max Alekseyev, May 07 2010

A168017 Triangle read by rows in which row n lists the number of partitions of n into parts divisible by d, where d is a divisor of n listed in decreasing order.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 5, 1, 7, 1, 2, 3, 11, 1, 15, 1, 2, 5, 22, 1, 3, 30, 1, 2, 7, 42, 1, 56, 1, 2, 3, 5, 11, 77, 1, 101, 1, 2, 15, 135, 1, 3, 7, 176, 1, 2, 5, 22, 231, 1, 297, 1, 2, 3, 11, 30, 385, 1, 490, 1, 2, 5, 7, 42, 627, 1, 3, 15, 792, 1, 2, 56, 1002

Offset: 1

Omar E. Pol, Nov 22 2009

Positive values of triangle A168016.
The number of terms of row n is equal to the number of divisors of n: A000005(n).
Note that the last term of each row is the number of partitions of n: A000041(n).
Also, it appears that row n lists the partition numbers of the divisors of n. [Omar E. Pol, Nov 23 2009]

			Consider row n=8: (1, 2, 5, 22). The divisors of 8 listed in decreasing order are 8, 4, 2, 1 (see A056538). There is 1 partition of 8 into parts divisible by 8. Also, there are 2 partitions of 8 into parts divisible by 4: {(8), (4+4)}; 5 partitions of 8 into parts divisible by 2: {(8), (6+2), (4+4), (4+2+2), (2+2+2+2)}; and 22 partitions of 8 into parts divisible by 1, because A000041(8)=22. Then row 8 is formed by 1, 2, 5, 22.
Triangle begins:
1;
1,  2;
1,  3;
1,  2,  5;
1,  7;
1,  2,  3, 11;
1, 15;
1,  2,  5, 22;
1,  3, 30;
1,  2,  7, 42;
1, 56;
1,  2,  3,  5, 11, 77;

Alois P. Heinz, Rows n = 1..1400, flattened
Omar E. Pol, Illustration of the partitions of n, for n = 1 .. 9

Row sums give A047968.

Cf. A000005, A000041, A056538, A135010, A138121, A168016, A168018, A168019, A168020, A168021.

with(numtheory):
b:= proc(n, i, d) option remember;
      if n<0 then 0
    elif n=0 then 1
    elif i<1 then 0
    else b(n, i-d, d) +b(n-i, i, d)
      fi
    end:
T:= proc(n) local l;
      l:= sort([divisors(n)[]],`>`);
      seq(b(n, n, l[i]), i=1..nops(l))
    end:
seq(T(n), n=1..30); # Alois P. Heinz, Oct 21 2011

b[n_, i_, d_] := b[n, i, d] = Which[n<0, 0, n==0, 1, i<1, 0, True, b[n, i - d, d] + b[n-i, i, d]]; T[n_] := Module[{l = Divisors[n] // Reverse}, Table[b[n, n, l[[i]]], {i, 1, Length[l]}]]; Table[T[n], {n, 1, 30}] // Flatten (* Jean-François Alcover, Dec 03 2015, after Alois P. Heinz *)

A168018 Triangle read by rows in which row n lists the number of partitions of n into parts divisible by d, where d is a divisor of n.

Original entry on oeis.org

1, 2, 1, 3, 1, 5, 2, 1, 7, 1, 11, 3, 2, 1, 15, 1, 22, 5, 2, 1, 30, 3, 1, 42, 7, 2, 1, 56, 1, 77, 11, 5, 3, 2, 1, 101, 1, 135, 15, 2, 1, 176, 7, 3, 1, 231, 22, 5, 2, 1, 297, 1, 385, 30, 11, 3, 2, 1, 490, 1, 627, 42, 7, 5, 2, 1, 792, 15, 3, 1, 1002, 56, 2, 1, 1255, 1, 1575, 77, 22, 11, 5, 3, 2

Offset: 1

Omar E. Pol, Nov 22 2009

Positive values of triangle A168021.
Note that column 1 lists the numbers of partitions A000041(n).
Row n has A000005(n) terms.
Also, it appears that row n lists the partition numbers of the divisors of n, in decreasing order. [Omar E. Pol, Nov 23 2009]

			For example:
Consider row 8: (22, 5, 2, 1). The divisors of 8 are 1, 2, 4, 8 (see A027750). Also, there are 22 partitions of 8 into parts divisible by 1 (A000041(8)=22); 5 partitions of 8 into parts divisible by 2: {(8),(6+2),(4+4),(4+2+2),(2+2+2+2)}; 2 partitions of 8 into parts divisible by 4: {(8),(4+4)}; and 1 partition of 8 into parts divisible by 8. Then row 8 is formed by 22, 5, 2, 1.
Triangle begins:
1;
2, 1;
3, 1;
5, 2, 1;
7, 1;
11, 3, 2, 1;
15, 1;
22, 5, 2, 1;
30, 3, 1;
42, 7, 2, 1;
56, 1;
77, 11, 5, 3, 2, 1;

Omar E. Pol, Illustration of the partitions of n, for n = 1 .. 9

Row sums give A047968.

Cf. A000005, A000041, A027750, A135010, A138121, A168016, A168017, A168019, A168020, A168021.

A168018 := proc(n) local dvs,p,i,d,a,pp,divs,par; dvs := sort(convert(numtheory[divisors](n),list)) ; p := combinat[partition](n) ; for i from 1 to nops(dvs) do d := op(i,dvs) ; a := 0 ; for pp in p do divs := true; for par in pp do if par mod d <> 0 then divs := false; end if; end do ; if divs then a := a+1 ; end if; end do ; printf("%d,",a) ; end do ; end proc: for n from 1 to 40 do A168018(n) ; end do : # R. J. Mathar, Feb 05 2010

Terms beyond row 12 from R. J. Mathar, Feb 05 2010

A168120 Square array T(n,k) read by antidiagonals in which column k lists each number A000009 followed by k-1 zeros, for k>0.

Original entry on oeis.org

1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 2, 0, 0, 0, 1, 3, 1, 1, 0, 0, 1, 4, 0, 0, 0, 0, 0, 1, 5, 2, 0, 1, 0, 0, 0, 1, 6, 0, 1, 0, 0, 0, 0, 0, 1, 8, 2, 0, 0, 1, 0, 0, 0, 0, 1, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 3, 2, 1, 0, 1, 0, 0, 0, 0, 0, 1, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 0

Omar E. Pol, Nov 26 2009

The same structure of the square array in A168019, but using the numbers A000009.

			The array begins:
==================================================
... Column k: 1. 2. 3. 4. 5. 6. 7. 8. 9 10 11 12
. Row ...........................................
...n ............................................
==================================================
.. 0 ........ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
.. 1 ........ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
.. 2 ........ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
.. 3 ........ 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
.. 4 ........ 2, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
.. 5 ........ 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,
.. 6 ........ 4, 2, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0,
.. 7 ........ 5, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0,
.. 8 ........ 6, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0,
.. 9 ........ 8, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0,
. 10 ....... 10, 3, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0,
. 11 ....... 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0,
. 12 ....... 15, 4, 2, 2, 0, 1, 0, 0, 0, 0, 0, 1,
...

Cf. A000009, A000041, A168019, A168021, A168121, A168122.

Edited by Charles R Greathouse IV, Mar 23 2010

cp's OEIS Frontend

A168021 Triangle T(n,k) read by rows in which row n lists the number of partitions of n into parts divisible by k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

SageMath

Formula

Extensions

A168020 Square array read by antidiagonals in which row n lists the number of partitions of n into parts divisible by k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

SageMath

Formula

Extensions

A168017 Triangle read by rows in which row n lists the number of partitions of n into parts divisible by d, where d is a divisor of n listed in decreasing order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A168018 Triangle read by rows in which row n lists the number of partitions of n into parts divisible by d, where d is a divisor of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Extensions

A168120 Square array T(n,k) read by antidiagonals in which column k lists each number A000009 followed by k-1 zeros, for k>0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions