|
| |
|
|
A055229
|
|
Greatest common divisor of largest square dividing n and squarefree part of n.
|
|
32
| |
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
COMMENTS
| Record values occur at cubes of squarefree numbers: a(A062838(n))=A005117(n) and a(m) < A005117(n) for m < A062838(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2010]
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2010]
|
|
|
FORMULA
| a(n) = GCD[A008833(n), A007913(n)]
Multiplicative with a(p^e)=1 for even e, a(p)=1, a(p^e)=p for odd e>1. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 30 2002
|
|
|
CROSSREFS
| A008833, A007913, A000188.
Sequence in context: A043289 A063775 A053164 * A062379 A043288 A057523
Adjacent sequences: A055226 A055227 A055228 * A055230 A055231 A055232
|
|
|
KEYWORD
| nice,nonn,mult
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Jun 21 2000
|
| |
|
|
