A290587 Number of irredundant sets in the n-Andrásfai graph.

3, 16, 81, 265, 729, 1786, 4060, 8833, 18786, 39586, 83273, 175463, 370615, 784290, 1661122, 3517669, 7441936, 15720066, 33145015, 69744491, 146458013, 306933394, 642004440, 1340415817, 2793811726, 5813791138, 12080174037, 25065845455, 51943066643, 107509343618, 222265656670, 459025904205, 947041760092, 1952064327682

Offset

1,1

Links

Table of n, a(n) for n=1..34.

Eric Weisstein's World of Mathematics, Andrásfai Graph

Eric Weisstein's World of Mathematics, Irredundant Set

Index entries for linear recurrences with constant coefficients, signature (10, -43, 104, -155, 146, -85, 28, -4).

Formula

From Eric W. Weisstein, Aug 21 2017: (Start)

a(n) = (-45*(8 + 3*2^n) + (1772 + 405*2^n) n - 1010*n^2 + 25*n^3 + 50*n^4 + 3*n^5)/120 for n > 3.

a(n) = 10*a(n-1) - 43*a(n-2) + 104*a(n-3) - 155*a(n-4) + 146*a(n-5) - 85*a(n-6) + 28*a(n-7) - 4*a(n-8) for n > 11.

G.f.: -((x (-3 + 14 x - 50 x^2 + 169 x^3 - 363 x^4 + 491 x^5 - 461 x^6 + 260 x^7 - 46 x^8 - 22 x^9 + 8 x^10))/((-1 + x)^6 (-1 + 2 x)^2)).

(End)

Mathematica

Table[Piecewise[{{3, n == 1}, {16, n == 2}, {81, n == 3}}, (-45 (8 + 3 2^n) + (1772 + 405 2^n) n - 1010 n^2 + 25 n^3 + 50 n^4 + 3 n^5)/120], {n, 20}] (* Eric W. Weisstein, Aug 21 2017 *)
Join[{3, 16, 81}, LinearRecurrence[{10, -43, 104, -155, 146, -85, 28, -4}, {265, 729, 1786, 4060, 8833, 18786, 39586, 83273}, 20]] (* Eric W. Weisstein, Aug 21 2017 *)
CoefficientList[Series[-((-3 + 14 x - 50 x^2 + 169 x^3 - 363 x^4 + 491 x^5 - 461 x^6 + 260 x^7 - 46 x^8 - 22 x^9 + 8 x^10)/((-1 + x)^6 (-1 + 2 x)^2)), {x, 0, 20}], x] (* Eric W. Weisstein, Aug 21 2017 *)

Crossrefs

Cf. A285272, A286879, A291053.

Sequence in context: A037773 A037661 A372324 * A072615 A020871 A037780

Adjacent sequences: A290584 A290585 A290586 * A290588 A290589 A290590

Keyword

nonn

Author

Eric W. Weisstein, Aug 07 2017

Extensions

a(9)-a(20) from Andrew Howroyd, Aug 19 2017

a(21) and above from Eric W. Weisstein, Aug 21 2017

Status

approved