Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 21 2022 11:23:54
%S 1,0,1,1,0,0,2,0,2,0,0,1,2,0,0,2,0,0,2,0,2,0,0,0,1,0,3,2,0,0,2,0,0,0,
%T 0,2,2,0,2,0,0,0,2,0,0,0,0,2,5,0,0,2,0,0,0,0,2,0,0,0,2,0,4,3,0,0,2,0,
%U 0,0,0,0,2,0,1,2,0,0,2,0,5,0,0,2,0,0,0,0,0,0,4,0,2,0
%N a(n) = number of modules with n elements over the ring of integers in the imaginary quadratic field of discriminant -3.
%C See A352550 for comments and PARI code.
%C Appears to be the same sequence as A248107.
%Y Cf. A038540, A038541, A248107, A352550-A352567.
%K nonn
%O 1,7
%A _N. J. A. Sloane_, Mar 21 2022