OFFSET
1,2
LINKS
T. D. Noe, Table of n, a(n) for n = 1..200
G. Kilibarda and V. Jovovic, Enumeration of some classes of T_0-hypergraphs, arXiv:1411.4187 [math.CO], 2014.
G. Kreweras, Inversion des polynômes de Bell bidimensionnels et application au dénombrement des relations binaires connexes, C. R. Acad. Sci. Paris Ser. A-B 268 1969 A577-A579.
Index entries for linear recurrences with constant coefficients, signature (84,-2774,47548,-462525,2575088,-7643820,9374400).
FORMULA
a(n) = 31^n - 5*16^n - 10*10^n + 20*9^n + 30*7^n - 60*6^n + 24*5^n.
G.f.: -x*(1+127*x-729*x^2-20467*x^3+107048*x^4+259620*x^5) / ( (9*x-1)*(6*x-1)*(7*x-1)*(5*x-1)*(31*x-1)*(10*x-1)*(16*x-1) ). - R. J. Mathar, Jun 09 2013
MATHEMATICA
Table[31^n - 5*16^n - 10*10^n + 20*9^n + 30*7^n - 60*6^n + 24*5^n, {n, 25}] (* T. D. Noe, May 29 2012 *)
PROG
(PARI) a(n)=31^n-5*16^n-10*10^n+20*9^n+30*7^n-60*6^n+24*5^n \\ Charles R Greathouse IV, Jun 16 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Goran Kilibarda, Vladeta Jovovic, Apr 14 2004
STATUS
approved