OFFSET
0,1
COMMENTS
Number of twiddle factors in the first stage of a Pease Radix 4 Fast Fourier Transform.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Wikipedia, Twiddle factor
Index entries for linear recurrences with constant coefficients, signature (5,-4).
FORMULA
a(n) = 4*(3*4^n - 1).
From Colin Barker, Nov 26 2016: (Start)
a(n) = 4*A198693(n).
a(n) = 5*a(n-1) - 4*a(n-2) for n>1.
G.f.: 4*(2+x) / ((1-x) * (1-4*x)).
(End)
PROG
(PARI) Vec(4*(2+x) / ((1-x) * (1-4*x)) + O(x^30)) \\ Colin Barker, Nov 26 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Robert Koutsoyannis (bob.koutsoyannis(AT)gmail.com), Oct 14 2010
STATUS
approved