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.

A087430 Nonprimes n with gpf(n) > gpf(n+1), where gpf=A006530 (greatest prime factor).

This page as a plain text file.
%I A087430 #11 Jul 03 2018 21:22:01
%S A087430 14,15,26,34,35,38,39,44,49,51,55,62,63,65,69,74,76,80,86,87,94,95,99,
%T A087430 104,111,116,118,119,122,123,124,129,134,142,143,146,152,153,155,158,
%U A087430 159,161,164,174,183,185,186,188,194,195,202,203,206,207,209,214,215
%N A087430 Nonprimes n with gpf(n) > gpf(n+1), where gpf=A006530 (greatest prime factor).
%C A087430 Subsequence of A070087.
%H A087430 Robert Israel, <a href="/A087430/b087430.txt">Table of n, a(n) for n = 1..10000</a>
%p A087430 N:= 1000: # to get all terms < N
%p A087430 V:= Vector(N):
%p A087430 p:= 1:
%p A087430 do
%p A087430   p:= nextprime(p);
%p A087430   if p > N then break fi;
%p A087430   V[[seq(k*p,k=1..N/p)]]:= p
%p A087430 od:
%p A087430 select(t -> V[t] > V[t+1] and not isprime(t), [$1..N-1]); # _Robert Israel_, Jul 03 2018
%t A087430 With[{nn=250},Select[Complement[Range[nn],Prime[Range[PrimePi[ nn]]]], FactorInteger[ #][[-1,1]]>FactorInteger[#+1][[-1,1]]&]] (* _Harvey P. Dale_, Jul 14 2016 *)
%Y A087430 Cf. A087429.
%K A087430 nonn
%O A087430 1,1
%A A087430 _Reinhard Zumkeller_, Sep 02 2003