|
Search: id:A000188
|
|
|
| A000188 |
|
(1) Number of solutions to x^2 = 0 (mod n). (2) Also square root of largest square dividing n. (3) Also Max_{ d divides n } GCD[d,n/d]. |
|
+0
67
|
|
| 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 2, 5, 1, 3, 2, 1, 1, 1, 4, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 4, 7, 5, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 3, 8, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 5, 2, 1, 1, 1, 4, 9, 1, 1, 2, 1, 1, 1, 2, 1, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Shadow transform of the squares A000290. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 02 2002
Labos Elemer (LABOS(AT)ana.sote.hu) and Henry Bottomley (se16(AT)btinternet.com) independently proved that (2) and (3) define the same sequence. Bottomley also showed that (1) and (2) define the same sequence.
Labos: Proof that (2)=(3): Let Max{[GCD[d,n/d]}=K, then d=Kx,n/d=Ky so n=KKxy where xy is the square-free part of n,otherwise K is not maximal. Observe also that g=GCD[K,xy] is not necessarily 1. Thus K is also the "maximal square-root factor" of n.
A note on square roots of numbers: we can write sqrt(n) = b*sqrt(c) where c is squarefree. Then b = A000188(n) is the "inner square root" of n, c = A007913(n), LCM(b,c) = A007947(n) = "squarefree kernel" of n and bc = A019554(n) = "outer square root" of n.
|
|
REFERENCES
|
Gerry Myerson, Trifectas in Geometric Progression, Australian Mathematical Society Gazette, 2008, to appear.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
H. Bottomley, Some Smarandache-type multiplicative sequences
Kevin A. Broughan, Restricted divisor sums, Acta Arithmetica, vol. 101, (2002), pp. 105-114.
S. R. Finch and Pascal Sebah, Squares and Cubes Modulo n (arXiv: math.NT/0604465).
N. J. A. Sloane, Transforms
|
|
FORMULA
|
a(n) = Sum_{d^2|n} phi(d), where phi = Euler totient function A000010.
Multiplicative with a(p^e) = p^[e/2]. - David W. Wilson (davidwwilson(AT)comcast.net), Aug 01, 2001.
Dirichlet series: Sum(n=1..inf, a(n)/n^s) = zeta(2*s-1)*zeta(s)/zeta(2*s), (Re(s)>1).
|
|
MAPLE
|
with(numtheory):A000188 := proc(n) local i: RETURN(op(mul(i, i=map(x->x[1]^floor(x[2]/2), ifactors(n)[2])))); end;
|
|
MATHEMATICA
|
Array[ Function[ n, Count[ Array[ PowerMod[ #, 2, n ]&, n, 0 ], 0 ] ], 100 ]
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, sum(i=1, n, i*i%n==0))
|
|
CROSSREFS
|
a(n) = n/A019554(n)
Cf. A008833, A007913, A117811, A046951, A055210.
Cf. A007913, A007947, A019554. For partial sums see A120486.
Adjacent sequences: A000185 A000186 A000187 this_sequence A000189 A000190 A000191
Sequence in context: A046854 A066170 A071773 this_sequence A097886 A088863 A053283
|
|
KEYWORD
|
nonn,easy,nice,mult
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
