The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336411 a(n) = A029707(n+2) - 3 for n >= 1. 2

%I #37 Jul 19 2023 15:25:34

%S 2,4,7,10,14,17,23,25,30,32,38,40,42,46,49,54,57,61,66,78,80,86,95,

%T 101,106,110,113,117,137,139,141,145,149,168,170,173,175,179,187,198,

%U 203,206,209,212,222,227,231,233,250,253,259,262,265,274,283,285,291

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

%C Previous name was "Numbers k such that prime(k) - oc(k) = 4, where oc(k) is the greatest odd composite < prime(k)".

%F a(n) = A029707(n+2) - 3 = A155752(n+2) - 2. - _Hugo Pfoertner_, Oct 02 2020

%t z = 5000; d = Select[Range[2, z], ! PrimeQ@# && OddQ@# &]; (* A014076 *)

%t f[n_] := Select[d, # < Prime[n] &];

%t t = Table[Prime[n] - Max[f[n]], {n, 5, 300}] (* A336409 *)

%t Flatten[Position[t, 2]] (* A336410 *)

%t Flatten[Position[t, 4]] (* this sequence *)

%Y Complement of A336410.

%Y Cf. A000040, A014076, A029707, A107770, A155752, A336409.

%K nonn

%O 1,1

%A _Clark Kimberling_, Sep 06 2020

%E Offset corrected by _Mohammed Yaseen_, Jul 17 2023

%E New name from _Hugo Pfoertner_, Jul 19 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 08:34 EDT 2024. Contains 373329 sequences. (Running on oeis4.)