login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A009194 GCD(n, sigma(n)). 15
1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 12, 1, 2, 1, 28, 1, 6, 1, 1, 3, 2, 1, 1, 1, 2, 1, 10, 1, 6, 1, 4, 3, 2, 1, 4, 1, 1, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 3, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 28, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 1, 3, 1, 1, 6, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

Also LCM of common divisors of n and sigma[n]. It equals n if n is multiply perfect. - Labos E. (labos(AT)ana.sote.hu), Aug 14 2002

A000005(a(n)) = A073802(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 12 2010]

A006530(a(n)) = A082062(n). [Reinhard Zumkeller, Jul 10 2011]

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

CROSSREFS

Cf. A192794, A179931.

Sequence in context: A167155 A080219 A040037 * A007732 A126795 A064793

Adjacent sequences:  A009191 A009192 A009193 * A009195 A009196 A009197

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.