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 A182266 #37 Feb 27 2020 20:41:45 %S A182266 0,92,154,174,361,441,473,529,564,637,742,743,783,837,1003,1147,1184, %T A182266 1340,1380,1394,1606,1665,1771,1833,1896,2173,2241,2279,2508,2581, %U A182266 2867,2945,3250,3333,3336,3503,3588,3657,3745,3925 %N A182266 Integers n such that A182298(n) does not equal 1 + A002024(n) + A186053(A025581(n)). %C A182266 Comprehensive list of the 139 numbers are in the link. The link proves this list of counterexamples is comprehensive, but there is nothing currently known that explains the behavior of this list. %H A182266 Patrick Devlin, <a href="http://arxiv.org/abs/1107.2954">Sets with High Volume and Low Perimeter</a>, arXiv:1107.2954 [math.CO], 2011. %H A182266 Patrick Devlin, <a href="http://arxiv.org/abs/1202.1331">Integer Subsets with High Volume and Low Perimeter</a>, arXiv:1202.1331 [math.CO], 2012. %H A182266 Patrick Devlin, <a href="http://www.emis.de/journals/INTEGERS/papers/m32/m32.Abstract.html">Integer Subsets with High Volume and Low Perimeter</a>, INTEGERS, Vol. 12, #A32. %K A182266 nonn,fini %O A182266 1,2 %A A182266 _Patrick Devlin_, Apr 23 2012