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.

A368087 Numbers of the form 2^k * p^s with k>=0, s>=0, p>2 prime and 2^(k+1) < p.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 16, 17, 19, 22, 23, 25, 26, 27, 29, 31, 32, 34, 37, 38, 41, 43, 44, 46, 47, 49, 50, 52, 53, 58, 59, 61, 62, 64, 67, 68, 71, 73, 74, 76, 79, 81, 82, 83, 86, 89, 92, 94, 97, 98, 101, 103, 106, 107, 109, 113, 116, 118, 121, 122, 124, 125, 127, 128
Offset: 1

Views

Author

Hartmut F. W. Hoft, Dec 11 2023

Keywords

Comments

This sequence is a subsequence of A174905 = A241008 union A241010. The symmetric representation of sigma (cf. A237593) for a number m in this sequence consists of s+1 parts, the number of odd divisors of m, each part having width 1.

Examples

			14 = 2*7 is a term since 4 < 7.
44 = 4*11 is a term since 8 < 11.
		

Crossrefs

Programs

  • Mathematica
    propQ[n_] := Module[{fL=FactorInteger[n]}, Length[fL]==1||(Length[fL]==2&&fL[[1, 1]]==2&&fL[[1, 1]]^(fL[[1, 2]]+1)