OFFSET
1,2
COMMENTS
Closed under the binary operations of GCD and LCM, since a self-conjugate partition of Omega(a(n)) (which the prime signature of these numbers is) is the concatenation of self-conjugate hooks of decreasing size while moving downward and to the right in the Ferrers diagram, and the GCD (or LCM) of two terms a(i) and a(j) is obtained by taking the smaller (or larger, respectively) of the corresponding hooks. For example, GCD(a(8),a(11)) = GCD(5040,36960) = 1680 = a(7), and LCM(a(8),a(11)) = 110880 = a(13). The two binary operations make the set {a(n)} into a lattice order. - Richard Peterson, May 29 2020
LINKS
David A. Corneth, Table of n, a(n) for n = 1..11879 (first 578 terms from Amiram Eldar, terms <= 10^70)
David A. Corneth, PARI-program
Eric Weisstein's World of Mathematics, Self-Conjugate Partition
EXAMPLE
A025487(11) = 36 = 2^2*3^2 has a prime signature of (2,2), which is a self-conjugate partition; hence, 36 is included in the sequence.
PROG
(PARI) \\ See Corneth link \\ David A. Corneth, Jun 03 2020
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
Matthew Vandermast, Dec 08 2010
EXTENSIONS
a(18)-a(32) from Amiram Eldar, Jan 19 2019
STATUS
approved