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.

A368748 a(n) is the number of numbers between prime(n) and prime(n+1) that are not prime powers.

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 1, 3, 3, 1, 4, 3, 1, 3, 4, 5, 1, 4, 3, 1, 5, 2, 5, 7, 3, 1, 3, 1, 3, 11, 2, 5, 1, 9, 1, 5, 5, 3, 4, 5, 1, 9, 1, 3, 1, 11, 11, 3, 1, 3, 5, 1, 8, 4, 5, 5, 1, 5, 3, 1, 8, 13, 3, 1, 3, 13, 5, 8, 1, 3, 5, 6, 5, 5, 3, 5, 7, 3, 7, 9, 1, 9, 1, 5, 3, 5, 7, 3, 1, 3
Offset: 1

Views

Author

David James Sycamore, Jan 04 2024

Keywords

Comments

Here "between" refers to numbers in the range [prime(n) + 1, prime(n+1) - 1], all of which are composite, and the sequence counts the numbers in each such range which are not prime powers. Whereas the corresponding number of prime powers seems bounded (see A080101), the number of numbers which are not prime powers is unbounded (see A014963). Conjecture: Every nonnegative integer appears in this sequence (at least once).

Examples

			Between 2 and 3 there are no other numbers so a(1) = 0.
Between 3 and 5 there is only one number (4) and it is a prime power, so a(2) = 0.
Between 5 and 7 the only number is 6 and it is not a prime power, so a(3) = 1.
Between 47 and 53 there are 5 composite numbers, but one of them (49) is a prime power, so since 47 = prime(15), a(15) = 4.
		

Crossrefs

Programs

Formula

a(n) = A001223(n) - A080101(n) - 1. - Michael De Vlieger, Jan 04 2024

Extensions

More terms from Michel Marcus, Jan 04 2024