cp's OEIS Frontend

A336411 a(n) = A029707(n+2) - 3 for n >= 1.

%I A336411 #37 Jul 19 2023 15:25:34
%S A336411 2,4,7,10,14,17,23,25,30,32,38,40,42,46,49,54,57,61,66,78,80,86,95,
%T A336411 101,106,110,113,117,137,139,141,145,149,168,170,173,175,179,187,198,
%U A336411 203,206,209,212,222,227,231,233,250,253,259,262,265,274,283,285,291
%N A336411 a(n) = A029707(n+2) - 3 for n >= 1.
%C A336411 Previous name was "Numbers k such that prime(k) - oc(k) = 4, where oc(k) is the greatest odd composite < prime(k)".
%F A336411 a(n) = A029707(n+2) - 3 = A155752(n+2) - 2. - _Hugo Pfoertner_, Oct 02 2020
%t A336411 z = 5000; d = Select[Range[2, z], ! PrimeQ@# && OddQ@# &];  (* A014076 *)
%t A336411 f[n_] := Select[d, # < Prime[n] &];
%t A336411 t = Table[Prime[n] - Max[f[n]], {n, 5, 300}]  (* A336409 *)
%t A336411 Flatten[Position[t, 2]]  (* A336410 *)
%t A336411 Flatten[Position[t, 4]]  (* this sequence *)
%Y A336411 Complement of A336410.
%Y A336411 Cf. A000040, A014076, A029707, A107770, A155752, A336409.
%K A336411 nonn
%O A336411 1,1
%A A336411 _Clark Kimberling_, Sep 06 2020
%E A336411 Offset corrected by _Mohammed Yaseen_, Jul 17 2023
%E A336411 New name from _Hugo Pfoertner_, Jul 19 2023