Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146529
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146529 A two level sequence: v(n)=2*(If[n == 0, 0, 2^(n - 1)] + 2); a(n)=If[n == 0, 6, (v[n] + v[n - 1] - 2)]. +0
2
6, 8, 12, 18, 30, 54, 102, 198, 390, 774, 1542, 3078, 6150, 12294, 24582, 49158, 98310, 196614, 393222, 786438, 1572870, 3145734, 6291462, 12582918, 25165830, 50331654, 100663302, 201326598, 402653190, 805306374, 1610612742 (list; graph; listen)
OFFSET

0,1

FORMULA

v(n)=2*(If[n == 0, 0, 2^(n - 1)] + 2); a(n)=If[n == 0, 6, (v[n] + v[n - 1] - 2)].

a(n) = 3*a(n-1)-2*a(n-2), n>4. a(n) = 6+3*2^(n-1) = 6+A007283(n-1), n>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 21 2008]

MATHEMATICA

v[n_] := 2*(If[n == 0, 0, 2^(n - 1)] + 2); Table[v[n], {n, 0, 30}]; Table[If[n == 0, 6, (v[n] + v[n - 1] - 2)], {n, 0, 30}]

CROSSREFS

Sequence in context: A090259 A089241 A027691 this_sequence A062533 A077670 A072057

Adjacent sequences: A146526 A146527 A146528 this_sequence A146530 A146531 A146532

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 30 2008

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research