0,2
Corresponds to the best known lower bound for the tie problem. - Jorg Zurkirchen, Oct 15 2008
R. Chapman et al., 2-modular lattices from ternary codes, J. Th. des Nombres de Bordeaux, 14 (2002), 73-85.
Index entries for Molien series
a(n) = ceil(n * (2n - 1) / 3). - Jorg Zurkirchen, Oct 15 2008
Sequence in context: A024390 A125622 A080551 this_sequence A013927 A163059 A099738
Adjacent sequences: A008819 A008820 A008821 this_sequence A008823 A008824 A008825
nonn
N. J. A. Sloane (njas(AT)research.att.com).
Search completed in 0.002 seconds