cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A102834 Numbers whose factors are primes raised to powers >= 2 and are not perfect squares.

This page as a plain text file.
%I A102834 #23 Aug 09 2025 20:06:46
%S A102834 8,27,32,72,108,125,128,200,216,243,288,343,392,432,500,512,648,675,
%T A102834 800,864,968,972,1000,1125,1152,1323,1331,1352,1372,1568,1728,1800,
%U A102834 1944,2000,2048,2187,2197,2312,2592,2700,2744,2888,3087,3125,3200,3267,3375
%N A102834 Numbers whose factors are primes raised to powers >= 2 and are not perfect squares.
%C A102834 Powerful numbers (A001694) that are not perfect squares. - _T. D. Noe_, May 03 2006
%H A102834 Amiram Eldar, <a href="/A102834/b102834.txt">Table of n, a(n) for n = 1..10000</a>
%F A102834 Sum_{n>=1} 1/a(n)^s = zeta(2*s)*(zeta(3*s)/zeta(6*s) - 1), s > 1/2. - _Amiram Eldar_, Apr 06 2023
%t A102834 Powerful[n_Integer] := (n==1) || Min[Transpose[FactorInteger[n]][[2]]]>1; Select[Range[10000], Powerful[ # ] && !IntegerQ[Sqrt[ # ]]&] (* _T. D. Noe_, May 03 2006 *)
%o A102834 (PARI) omnipnotsq(n,m)= local(a,x,j,fl=0); for(x=1,n, a=factor(x); for(j=1,omega(x), if(a[j,2]>= m,fl=1,fl=0;break); ); if(fl&issquare(x)==0,print1(x",")) )
%o A102834 (PARI) is(n)=ispowerful(n) && !issquare(n) \\ _Charles R Greathouse IV_, Oct 19 2015
%o A102834 (Python)
%o A102834 from math import isqrt
%o A102834 from sympy import integer_nthroot, mobius
%o A102834 def A102834(n):
%o A102834     def squarefreepi(n): return int(sum(mobius(k)*(n//k**2) for k in range(1, isqrt(n)+1)))
%o A102834     def bisection(f,kmin=0,kmax=1):
%o A102834         while f(kmax) > kmax: kmax <<= 1
%o A102834         while kmax-kmin > 1:
%o A102834             kmid = kmax+kmin>>1
%o A102834             if f(kmid) <= kmid:
%o A102834                 kmax = kmid
%o A102834             else:
%o A102834                 kmin = kmid
%o A102834         return kmax
%o A102834     def f(x):
%o A102834         j = isqrt(x)
%o A102834         c, l = n+x+j, 0
%o A102834         while j>1:
%o A102834             k2 = integer_nthroot(x//j**2,3)[0]+1
%o A102834             w = squarefreepi(k2-1)
%o A102834             c -= j*(w-l)
%o A102834             l, j = w, isqrt(x//k2**3)
%o A102834         c -= squarefreepi(integer_nthroot(x,3)[0])-l
%o A102834         return c
%o A102834     return bisection(f,n,n) # _Chai Wah Wu_, Sep 13 2024
%Y A102834 Cf. A000290, A001694.
%K A102834 easy,nonn
%O A102834 1,1
%A A102834 _Cino Hilliard_, Feb 27 2005