A352566 - OEIS

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

A352566

a(n) = number of modules with n elements over the ring of integers in the imaginary quadratic field of discriminant -15.

2

1, 2, 1, 5, 1, 2, 0, 10, 2, 2, 0, 5, 0, 0, 1, 20, 2, 4, 2, 5, 0, 0, 2, 10, 2, 0, 3, 0, 0, 2, 2, 36, 0, 4, 0, 10, 0, 4, 0, 10, 0, 0, 0, 0, 2, 4, 2, 20, 1, 4, 2, 0, 2, 6, 0, 0, 2, 0, 0, 5, 2, 4, 0, 65, 0, 0, 0, 10, 2, 0, 0, 20, 0, 0, 2, 10, 0, 0, 2, 20, 5, 0, 2, 0, 2, 0, 0, 0, 0, 4, 0, 10, 2, 4, 2, 36, 0, 2, 0, 10, 0, 4, 0, 0, 0, 4, 2, 15, 2, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

See A352550 for comments and PARI code.

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..10000

R. Israel and D. Craddock, Are these sequences multiplicative?, Mathematics StackExchange, Oct 2025.

CROSSREFS

Cf. A038540, A038541, A248107, A352550-A352567.

Sequence in context: A143983 A282988 A113767 * A246964 A157334 A320667

Adjacent sequences: A352563 A352564 A352565 * A352567 A352568 A352569

KEYWORD

nonn,mult

AUTHOR

N. J. A. Sloane, Mar 21 2022

STATUS

approved