Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133579 a(n)=a(n-1)/gcd(n,a(n-1)) if gcd(n,a(n-1)) divides a(n-1), else a(n)=3*a(n-1). +0
2
1, 1, 3, 1, 3, 3, 9, 27, 81, 9, 27, 81, 27, 81, 243, 81, 243, 729, 81, 243, 729, 243, 729, 2187, 729, 2187, 6561, 243, 729, 2187, 729, 2187, 6561, 2187, 6561, 19683, 2187, 6561, 19683, 6561, 19683, 59049, 19683, 59049, 177147, 59049, 177147, 531441 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A133058.

Sequence in context: A163381 A160123 A147610 this_sequence A163270 A098743 A130560

Adjacent sequences: A133576 A133577 A133578 this_sequence A133580 A133581 A133582

KEYWORD

nonn

AUTHOR

Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Dec 26 2007

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research