|
| |
|
|
A096827
|
|
Number of antichains in divisor lattice D(n).
|
|
7
| |
|
|
2, 3, 3, 4, 3, 6, 3, 5, 4, 6, 3, 10, 3, 6, 6, 6, 3, 10, 3, 10, 6, 6, 3, 15, 4, 6, 5, 10, 3, 20, 3, 7, 6, 6, 6, 20, 3, 6, 6, 15, 3, 20, 3, 10, 10, 6, 3, 21, 4, 10, 6, 10, 3, 15, 6, 15, 6, 6, 3, 50, 3, 6, 10, 8, 6, 20, 3, 10, 6, 20, 3, 35, 3, 6, 10, 10, 6, 20, 3, 21, 6, 6, 3, 50, 6, 6, 6, 15, 3, 50, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The divisor lattice D(n) is the lattice of the divisors of the natural number n.
The empty set is counted as an antichain in D(n).
a(n)=gamma(n+1) where gamma is degree of cardinal completeness of Lukasiewicz n-valued logic. [From Artur Jasinski (grafix(AT)csl.pl), Mar 01 2010]
|
|
|
REFERENCES
| Karpenko A.S. 2006. Lukasiewicz's Logics and Prime Numbers (English translation). [From Artur Jasinski (grafix(AT)csl.pl), Mar 01 2010]
Karpenko A.S. 2000. Lukasiewicz's Logics and Prime Numbers (Russian). [From Artur Jasinski (grafix(AT)csl.pl), Mar 01 2010]
|
|
|
CROSSREFS
| Cf. A096825, A096826, A097699.
A175177, A175178 [From Artur Jasinski (grafix(AT)csl.pl), Mar 01 2010]
Sequence in context: A049878 A038203 A186971 * A063826 A152983 A205324
Adjacent sequences: A096824 A096825 A096826 * A096828 A096829 A096830
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 17 2004
|
|
|
EXTENSIONS
| More terms from John W. Layman (layman(AT)math.vt.edu), Aug 20 2004
|
| |
|
|
