Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161606
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161606 a(n) = GCD(A008472(n), A001222(n)). +0
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 (list; graph; listen)
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.

CROSSREFS

A008472, A001222

Sequence in context: A131789 A108465 A069347 this_sequence A113607 A082586 A160094

Adjacent sequences: A161603 A161604 A161605 this_sequence A161607 A161608 A161609

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 14 2009

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research