|
%I #19 Mar 23 2018 06:26:58
%S 3,5,13,33,37,61,73,85,133,141,145,157,177,193,213,217,277,313,345,
%T 393,397,421,445,457,481,501,537,541,553,561,565,613,661,673,697,705,
%U 717,733,745,757,793,817,865,877,885,913,933,957,973,997,1041,1093,1141,1153
%N Numbers n such that there is precisely 1 group of order n and 2 of order n + 1.
%C Being a subsequence of A003277, all the terms are odd.
%H Muniru A Asiru, <a href="/A296023/b296023.txt">Table of n, a(n) for n = 1..2000</a>
%H H. U. Besche, B. Eick and E. A. O'Brien, <a href="http://dx.doi.org/10.1142/S0218196702001115">A Millennium Project: Constructing Small Groups</a>, Internat. J. Algebra and Computation, 12 (2002), 623-644.
%H Gordon Royle, <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/cubcay/">Numbers of Small Groups</a>
%H <a href="/index/Gre#groups">Index entries for sequences related to groups</a>
%F Sequence is { n | A000001(n) = 1, A000001(n+1) = 2 }.
%e 3 is in the sequence because 3 is a cyclic number and A000001(4) = 2. 5 is in the sequence because 5 is a cyclic number and A000001(6) = 2. Although 7 is a cyclic number, 7 is not in the sequence because A000001(8) = 5.
%p with(GroupTheory): with(numtheory):
%p for n from 1 to 10^3 do if [NumGroups(n),NumGroups(n+1)]=[1, 2] then print(n); fi; od;
%o (GAP) A296023 := Filtered([1..2014], n -> [NumberSmallGroups(n), NumberSmallGroups(n+1)]=[1, 2]);
%Y Cf. A000001. Subsequence of cyclic numbers A003277.
%K nonn
%O 1,1
%A _Muniru A Asiru_, Dec 03 2017
|
