[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232494 If n mod 2 = 0 then 2^(n-1)*(3^n+3*3^(n/2)-2) otherwise 2^(n-1)*(3^n+5*3^((n-1)/2)-2). 0
1, 6, 32, 160, 848, 4576, 25856, 148480, 870656, 5142016, 30605312, 182640640, 1092866048, 6545268736, 39235813376, 235271618560, 1411199860736, 8465479499776, 50787717742592, 304705668382720, 1828172095029248, 10968784904912896, 65811966429495296, 394868826560266240, 2369204043294703616 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
G. Wu, M. G. Parker, A complementary construction using mutually unbiased bases, arXiv preprint arXiv:1309.0157 [cs.IT], 2013 [See Th. 2].
FORMULA
G.f.: ( -1+2*x+16*x^2 ) / ( (6*x-1)*(2*x-1)*(12*x^2-1) ). - R. J. Mathar, Dec 04 2013
a(n) = 2^(n-2) * (2 * 3^n - 4 + 3^((n-1)/2)(5 + 3*sqrt(3) + (-1)^n * (3*sqrt(3) - 5))). - Benedict W. J. Irwin, Sep 27 2016
E.g.f.: (1/12)*exp(-2*sqrt(3)*x)*(9 - 5*sqrt(3) + (9 + 5*sqrt(3))*exp(4*sqrt(3)*x) - 12*exp(2*(1 + sqrt(3))*x) + 6*exp(2*(3 + sqrt(3))*x)). - Stefano Spezia, Jan 09 2019
MAPLE
f:=proc(n)
if (n mod 2) = 0 then 2^(n-1)*(3^n+3*3^(n/2)-2) else
2^(n-1)*(3^n+5*3^((n-1)/2)-2) fi; end;
[seq(f(n), n=0..40)];
MATHEMATICA
Table[2^(n - 2) * (-4 + 2 3^n + 3^(n/2 - 1/2)(5 - 5(-1)^n + 3Sqrt[3] + 3(-1)^n Sqrt[3])), {n, 0, 20}] (* Benedict W. J. Irwin, Sep 27 2016 *)
LinearRecurrence[{8, 0, -96, 144}, {1, 6, 32, 160}, 25] (* Jean-François Alcover, Jan 09 2019 *)
CROSSREFS
Sequence in context: A231992 A292044 A006668 * A037530 A083320 A097139
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 02 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 13:45 EDT 2024. Contains 375517 sequences. (Running on oeis4.)