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 A007008 M2484 #38 Sep 17 2023 12:29:44 %S A007008 0,1,1,3,5,11,22,47,93,193,386,793,1586,3238,6476,13167,26333,53381, %T A007008 106762,215955,431910,872218,1744436,3518265,7036530,14177066, %U A007008 28354132,57079714,114159428,229656076,459312152,923471727,1846943453,3711565741,7423131482 %N A007008 Chvatal conjecture for radius of graph of maximal intersecting sets. %D A007008 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A007008 Jan C. Bioch and Toshihide Ibaraki, <a href="https://doi.org/10.1109/71.466629">Generating and approximating nondominated coteries</a>, IEEE Transactions on parallel and distributed systems 6 (1995), 905-914. %H A007008 D. E. Loeb and A. Meyerowitz, <a href="/A007007/a007007.pdf">The maximal intersecting family of sets graph</a>, in H. Barcelo and G. Kalai, editors, Proceedings of the Conference on Jerusalem Combinatorics 1993. AMS series Contemporary Mathematics, 1994. [broken link] %H A007008 A. Meyerowitz, <a href="https://doi.org/10.1016/0195-6698(95)90004-7">Maximal intersecting families</a>, European J. Combin. 16 (1995), no. 5, 491-501. %F A007008 It is conjectured that a(2n+1)=A000346(n-1) for n>0. - _Ralf Stephan_, May 03 2004 %F A007008 a(n) = round(2^(n-2)-binomial(n-1,floor((n-1)/2))/2), cf. Thm. 14 in the Loeb-Meyerowitz paper. - _M. F. Hasler_, Jan 14 2014 %o A007008 (PARI) A007008(n)=2^n\4-binomial(n-1,(n-1)\2)\2 \\ - _M. F. Hasler_, Jan 14 2014 %Y A007008 Cf. A000346, A007007, A001206. %K A007008 nonn %O A007008 1,4 %A A007008 _Daniel E. Loeb_