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!)
 A349937 Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1). 2
 315, 525, 693, 765, 825, 945, 1125, 1155, 1323, 1395, 1575, 1683, 1725, 1755, 1785, 1815, 1845, 1995, 2205, 2275, 2277, 2415, 2457, 2475, 2535, 2565, 2691, 2695, 2793, 2805, 2835, 2907, 3003, 3045, 3285, 3315, 3375, 3465, 3591, 3645, 3675, 3705, 3735, 3825, 3885 (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), where p(n) = prime(n), d = A000005. If k is odd, then A079612(k) = 2, so A309906(k) is usually smaller than either A309906(k-1) or A309906(k+1) (or both). This sequence lists the exceptions. LINKS Table of n, a(n) for n=1..45. EXAMPLE A309906(314) = 128 < A309906(315) = 8192 > A309906(316) = 2560, so 315 is a term. PROG (PARI) isA349937(k) = (k%2&&k>1) && A309906(k)>A309906(k-1) && A309906(k)>A309906(k+1) \\ See A309906 for its program CROSSREFS Cf. A309906, A349938, A349941. Sequence in context: A256575 A295990 A349868 * A076773 A114807 A109130 Adjacent sequences: A349934 A349935 A349936 * A349938 A349939 A349940 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 11 07:17 EST 2023. Contains 367717 sequences. (Running on oeis4.)