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 A053153 #18 Jul 02 2025 16:01:59
%S A053153 0,0,13,170,1605,13390,104993,794010,5867245,42681830,307120473,
%T A053153 2192847250,15570312485,110116458270,776528783953,5464646634890,
%U A053153 38398786511325,269529019274710,1890415785439433,13251574765596930
%N A053153 Number of 3-element intersecting families whose union is an n-element set.
%D A053153 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 A053153 G. C. Greubel, <a href="/A053153/b053153.txt">Table of n, a(n) for n = 1..1000</a>
%H A053153 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (22,-190,820,-1849,2038,-840).
%F A053153 a(n) = 1/3!*(7^n -3*5^n +3*4^n -4*3^n +3*2^n +2).
%F A053153 G.f. -x^3*(280*x^3 -335*x^2 +116*x -13)/((x-1)*(2*x-1)*(3*x-1)*(4*x-1)*(5*x-1)*(7*x-1)). - _Colin Barker_, Jul 29 2012
%t A053153 LinearRecurrence[{22,-190,820,-1849,2038,-840},{0,0,13,170,1605,13390}, 20] (* _Harvey P. Dale_, Aug 16 2015 *)
%o A053153 (PARI) for(n=1,25, print1((7^n -3*5^n +3*4^n -4*3^n +3*2^n +2)/6, ", ")) \\ _G. C. Greubel_, Oct 07 2017
%o A053153 (Magma) [(7^n -3*5^n +3*4^n -4*3^n +3*2^n +2)/6: n in [1..25]]; // _G. C. Greubel_, Oct 07 2017
%Y A053153 Cf. A051180.
%K A053153 easy,nonn
%O A053153 1,3
%A A053153 _Vladeta Jovovic_, Goran Kilibarda, Feb 28 2000
%E A053153 More terms from _James Sellers_, Mar 01 2000