OFFSET
1,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
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.
V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, (English translation), Discrete Mathematics and Applications, 9, (1999), no. 6.
Index entries for linear recurrences with constant coefficients, signature (25,-241,1135,-2734,3160,-1344).
FORMULA
a(n) = (8^n - 7^n - 6*4^n + 6*3^n + 11*2^n - 17)/6.
a(n) = Sum_{j=1..n} (-1)^(j+1)*C(n, j)*C(2^(n-j)-1, k-1), where k=4.
Also: 1/(k-1)!*Sum_{j=1..k} s(k, j)*(2^((j-1)*n)-(2^(j-1)-1)^n), where s(k, j) are Stirling numbers of the first kind (and k=4).
G.f.: x^3*(3 + 59*x - 692*x^2 + 1344*x^3) / ( (x-1)*(4*x-1)*(3*x-1)*(2*x-1)*(8*x-1)*(7*x-1) ). - R. J. Mathar, Jun 13 2013
MATHEMATICA
Table[(8^n - 7^n - 6*4^n + 6*3^n + 11*2^n - 17)/6, {n, 1, 50}] (* G. C. Greubel, Oct 08 2017 *)
PROG
(PARI) for(n=1, 50, print1((8^n - 7^n - 6*4^n + 6*3^n + 11*2^n - 17)/6, ", ")) \\ G. C. Greubel, Oct 08 2017
(Magma) [(8^n - 7^n - 6*4^n + 6*3^n + 11*2^n - 17)/6: n in [1..50]]; // G. C. Greubel, Oct 08 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Goran Kilibarda
EXTENSIONS
More terms from James A. Sellers
STATUS
approved