Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081652
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081652 Greatest common divisor of n and sum of decimal digits of n-th prime. +0
2
1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 7, 1, 8, 1, 1, 1, 4, 1, 2, 1, 1, 1, 2, 1, 4, 1, 5, 1, 1, 11, 1, 7, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 11, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 8, 1, 1, 1, 4, 1, 2, 1, 8, 1, 2, 1, 10, 1, 17, 1, 4 (list; graph; listen)
OFFSET

1,6

COMMENT

a(n) = GCD(n, A007605(n)).

EXAMPLE

a(16) = GCD(16, A007953(A000040(16)) = GCD(16, A007953(53)) = GCD(16,5+3) = GCD(8*2,8) = 8.

CROSSREFS

Cf. A000040, A007953, A081653, A066750.

Sequence in context: A084217 A025903 A101211 this_sequence A140816 A029433 A088203

Adjacent sequences: A081649 A081650 A081651 this_sequence A081653 A081654 A081655

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 25 2003

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research