Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083658
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083658 a(n) = a(n-1) + a(n-2) + gcd(a(n-1),a(n-2)) for n>1, with a(0)=1, a(1)=1. +0
1
1, 1, 3, 5, 9, 15, 27, 45, 81, 135, 243, 405, 729, 1215, 2187, 3645, 6561, 10935, 19683, 32805, 59049, 98415, 177147, 295245, 531441, 885735, 1594323, 2657205, 4782969, 7971615, 14348907, 23914845, 43046721, 71744535, 129140163, 215233605 (list; graph; listen)
OFFSET

0,3

FORMULA

a(2n)=3^n, a(2n+1)=5*3^(n-1) for n>0, with a(0)=1, a(1)=1.

CROSSREFS

Sequence in context: A029485 A147087 A140190 this_sequence A018436 A018298 A017913

Adjacent sequences: A083655 A083656 A083657 this_sequence A083659 A083660 A083661

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 13 2003

page 1

Search completed in 0.026 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research