OFFSET
0,4
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Moussa Benoumhani, The Number of Topologies on a Finite Set, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.6.
Index entries for linear recurrences with constant coefficients, signature (15,-85,225,-274,120).
FORMULA
a(n) = 3! Stirling2(n, 3) + 3/2*4! Stirling2(n, 4) + 5! Stirling2(n, 5).
From Colin Barker, Jan 30 2017: (Start)
a(n) = 2 - 2^(2+n) - 7*2^(2*n-1) + 5*3^n + 5^n for n>5.
a(n) = 15*a(n-1) - 85*a(n-2) + 225*a(n-3) - 274*a(n-4) + 120*a(n-5) for n>5.
G.f.: 6*x^3*(1 - 3*x + 10*x^2) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)*(1 - 5*x)).
(End)
MATHEMATICA
LinearRecurrence[{15, -85, 225, -274, 120}, {0, 0, 0, 6, 72, 630}, 30] (* Harvey P. Dale, Oct 22 2018 *)
PROG
(PARI) a(n) = 3!*stirling(n, 3, 2) + 3*4!*stirling(n, 4, 2)/2 + 5!*stirling(n, 5, 2) \\ Colin Barker, Jan 30 2017
(PARI) concat(vector(3), Vec(6*x^3*(1 - 3*x + 10*x^2) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)*(1 - 5*x)) + O(x^30))) \\ Colin Barker, Jan 30 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Submitted on behalf of Moussa Benoumhani by Geoffrey Critzer, Jan 29 2017
STATUS
approved