|
Search: id:A061680
|
|
|
| A061680 |
|
GCD of d(n^2) and d(n). |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 3, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,2000
|
|
FORMULA
|
a(n)=GCD[A000005(A000290(n)), A000005(n)] = GCD[A048691(n), A000005(n)]
|
|
EXAMPLE
|
This GCD can only be odd since d(w^2) is odd. n=4608,a(4608)=GCD[d(21233664),d(4608)]=GFCD[95,30]=5
|
|
PROGRAM
|
(PARI) { for (n=1, 2000, write("b061680.txt", n, " ", gcd(numdiv(n^2), numdiv(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 26 2009]
|
|
CROSSREFS
|
A000005, A000290, A048691.
Sequence in context: A130046 A166123 A014491 this_sequence A097558 A124385 A106478
Adjacent sequences: A061677 A061678 A061679 this_sequence A061681 A061682 A061683
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 18 2001
|
|
EXTENSIONS
|
OFFSET changed from 0,12 to 1,12 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 26 2009
|
|
|
Search completed in 0.002 seconds
|
