Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077139
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077139 a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)). +0
1
1, 2, 6, 6, 30, 5, 35, 280, 2520, 252, 2772, 231, 3003, 858, 1430, 5720, 97240, 437580, 8314020, 415701, 969969, 176358, 4056234, 2704156, 67603900, 2600150, 70204050, 10029150, 290845350, 9694845, 300540195, 9617286240, 35263382880, 1037158320 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(5) = 30 because given a(4) = 6: lcm(5, 6) / gcd(5, 6) = 30 / 1 = 30.

MATHEMATICA

k = 1; Print[k]; Do[k = LCM[n, k] / GCD[n, k]; Print[k], {n, 2, 30}] (Propper)

CROSSREFS

Essentially a duplicate of A008339, which is the main entry for this sequence.

Sequence in context: A072983 A055204 A008339 this_sequence A068629 A144361 A163641

Adjacent sequences: A077136 A077137 A077138 this_sequence A077140 A077141 A077142

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 30 2002

EXTENSIONS

Corrected and extended by Ryan Propper (rpropper(AT)stanford.edu), Jun 19 2005

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research