login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181189 Maximal number of elements needed to identify an abelian group of order n by testing the order of random elements. 1
0, 0, 3, 0, 0, 0, 5, 4, 0, 0, 7, 0, 0, 0, 9, 0, 7, 0, 11, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Table of n, a(n) for n=2..23.

FORMULA

For all squarefree n, a(n)=0, since there is only one abelian group of order n. Hence the group is trivially known without any checking.

EXAMPLE

For n=20, by the fundamental theorem of finite abelian groups, the group is either Z20 or Z10 x Z2. At worst, you could choose the identity, 1 element of order 2, 4 elements of order 5, and 4 elements of order 10. Then you still wouldn't know which group you have. But the order of the next element you choose will determine the group you have. So a(20)=11.

CROSSREFS

Cf. A005117.

Sequence in context: A184762 A330734 A081805 * A327889 A221702 A084681

Adjacent sequences:  A181186 A181187 A181188 * A181190 A181191 A181192

KEYWORD

more,nonn

AUTHOR

Isaac Lambert, Oct 10 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 05:51 EST 2020. Contains 332277 sequences. (Running on oeis4.)