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.

A275494 Number of primitive weird numbers (A002975) between 2^n and 2^(n+1).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 3, 2, 1, 1, 4, 2, 4, 4, 5, 4, 13, 9, 6, 18, 8, 16, 25, 24, 21, 61, 32, 47, 90, 80, 78, 195, 94, 90
Offset: 0

Views

Author

M. F. Hasler, Jul 30 2016

Keywords

Comments

It is not known unconditionally whether there are infinitely many primitive weird numbers (PWN, A002975), although numerical data provides strong evidence: even the number of weird numbers of the form 2^k*p*q (A258882, A258333) seems to increase rapidly as k increases. Melfi has shown that Cramer's conjecture implies the infiniteness of PWN.

Examples

			The first primitive weird numbers are 70, 836, 4030, 5830, 7192, 7912, 9272, 10792, ..., so there is one between 2^6 and 2^7 = 128, one between 2^9 and 2^10 = 1024, one between 2^11 and 2^12 = 4096, three between 2^12 and 2^13, etc.
		

Crossrefs

Programs

  • PARI
    a(n)=sum(n=2^n\2+1,2^n,is_A002975(n*2))

Formula

a(n) = A275493(n+1) - A275493(n).

Extensions

a(39) from Amiram Eldar, Sep 02 2023