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-3 of 3 results.

A098389 Prime(n) - floor(log_2(prime(n))).

Original entry on oeis.org

1, 2, 3, 5, 8, 10, 13, 15, 19, 25, 27, 32, 36, 38, 42, 48, 54, 56, 61, 65, 67, 73, 77, 83, 91, 95, 97, 101, 103, 107, 121, 124, 130, 132, 142, 144, 150, 156, 160, 166, 172, 174, 184, 186, 190, 192, 204, 216, 220, 222, 226, 232, 234, 244, 249, 255, 261, 263, 269, 273
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 06 2004

Keywords

Comments

a(n) = A000040(n) - A098388(n).

Examples

			a(10) = A000040(10) - A098388(10) = 29 - 4 = 25.
		

Crossrefs

Programs

A098386 a(n) = prime(n)-Log2(n), where Log2 = A000523.

Original entry on oeis.org

2, 2, 4, 5, 9, 11, 15, 16, 20, 26, 28, 34, 38, 40, 44, 49, 55, 57, 63, 67, 69, 75, 79, 85, 93, 97, 99, 103, 105, 109, 123, 126, 132, 134, 144, 146, 152, 158, 162, 168, 174, 176, 186, 188, 192, 194, 206, 218, 222, 224, 228, 234, 236, 246, 252, 258, 264, 266, 272, 276
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 06 2004

Keywords

Examples

			a(10) = A000040(10) - A000523(10) = 29 - 3 = 26.
		

Crossrefs

Programs

  • Mathematica
    Table[Prime[n]-Floor[Log2[n]],{n,60}] (* Harvey P. Dale, Nov 20 2021 *)

A098398 Number of primes that are not less than prime(n)-Log2(Log2(prime(n))) and not greater than prime(n)+Log2(Log2(prime(n))), where Log2=A000523.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 06 2004

Keywords

Comments

a(n) = A000720(A098392(n)) - A000720(A098393(n)-1);
a(n) <= A098396(n) <= A098397(n) <= A097935(n);
a(n)<=2 for n<=6543; a(6544)=#{2^16+1=65537,65539,65543}=3.

Examples

			a(10) = #{p prime: A098392(10) <= p <= A098393(10)} =
= #{p prime: 27 <= p <= 31} = #{29,31} = 2.
		
Showing 1-3 of 3 results.