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 A182245 #38 Feb 27 2020 20:41:23 %S A182245 0,2,4,7,8,11,16,17,29,92,125,154,155,174,361,390,441,473,529,564,601, %T A182245 637,704,742,743,783,837,1003,1147,1184,1340,1341,1380,1394,1548,1549, %U A182245 1606,1665,1771,1772,1833,1896 %N A182245 Integers n such that either (a) A186053(n) does not equal A002024(n) + A182298(A025581(n)) or (b) A182298(n) does not equal 1 + A002024(n) + A186053(A025581(n)). %C A182245 Comprehensive list of the 177 terms can be found in the paper. The link proves this list of counterexamples is comprehensive, but there is nothing currently known that explains the behavior of this list. %H A182245 Michel Marcus, <a href="/A182245/b182245.txt">Table of n, a(n) for n = 1..177</a> (from Devlin papers). %H A182245 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 A182245 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 A182245 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. %Y A182245 Cf. A186053. %K A182245 nonn,fini,full %O A182245 1,2 %A A182245 _Patrick Devlin_, Apr 23 2012 %E A182245 Missing term 1548 added by _Michel Marcus_, May 27 2015