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.
%I A089191 #19 Feb 16 2021 04:10:07
%S A089191 2,3,5,11,13,17,19,29,37,41,43,59,61,67,73,83,89,97,101,109,113,131,
%T A089191 137,139,149,157,163,173,179,181,193,197,211,227,229,233,241,251,257,
%U A089191 277,281,283,293,307,313,317,331,337,347,349,353,373,379,389,397,401,409
%N A089191 Primes p such that p+1 is cubefree.
%C A089191 The ratio of the count of primes p <= n such that p+1 is cubefree to the count of primes <= n converges to 0.69+ slightly higher than the p-1 variety.
%C A089191 More accurately, the density of this sequence within the primes is Product_{p prime} (1-1/(p^2*(p-1))) = 0.697501... (A065414) (Mirsky, 1949). - _Amiram Eldar_, Feb 16 2021
%H A089191 Robert Israel, <a href="/A089191/b089191.txt">Table of n, a(n) for n = 1..10000</a>
%H A089191 Leon Mirsky, <a href="http://www.jstor.org/stable/2305811">The number of representations of an integer as the sum of a prime and a k-free integer</a>, American Mathematial Monthly 56:1 (1949), pp. 17-19.
%e A089191 43 is included because 43+1 = 2^2*11.
%e A089191 71 is omitted because 71+1 = 2^3*3^2.
%p A089191 filter:= t -> isprime(t) and max(map(s -> s[2], ifactors(t+1)[2]))<3:
%p A089191 select(filter, [2,seq(i,i=3..1000,2)]); # _Robert Israel_, Mar 18 2018
%t A089191 Select[Prime[Range[100]],Max[Transpose[FactorInteger[#+1]][[2]]]<3&] (* _Harvey P. Dale_, Jun 06 2013 *)
%o A089191 (PARI) is(n) = isprime(n) && vecmax(factor(n+1)[,2]) < 3 \\ _Amiram Eldar_, Feb 16 2021
%Y A089191 Cf. A004709, A049097, A065414, A089189.
%K A089191 easy,nonn
%O A089191 1,1
%A A089191 _Cino Hilliard_, Dec 08 2003