Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162255
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162255 a(n) = 2*a(n-2) for n > 2; a(1) = 3, a(2) = 2. +0
9
3, 2, 6, 4, 12, 8, 24, 16, 48, 32, 96, 64, 192, 128, 384, 256, 768, 512, 1536, 1024, 3072, 2048, 6144, 4096, 12288, 8192, 24576, 16384, 49152, 32768, 98304, 6553, 196608, 131072, 393216, 262144, 786432, 524288, 1572864, 1048576, 3145728, 2097152 (list; graph; listen)
OFFSET

1,1

COMMENT

Apparently a(n) = A074323(n+1). a(n) = A072946(n-1) for n > 1.

Partial sums are in A164053.

Binomial transform is A135532 without initial term -1. Second binomial transform is A161938.

FORMULA

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

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

PROGRAM

(PARI) {m=42; u=concat([3, 2], vector(m-2)); for(n=3, m, u[n]=2*u[n-2]); u}

CROSSREFS

Cf. A074323, A072946, A164053, A135532, A161938.

Sequence in context: A113320 A092401 A116626 this_sequence A074323 A164073 A090571

Adjacent sequences: A162252 A162253 A162254 this_sequence A162256 A162257 A162258

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 29 2009

EXTENSIONS

G.f. corrected, comments and cross-references added by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 08 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research