cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A319300 Irregular triangle where T(n,k) is the number of strict integer partitions of n with GCD equal to the k-th divisor of n.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 2, 1, 0, 1, 4, 1, 4, 1, 0, 1, 6, 1, 1, 7, 2, 0, 1, 11, 1, 10, 2, 1, 1, 0, 1, 17, 1, 17, 4, 0, 1, 23, 2, 1, 1, 26, 4, 1, 0, 1, 37, 1, 36, 6, 2, 1, 0, 1, 53, 1, 53, 7, 2, 1, 0, 1, 70, 4, 1, 1, 77, 11, 0, 1, 103, 1, 103, 10, 4, 2, 1
Offset: 1

Views

Author

Gus Wiseman, Sep 16 2018

Keywords

Examples

			Triangle begins:
   1
   0  1
   1  1
   1  0  1
   2  1
   2  1  0  1
   4  1
   4  1  0  1
   6  1  1
   7  2  0  1
  11  1
  10  2  1  1  0  1
  17  1
  17  4  0  1
  23  2  1  1
  26  4  1  0  1
  37  1
  36  6  2  1  0  1
  53  1
  53  7  2  1  0  1
		

Crossrefs

A regular version is A303138. Row lengths are A000005. Row sums are A000009. First column is A078374.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],And[UnsameQ@@#,GCD@@#==k]&]],{n,20},{k,Divisors[n]}]

Formula

T(n,k) = A078374(n/A027750(n,k)).