This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A298430 #6 Jan 28 2018 13:45:24
%S A298430 82323,390446,622916,774548,793827,876932
%N A298430 Numbers n such that there are precisely 13 groups of orders n and n + 1.
%C A298430 Equivalently, lower member of consecutive terms of A292896.
%H A298430 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 A298430 Gordon Royle, <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/cubcay/">Numbers of Small Groups</a>
%H A298430 <a href="/index/Gre#groups">Index entries for sequences related to groups</a>
%F A298430 Sequence is { n | A000001(n) = 13, A000001(n+1) = 13 }.
%e A298430 For n = 82323, A000001(82323) = A000001(82324) = 13.
%e A298430 For n = 390446, A000001(390446) = A000001(390447) = 13.
%e A298430 For n = 622916, A000001(622916) = A000001(622917) = 13.
%p A298430 with(GroupTheory): for n from 1 to 10^6 do if [NumGroups(n), NumGroups(n+1)] = [13, 13] then print(n); fi; od;
%Y A298430 Cf. A000001. Subsequence of A292896 (Numbers n having precisely 13 groups of order n). Numbers n having precisely k groups of orders n and n+1: A295230 (k=2), A295990 (k=4), A295991 (k=5), A295992 (k=6), A295993 (k=8), A298427 (k=9), A298428 (k=10), A295994 (k=11), A298429 (k=12), this sequence (k=13), A298431 (k=14), A295995 (k=15).
%K A298430 nonn,more
%O A298430 1,1
%A A298430 _Muniru A Asiru_, Jan 19 2018