Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145563 a(0)=0 and a(n+1)=3a(n)+2^(n+2). +0
1
0, 4, 20, 76, 260, 844, 2660, 8236, 25220, 76684, 232100, 700396, 2109380, 6344524, 19066340, 57264556, 171924740, 516036364, 1548633380, 4646948716, 13942943300, 41833024204, 125507461220, 376539160876, 1129651037060, 3389020220044, 10167194877860 (list; graph; listen)
OFFSET

0,2

COMMENT

Suggested by a discussion on the Sequence Fans Mailing List; the formula is due to Andrew V. Sutherland.

FORMULA

a(n)=4*(3^n-2^n)=4*A001047(n). G.f.: 4x/((1-2x)(1-3x)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 18 2009]

a(n) = 4*(3^n - 2^n) = A056182(n)*2. [From Omar E. Pol (info(AT)polprimos.com), Mar 18 2009]

a(n) = A001047(n)*4. [From Omar E. Pol (info(AT)polprimos.com), Mar 18 2009]

CROSSREFS

Cf. A056182. [From Omar E. Pol (info(AT)polprimos.com), Mar 18 2009]

Cf. A001047. [From Omar E. Pol (info(AT)polprimos.com), Mar 18 2009]

Sequence in context: A061981 A054611 A121257 this_sequence A125669 A082138 A074358

Adjacent sequences: A145560 A145561 A145562 this_sequence A145564 A145565 A145566

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mar 18 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research