OFFSET
2,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 2..300
I. Strazdins, Universal affine classification of Boolean functions, Acta Applic. Math. 46 (1997), 147-167.
Index entries for linear recurrences with constant coefficients, signature (6,-8).
FORMULA
a(n) = 2^(n-1) * (2^(n-1)+1). - Sean A. Irvine, Jan 07 2020
From Chai Wah Wu, Dec 29 2021: (Start)
a(n) = 6*a(n-1) - 8*a(n-2) for n > 3.
G.f.: x^2*(6 - 16*x)/((2*x - 1)*(4*x - 1)). (End)
MATHEMATICA
Table[2^(n-1) (2^(n-1) + 1), {n, 2, 30}] (* Vincenzo Librandi, Jan 08 2020 *)
PROG
(Magma) [2^(n-1)*(2^(n-1)+1): n in [2..30]]; // Vincenzo Librandi, Jan 08 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(6) corrected and more terms from Sean A. Irvine, Jan 07 2020
STATUS
approved