Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073039
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073039 First multiple of n in A025487. +0
2
1, 2, 6, 4, 30, 6, 210, 8, 36, 30, 2310, 12, 30030, 210, 30, 16, 510510, 36, 9699690, 60, 210, 2310, 223092870, 24, 900, 30030, 216, 420, 6469693230, 30, 200560490130, 32, 2310, 510510, 210, 36, 7420738134810, 9699690, 30030, 120, 304250263527210 (list; graph; listen)
OFFSET

1,2

FORMULA

If n = 2^e_1 * 3^e_2 * ... * Prime(k)^e_k, then a(n) = 2^max(e_1, e_2, ..., e_k) * 3^max(e_2, ..., e_k) * ... * Prime(k-1)^max(e_{k-1}, e_k) * Prime(k)^e_k = lcm_{i=1}^k Prime(k)#^e_k. In particular, if p prime, a(p) = p# (primorial, A002110). When gcd(n,m) = 1, a(n*m) = lcm(a(n), a(m)). Also, a(n^k) = a(n)^k. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 24 2006

CROSSREFS

Cf. A025487.

Cf. A002110.

Sequence in context: A006233 A164020 A057643 this_sequence A064538 A002790 A108951

Adjacent sequences: A073036 A073037 A073038 this_sequence A073040 A073041 A073042

KEYWORD

nonn

AUTHOR

Jeff Burch (gburch(AT)erols.com), Aug 22 2002

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research