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 A259106 #28 Jun 05 2024 14:01:48
%S A259106 0,0,1,3,11,53,455,6873,191532,9733033,903753247,154108311046,
%T A259106 48542114686911,28401423719121393,31021002160355166801,
%U A259106 63530415842308265086523,244912778438520759443245823,1783398846284777975419599903948,24605641171260376770598003978281471
%N A259106 Number of nonisomorphic nontransitive prime tournaments on n nodes.
%H A259106 Pontus von Brömssen, <a href="/A259106/b259106.txt">Table of n, a(n) for n = 1..76</a>
%H A259106 M. Goldberg and J. W. Moon, <a href="http://dx.doi.org/10.1215/S0012-7094-70-03742-7">On the composition of two tournaments</a>, Duke Math. J. 37 (1970), 323-332. The sequence is denoted there as p(n).
%H A259106 J. W. Moon and M. Goldberg, <a href="/A000568/a000568_2.pdf">On the composition of two tournaments</a>, Duke Mathematical Journal 37.2 (1970): 323-332. [Annotated scans of pages 331 and 332 only]
%F A259106 a(n) = A002638(n) + mu(n) = A002638(n) + A008683(n). [Corrected by _Georg Fischer_, Jun 05 2024]
%F A259106 For n>1, a(n) = A259105(n) - Sum_{divisors d of n, 1<d<n} a(d)*A000568(n/d). - _Pontus von Brömssen_, Oct 04 2020
%Y A259106 Cf. A000568, A002638, A259105, A008683.
%K A259106 nonn
%O A259106 1,4
%A A259106 _N. J. A. Sloane_, Jun 23 2015
%E A259106 More terms from _Pontus von Brömssen_, Oct 04 2020