Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152298
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152298 A threes sequence that gets more even factors out: a(n)=(3^n - 1)/(2^(3 - 2*Mod[n, 2])). +0
1
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; listen)
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: A066552 A072270 A094813 this_sequence A158956 A160130 A083229

Adjacent sequences: A152295 A152296 A152297 this_sequence A152299 A152300 A152301

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 02 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research