login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152298 A threes sequence that gets more even factors out: a(n)=(3^n - 1)/(2^(3 - 2*Mod[n, 2])). 0
0, 1, 1, 13, 10, 121, 91, 1093, 820, 9841, 7381, 88573, 66430, 797161, 597871, 7174453, 5380840, 64570081, 48427561, 581130733, 435848050, 5230176601, 3922632451, 47071589413, 35303692060, 423644304721, 317733228541 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

FORMULA

a(n)=(3^n - 1)/(2^(3 - 2*Mod[n, 2])).

MATHEMATICA

Clear[a, n];

a[n_] := (3^n - 1)/(2^(3 - 2*Mod[n, 2]));

Table[a[n], {n, 0, 30}]

CROSSREFS

A003462

Sequence in context: A180864 A206608 A094813 * A158956 A160130 A206607

Adjacent sequences:  A152295 A152296 A152297 * A152299 A152300 A152301

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 02 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:18 EST 2012. Contains 205860 sequences.