|
| |
|
|
A164906
|
|
a(n) = (3*2^n-(-2)^n)/2.
|
|
3
| |
|
|
1, 4, 4, 16, 16, 64, 64, 256, 256, 1024, 1024, 4096, 4096, 16384, 16384, 65536, 65536, 262144, 262144, 1048576, 1048576, 4194304, 4194304, 16777216, 16777216, 67108864, 67108864, 268435456, 268435456, 1073741824, 1073741824, 4294967296
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Interleaving of A000302 and 4*A000302.
Unsigned version of A141125.
Binomial transform is A164907. Second binomial transform is A164908. Third binomial transform is A057651. Fourth binomial transform is A016129.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| a(n) = 4*a(n-2) for n > 1; a(0) = 1, a(1) = 4.
G.f.: (1+4*x)/((1+2*x)*(1-2*x)).
a(n+3) = a(n+2)*a(n+1)/a(n). [Reinhard Zumkeller, Mar 04 2011]
|
|
|
PROG
| (MAGMA) [ (3*2^n-(-2)^n)/2: n in [0..31] ];
|
|
|
CROSSREFS
| Cf. A000302 (powers of 4), A141125, A164907, A164908, A057651, A016129.
Sequence in context: A056450 A141125 A164111 * A170833 A129884 A137725
Adjacent sequences: A164903 A164904 A164905 * A164907 A164908 A164909
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 31 2009
|
| |
|
|
