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 A092796 #14 Sep 08 2022 08:45:13
%S A092796 1,213,14857,694485,27005881,957263493,32333393737,1064686990965,
%T A092796 34589700409561,1115777278022373,35856732186282217,
%U A092796 1149998292486777045,36843831022923582841,1179748027215029366853,37764598757179830172297,1208682260675932309564725
%N A092796 Number of connected relations.
%H A092796 G. C. Greubel, <a href="/A092796/b092796.txt">Table of n, a(n) for n = 1..660</a>
%H A092796 G. Kilibarda and V. Jovovic, <a href="https://arxiv.org/abs/1411.4187">Enumeration of some classes of T_0-hypergraphs</a>, arXiv:1411.4187 [math.CO], 2014.
%H A092796 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (91,-3299,62713,-682172,4276972,-14386144,20106240).
%F A092796 a(n) = 32^n - 5*17^n - 10*11^n + 20*10^n + 30*8^n - 60*7^n + 24*6^n.
%F A092796 G.f.: -x*(132960*x^5 + 145292*x^4 - 17528*x^3 - 1227*x^2 + 122*x + 1) / ((6*x-1)*(7*x-1)*(8*x-1)*(10*x-1)*(11*x-1)*(17*x-1)*(32*x-1)). - _Colin Barker_, Jul 13 2013
%t A092796 Table[32^n - 5*17^n - 10*11^n + 20*10^n + 30*8^n - 60*7^n + 24*6^n, {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *)
%o A092796 (PARI) for(n=0,50, print1(32^n - 5*17^n - 10*11^n + 20*10^n + 30*8^n - 60*7^n + 24*6^n, ", ")) \\ _G. C. Greubel_, Oct 08 2017
%o A092796 (Magma) [32^n - 5*17^n - 10*11^n + 20*10^n + 30*8^n - 60*7^n + 24*6^n: n in [0..50]]; // _G. C. Greubel_, Oct 08 2017
%Y A092796 Cf. A005333, A001047, A002501, A002502, A093732, A093733.
%K A092796 nonn,easy
%O A092796 1,2
%A A092796 Goran Kilibarda, _Vladeta Jovovic_, Apr 15 2004
%E A092796 Additional term from _Colin Barker_, Jul 13 2013