Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164051 2^(2n) + 2^(n-1). +0
3
5, 18, 68, 264, 1040, 4128, 16448, 65664, 262400, 1049088, 4195328, 16779264, 67112960, 268443648, 1073758208, 4295000064, 17179934720, 68719607808, 274878169088, 1099512152064, 4398047559680, 17592188141568, 70368748371968, 281474985099264 (list; graph; listen)
OFFSET

1,1

COMMENT

A bisection of A001445.

a(n) written in base 2: 101, 10010, 1000100, 100001000, ..., i.e. number 1, n times 0, number 1, (n-1) times 0 (see A164367). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 14 2009]

FORMULA

a(n)=A001445(2n+1) = 6*a(n-1)-8*a(n-2). G.f.: -x*(-5+12*x)/((4*x-1)*(2*x-1)).

CROSSREFS

Sequence in context: A166677 A158879 A109438 this_sequence A134764 A145780 A034551

Adjacent sequences: A164048 A164049 A164050 this_sequence A164052 A164053 A164054

KEYWORD

nonn,easy

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 08 2009

EXTENSIONS

Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 11 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research