Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115043
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115043 Alternately multiply and divide, with a(0)=3 and a(1)=5. +0
1
3, 5, 15, 3, 45, 15, 675, 45, 30375, 675, 20503125, 30375, 622782421875, 20503125, 12768985843505859375, 622782421875, 7952299928506168842315673828125, 12768985843505859375 (list; graph; listen)
OFFSET

1,1

COMMENT

All divisors >1 of the terms are also in the sequence.

FORMULA

a(0) = 3^1, a(1)= 5^1 a(n) = 3^a(n-1)+a(n-2)*5^a(n-1)+a(n-2) and a(n+1) = a(n)/ a(n-2) a(n) = 3^F(n)*5^F(n), where F() = Fibonacci numbers A000045.

CROSSREFS

Cf. A115033, A115034.

Sequence in context: A081393 A129326 A118562 this_sequence A058220 A100181 A111869

Adjacent sequences: A115040 A115041 A115042 this_sequence A115044 A115045 A115046

KEYWORD

easy,nonn

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 28 2006

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research