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.

A336069 Decimal expansion of the asymptotic density of numbers k divisible by A007949(k) (A336068).

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Jul 07 2020

Keywords

Examples

			0.287106131866347173222861038300495510591443812309388...
		

Crossrefs

Programs

  • Mathematica
    RealDigits[2 * Sum[1/k/3^(k + 1 - IntegerExponent[k, 3]), {k, 1, 1000}], 10, 100][[1]]

Formula

Equals 2 * Sum_{k>=1} 1/(k * 3^(k - A007949(k) + 1)).

A336066 Numbers k such that the exponent of the highest power of 2 dividing k (A007814) is a divisor of k.

Original entry on oeis.org

2, 4, 6, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 34, 36, 38, 42, 44, 46, 48, 50, 52, 54, 58, 60, 62, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 90, 92, 94, 98, 100, 102, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 130, 132, 134, 138, 140, 142, 144
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2020

Keywords

Comments

All the terms are even by definition.
If m is a term then m*(2*k+1) is a term for all k>=1.
Šalát (1994) proved that the asymptotic density of this sequence is 0.435611... (A336067).

Examples

			2 is a term since A007814(2) = 1 is a divisor of 2.
		

Crossrefs

A001146 and A039956 are subsequences.

Programs

  • Mathematica
    Select[Range[2, 150, 2], Divisible[#, IntegerExponent[#, 2]] &]
  • PARI
    isok(m) = if (!(m%2), (m % valuation(m,2)) == 0); \\ Michel Marcus, Jul 08 2020
    
  • Python
    from itertools import count, islice
    def A336066_gen(startvalue=2): # generator of terms >= startvalue
        return filter(lambda n:n%(~n&n-1).bit_length()==0,count(max(startvalue+startvalue&1,2),2))
    A336066_list = list(islice(A336066_gen(startvalue=3),30)) # Chai Wah Wu, Jul 10 2022
Showing 1-2 of 2 results.