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.

A305567 Irregular triangle where T(n,k) is the number of finite sets of positive integers with least common multiple n and greatest common divisor k, where k runs over all divisors of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 4, 2, 1, 1, 2, 1, 1, 7, 1, 1, 1, 1, 1, 32, 7, 2, 1, 1, 1, 1, 1, 7, 1, 1, 1, 7, 1, 1, 1, 8, 4, 2, 1, 1, 1, 1, 32, 2, 7, 1, 1, 1, 1, 1, 32, 7, 1, 2, 1, 1, 7, 1, 1, 1, 7, 1, 1, 1, 1, 1, 136, 32, 4, 7, 2, 1, 1, 1, 2
Offset: 1

Views

Author

Gus Wiseman, Jun 05 2018

Keywords

Examples

			Triangle begins:
   1
   1  1
   1  1
   2  1  1
   1  1
   7  1  1  1
   1  1
   4  2  1  1
   2  1  1
   7  1  1  1
   1  1
  32  7  2  1  1  1
   1  1
   7  1  1  1
   7  1  1  1
   8  4  2  1  1
   1  1
  32  2  7  1  1  1
   1  1
  32  7  1  2  1  1
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[Subsets[Divisors[n]],And[GCD@@#==k,LCM@@#==n]&]],{n,30},{k,Divisors[n]}]