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
%I A081653
%S A081653 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,
%T A081653 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,
%U A081653 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
%N A081653 Greatest common divisor of sums of decimal digits of n and of n-th prime.
%C A081653 a(n) = GCD(A007953(n), A007605(n)).
%e A081653 a(8) = GCD(A007953(8), A007953(A000040(8)) = GCD(8, A007953(19)) = GCD(8,
               1+9) = GCD(4*2,5*2) = 2.
%Y A081653 Cf. A000040, A081652, A066750.
%Y A081653 Sequence in context: A061916 A076348 A113310 this_sequence A096860 A128185 
               A022300
%Y A081653 Adjacent sequences: A081650 A081651 A081652 this_sequence A081654 A081655 
               A081656
%K A081653 nonn,base
%O A081653 1,6
%A A081653 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research