login
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.
3
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,6
EXAMPLE
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
MATHEMATICA
Table[Length[Select[Subsets[Divisors[n]], And[GCD@@#==k, LCM@@#==n]&]], {n, 30}, {k, Divisors[n]}]
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Jun 05 2018
STATUS
approved