login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
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
Row lengths are A000005.
Sequence in context: A247005 A174215 A364457 * A134744 A260875 A351350
KEYWORD
nonn,tabf
AUTHOR
Gus Wiseman, Jun 05 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:16 EDT 2024. Contains 371936 sequences. (Running on oeis4.)