The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A349938 Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1) < A309906(k+2) > A309906(k+3). 2
 2275, 11275, 16443, 34263, 42775, 42955, 47955, 49075, 49383, 53163, 55683, 58075, 61623, 69795, 70315, 70735, 71643, 76323, 77875, 83235, 88443, 90963, 100375, 102555, 103383, 107523, 108295, 110955, 112723, 113155, 113575, 120783, 124315, 127015, 128945, 136323 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecturally, odd numbers k > 1 such that liminf_{n->oo} d(p(n)^(k-1)-1) < liminf_{n->oo} d(p(n)^k-1) > liminf_{n->oo} d(p(n)^(k+1)-1) < liminf_{n->oo} d(p(n)^(k+2)-1) > liminf_{n->oo} d(p(n)^(k+3)-1), where p(n) = prime(n), d = A000005. Odd numbers k such that both k and k+2 are in A349937. What's the smallest term congruent to 5 modulo 6? That is to say, what's the smallest k such that both k and k+2 are in A349941? LINKS Jianing Song, Table of n, a(n) for n = 1..414 (all terms <= 10^6) PROG (PARI) isA349938(k) = if(k%2&&k>1, my(v=vector(5, n, A309906(k-2+n))); v[2]>v[1] && v[2]>v[3] && v[4]>v[3] && v[4]>v[5], 0) \\ See A309906 for its program CROSSREFS Cf. A309906, A349937. Sequence in context: A059466 A260206 A349941 * A195222 A205165 A166222 Adjacent sequences: A349935 A349936 A349937 * A349939 A349940 A349941 KEYWORD nonn AUTHOR Jianing Song, Dec 05 2021 STATUS approved

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.

Last modified December 7 11:26 EST 2023. Contains 367650 sequences. (Running on oeis4.)