login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081653 Greatest common divisor of sums of decimal digits of n and of n-th prime. 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; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
a(n) = GCD(A007953(n), A007605(n)).
LINKS
EXAMPLE
a(8) = GCD(A007953(8), A007953(A000040(8)) = GCD(8, A007953(19)) = GCD(8,1+9) = GCD(4*2,5*2) = 2.
MATHEMATICA
A081653[n_Integer]:=GCD[Plus@@IntegerDigits[n], Plus@@IntegerDigits[Prime[n]]]; [From Enrique Pérez Herrero, Aug 07 2010]
CROSSREFS
Sequence in context: A263835 A113310 A359537 * A249615 A096860 A128185
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Mar 25 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)