Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,6

COMMENT

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

EXAMPLE

a(8) = GCD(A007953(8), A007953(A000040(8)) = GCD(8, A007953(19)) = GCD(8,1+9) = GCD(4*2,5*2) = 2.

CROSSREFS

Cf. A000040, A081652, A066750.

Sequence in context: A061916 A076348 A113310 this_sequence A096860 A128185 A022300

Adjacent sequences: A081650 A081651 A081652 this_sequence A081654 A081655 A081656

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research