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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A296022 Numbers n such that there are precisely 2 groups of orders n, n + 1 and n + 2. 1
 201, 205, 325, 1045, 1653, 1857, 1965, 2041, 2301, 2305, 2605, 2637, 2653, 2853, 2973, 3241, 3445, 3505, 3721, 3757, 4173, 4405, 4585, 4693, 5005, 5217, 5241, 5341, 5685, 5757, 5853, 6685, 6745, 7285, 8005, 8845, 9325, 9441, 9777, 10201, 10293, 10417, 10833 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Equivalently, lower member of consecutive terms of A295230. LINKS Muniru A Asiru, Table of n, a(n) for n = 1..2583 H. U. Besche, B. Eick and E. A. O'Brien, A Millennium Project: Constructing Small Groups, Internat. J. Algebra and Computation, 12 (2002), 623-644. Gordon Royle, Numbers of Small Groups Index entries for sequences related to groups FORMULA Sequence is { n | A000001(n) = 2, A000001(n+1) = 2, A000001(n+2) = 2 }. EXAMPLE n = 201 -> A000001(201) = A000001(202) = A000001(203) = 2. n = 205 -> A000001(205) = A000001(206) = A000001(207) = 2. n = 1965 -> A000001(1965) = A000001(1966) = A000001(1967) = 2. MAPLE with(GroupTheory): with(numtheory): for n from 1 to 10^4 do if [NumGroups(n), NumGroups(n+1), NumGroups(n+2)]=[2, 2, 2] then print(n); fi; od; MATHEMATICA cnt = FiniteGroupCount; Select[Range[10^4], cnt[#] == cnt[#+1] == cnt[#+2] == 2&] (* Jean-François Alcover, Dec 08 2017 *) PROG (GAP) A296022 := Filtered([1..2013], n -> [NumberSmallGroups(n), NumberSmallGroups(n+1), NumberSmallGroups(n+2)]=[2, 2, 2]); CROSSREFS Cf. A000001, A054396. Subsequence of A295230. Sequence in context: A027825 A098963 A107843 * A338591 A347887 A353081 Adjacent sequences: A296019 A296020 A296021 * A296023 A296024 A296025 KEYWORD nonn AUTHOR Muniru A Asiru, Dec 03 2017 STATUS approved

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

Last modified October 4 20:53 EDT 2023. Contains 365888 sequences. (Running on oeis4.)