Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164906 a(n) = (3*2^n-(-2)^n)/2. +0
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; listen)
OFFSET

0,2

COMMENT

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.

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)).

PROGRAM

(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 this_sequence A129884 A137725 A082649

Adjacent sequences: A164903 A164904 A164905 this_sequence A164907 A164908 A164909

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 31 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research