cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A349941 Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).

Original entry on oeis.org

2275, 2695, 6125, 6545, 7735, 11165, 11275, 16445, 18473, 21175, 22253, 24115, 26455, 27115, 28985, 30485, 31255, 32585, 34265, 34675, 34925, 35035, 35275, 36725, 37037, 37625, 38525, 38885, 39715, 40565, 42775, 42955, 43225, 44275, 45175, 45353, 47047, 47957, 49075, 49385
Offset: 1

Views

Author

Jianing Song, Dec 05 2021

Keywords

Comments

Conjecturally, numbers k > 1 not divisible by 2 or 3 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.

Examples

			A309906(2274) = 6144 < A309906(2275) = 8192 > A309906(2276) = 1280, 2275 is not divisible by 2 or 3, so 2275 is a term.
A309906(18472) = 6144 < A309906(18473) = 8192 > A309906(18474) = 6144, 18473 is not divisible by 2 or 3, so 18473 is a term.

Crossrefs

Cf. A309906, A349937.

Programs

A349938 Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1) < A309906(k+2) > A309906(k+3).

Original entry on oeis.org

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
Offset: 1

Views

Author

Jianing Song, Dec 05 2021

Keywords

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

Crossrefs

Cf. A309906, A349937.

Programs

  • 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
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.