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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161606 a(n) = GCD(A008472(n), A001222(n)). 2
1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 1, 2, 3, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 3, 2 (list; graph; refs; listen; history; internal format)
OFFSET

2,3

EXAMPLE

28 has a prime-factorization of: 2^2 * 7^1. The sum of the distinct primes dividing 28 is 2+7 = 9. The sum of the exponents in the prime-factorization of 28 is 2+1 = 3. a(28) therefore equals GCD(9,3) = 3.

MAPLE

A008472 := proc(n) if n = 1 then 0 ; else add(p, p= numtheory[factorset](n)) ; end if ; end proc:

A161606 := proc(n) igcd(A008472(n), numtheory[bigomega](n)) ; end proc:

seq(A161606(n), n=2..80) ; # R. J. Mathar, Jul 08 2011

CROSSREFS

A008472, A001222

Sequence in context: A131789 A108465 A069347 * A171398 A113607 A082586

Adjacent sequences:  A161603 A161604 A161605 * A161607 A161608 A161609

KEYWORD

nonn

AUTHOR

Leroy Quet, Jun 14 2009

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 15 17:46 EST 2012. Contains 205835 sequences.