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 A051367 #15 Sep 08 2022 08:44:59
%S A051367 0,0,0,0,224,21281,1144027,49310674,1915317642,70460566827,
%T A051367 2513684751809,88008877380908,3043421159408080,104321464544910613,
%U A051367 3552122530256316471,120307381384305672102
%N A051367 Number of 5-element families of an n-element set such that every 4 members of the family have a nonempty intersection.
%D A051367 V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6).
%H A051367 G. C. Greubel, <a href="/A051367/b051367.txt">Table of n, a(n) for n = 0..660</a>
%F A051367 a(n) = (1/5!)*(32^n - 5*30^n + 10*29^n - 10*28^n + 5*27^n - 26^n - 10*16^n + 10*15^n + 35*8^n - 35*7^n - 50*4^n + 50*3^n + 24*2^n - 24).
%t A051367 Table[(1/5!)*(32^n - 5*30^n + 10*29^n - 10*28^n + 5*27^n - 26^n - 10*16^n + 10*15^n + 35*8^n - 35*7^n - 50*4^n + 50*3^n + 24*2^n - 24), {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *)
%o A051367 (PARI) for(n=0,50, print1((1/5!)*(32^n - 5*30^n + 10*29^n - 10*28^n + 5*27^n - 26^n - 10*16^n + 10*15^n + 35*8^n - 35*7^n - 50*4^n + 50*3^n + 24*2^n - 24), ", ")) \\ _G. C. Greubel_, Oct 08 2017
%o A051367 (Magma) [(32^n - 5*30^n + 10*29^n - 10*28^n + 5*27^n - 26^n - 10*16^n + 10*15^n + 35*8^n - 35*7^n - 50*4^n + 50*3^n + 24*2^n - 24)/120: n in [0..50]]; // _G. C. Greubel_, Oct 08 2017
%Y A051367 Cf. A036239, A051180, A051181, A051182, A051183, A051184, A051185.
%K A051367 nonn
%O A051367 0,5
%A A051367 _Vladeta Jovovic_, Goran Kilibarda