OFFSET
1,2
REFERENCES
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).
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (22,-190,820,-1849,2038,-840).
FORMULA
a(n) = (7^n -3*5^n +3*4^n +2*3^n -3*2^n +2)/6.
G.f.: -x*(280*x^5-475*x^4+339*x^3-112*x^2+17*x-1)/((x-1)*(2*x-1)*(3*x-1)*(4*x-1)*(5*x-1)*(7*x-1)). - Colin Barker, Jul 29 2012
MATHEMATICA
Table[(7^n -3*5^n +3*4^n +2*3^n -3*2^n +2)/6, {n, 1, 50}] (* G. C. Greubel, Oct 07 2017 *)
PROG
(PARI) for(n=1, 50, print1((7^n -3*5^n +3*4^n +2*3^n -3*2^n +2)/6, ", ")) \\ G. C. Greubel, Oct 07 2017
(Magma) [(7^n -3*5^n +3*4^n +2*3^n -3*2^n +2)/6: n in [1..50]]; // G. C. Greubel, Oct 07 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Goran Kilibarda, Feb 28 2000
STATUS
approved