login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066750 Greatest common divisor of n and its digit sum. 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 2, 3, 2, 1, 6, 1, 2, 9, 2, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 4, 1, 6, 1, 4, 9, 2, 1, 12, 1, 5, 3, 1, 1, 9, 5, 1, 3, 1, 1, 6, 1, 2, 9, 2, 1, 6, 1, 2, 3, 7, 1, 9, 1, 1, 3, 1, 7, 3, 1, 8, 9, 2, 1, 12, 1, 2, 3, 8, 1, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

MATHEMATICA

Table[GCD[n, Total[IntegerDigits[n]]], {n, 100}] (* Harvey P. Dale, Aug 13 2015 *)

PROG

(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=1, 1000, write("b066750.txt", n, " ", gcd(n, SumD(n))) ) } \\ Harry J. Smith, Mar 21 2010

CROSSREFS

Cf. A007953.

Sequence in context: A051802 A051801 A071205 * A217928 A326652 A222493

Adjacent sequences:  A066747 A066748 A066749 * A066751 A066752 A066753

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Jan 16 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 14:27 EST 2019. Contains 329896 sequences. (Running on oeis4.)