1,2

a(n) is also the number of multisets of integers ranging from 1 to n, such that the sum of the members of the multiset is congruent to 0 mod n, and no submultiset exists whose sum of members is congruent to 0 mod n. These multisets can be thought of as partitions of n in modular arithmetic, thus this sequence can be thought of as a modular arithmetic version of the partition numbers (cf. A000041). - Andrew Weimholt, Jan 31 2011

M. D. Neusel and L. Smith, Invariant Theory of Finite Groups, Amer. Math. Soc., 2002; see p. 208.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

C. W. Strom, Complete systems of invariants of the cyclic groups of equal order and degree, Proc. Iowa Acad. Sci., 55 (1948), 287-290.

Finklea, Moore, Ponomarenko and Turner, Invariant Polynomials and Minimal Zero Sequences, to appear in Communications in Algebra.

Bryson W. Finklea, Terri Moore, Vadim Ponomarenko and Zachary J. Turner, Invariant polynomials and minimal zero sequences, Involve, 1:2 (2008), pp. 159-165.

Vadim Ponomarenko, Table

Vadim Ponomarenko, Programs

a(n) = A096337(n) + 1. - Filip Zaludek, Oct 26 2016

Row sums of A082641.

Cf. A096337.

Sequence in context: A116584 A152477 A019998 * A333613 A171276 A027167

Adjacent sequences: A002953 A002954 A002955 * A002957 A002958 A002959

nonn,nice

More terms from Vadim Ponomarenko (vadim123(AT)gmail.com), Jun 29 2004

approved