来自在线整数百科全书的问候语!http://oeis.org/ Search: id:a028234 Showing 1-1 of 1 %I A028234 %S A028234 1,1,1,1,1,3,1,1,1,5,1,3,1,7,5,1,1,9,1,5,7,11,1,3,1,13,1,7,1,15,1,1, %T A028234 11,17,7,9,1,19,13,5,1,21,1,11,5,23,1,3,1,25,17,13,1,27,11,7,19,29,1, %U A028234 15,1,31,7,1,13,33,1,17,23,35,1,9,1,37,25,19,11,39,1,5,1,41,1,21 %N A028234 If n = p_1^e_1 * ... * PK K^ EK K,PY1<…< pk k素数,然后a(n)=n/p1 1eE1,其中a(1)=1 .0%c a028 34与A067029一起用于定义与A(p^ e)=f(e)相乘的序列,作为形式的递归:a(1)=1,n=1,a(n)=f(a067029(n))* a(a028 324(n))。- 5月29日,2017岁,Reinhard Zumkeller,n,a(n)n=1…10000的表%F A028 23 4a(n)=N/A028 23 3(n).0%F A028 23 4A000 1221(A(n))=A00 1221(n)- 1;A00 1222(A(n))=A00 1222(n)-A067029(n)。- _Reinhard Zumkeller_, May 13 2006 %t A028234 a[n_] := n / Power @@ First[FactorInteger[n]]; Table[a[n], {n, 1, 84}] (* _Jean-François Alcover_, Jun 12 2012 *) %o A028234 (Haskell) %o A028234 a028234 n = n `div` a028233 n -- _Reinhard Zumkeller_, Mar 27 2013 %o A028234 (PARI) a(n) = {my(f = factor(n)); if (#f~, f[1, 1] = 1); factorback(f);} \\ _Michel Marcus_, Feb 11 2016 %o A028234 (Python) %o A028234 from sympy import factorint %o A028234 def a(n): %o A028234 f = factorint(n) %o A028234 return 1 if n==1 else n/(min(f)**f[min(f)]) # _Indranil Ghosh_, May 12 2017 %o A028234 (Scheme) (define (A028234 n) (/ n (A028233 n))) ;; Needs also code from A020639 and A028233. - _Antti Karttunen_, May 29 2017 %o A028234 (GAP) a := List(List(List(List([1..10^3], Factors), Collected), i -> i[1]), j -> j[1]^j[2]);; %o A028234 A028234 := List([1..Length(a)],i->i/a[i]); # _Muniru A Asiru_, Jan 27 2018 %Y A028234 Cf. A020639, A028233, A067029. %K A028234 nonn,nice,easy %O A028234 1,6 %A A028234 _Marc LeBrun_ %E A028234 Edited name to include a(1) = 1 by _Franklin T. Adams-Watters_, Jan 27 2018 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE