login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Numbers greater than the cube of their smallest prime factor.
8

%I #18 Aug 12 2020 01:29:29

%S 10,12,14,16,18,20,22,24,26,28,30,32,33,34,36,38,39,40,42,44,45,46,48,

%T 50,51,52,54,56,57,58,60,62,63,64,66,68,69,70,72,74,75,76,78,80,81,82,

%U 84,86,87,88,90,92,93,94,96,98,99,100,102,104,105,106,108,110,111,112

%N Numbers greater than the cube of their smallest prime factor.

%C a(n) > A020639(a(n))^3 = A088378(a(n)); complement of A088380;

%C a(n) > A088380(k) for n <= 28, a(n) < A088380(k) for n > 28.

%H Robert Israel, <a href="/A088381/b088381.txt">Table of n, a(n) for n = 1..10000</a>

%p filter:= n -> n > min(numtheory:-factorset(n))^3:

%p select(filter, [$2..200]); # _Robert Israel_, Aug 11 2020

%o (Haskell)

%o a088381 n = a088381_list !! (n-1)

%o a088381_list = filter f [1..] where

%o f x = p ^ 2 < div x p where p = a020639 x

%o -- _Reinhard Zumkeller_, Jan 08 2015

%o (PARI) isok(n) = n > factor(n)[1,1]^3; \\ _Michel Marcus_, Jan 08 2015

%Y Cf. A080257, A088383.

%Y Cf. A020639, A138511 (subsequence).

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Sep 28 2003