|
| |
|
|
A066750
|
|
Greatest common divisor of n and its digit sum.
|
|
3
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
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))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 21 2010]
|
|
|
CROSSREFS
| Cf. A007953.
Sequence in context: A051802 A051801 A071205 * A032762 A180410 A071650
Adjacent sequences: A066747 A066748 A066749 * A066751 A066752 A066753
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 16, 2002
|
| |
|
|
