Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Mar 07 2017 00:13:32
%S 0,1,2,1,4,6,8,13,18,22,25
%N Maximal Nim values of biconnected graph on n nodes.
%H Matthew Skala, <a href="https://arxiv.org/abs/1604.04072">Graph Nimors</a>, arXiv preprint arXiv:1604.04072 [math.CO], 2016.
%K nonn,more
%O 1,3
%A _N. J. A. Sloane_, Mar 06 2017