The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A164682 revision #8

A164682

a(n) = 2*a(n-2) for n > 2; a(1) = 5, a(2) = 8.

5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 16384, 20480, 32768, 40960, 65536, 81920, 131072, 163840, 262144, 327680, 524288, 655360, 1048576, 1310720, 2097152, 2621440, 4194304

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Interleaving of A020714 and A000079 without initial terms 1, 2, 4.

First differences are in A162255.

Binomial transform is A135532 without initial terms -1, 3. Fourth binomial transform is A164537.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = (9-(-1)^n)*2^(1/4*(2*n-5+(-1)^n)).

G.f.: x*(5+8*x)/(1-2*x^2).