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.

A336067 Decimal expansion of the asymptotic density of numbers k divisible by A007814(k) (A336066).

Original entry on oeis.org

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

Views

Author

Amiram Eldar, Jul 07 2020

Keywords

Examples

			0.435611028292172174213122545158086502293746907188068...
		

Crossrefs

Programs

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

Formula

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

A336068 Numbers k such that the exponent of the highest power of 3 dividing k (A007949) is a divisor of k.

Original entry on oeis.org

3, 6, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 48, 51, 54, 57, 60, 66, 69, 72, 75, 78, 84, 87, 90, 93, 96, 102, 105, 108, 111, 114, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150, 156, 159, 165, 168, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2020

Keywords

Comments

All the terms are divisible by 3 by definition.
Šalát (1994) proved that the asymptotic density of this sequence is 0.287106... (A336069).

Examples

			3 is a term since A007949(3) = 1 is a divisor of 3.
		

Crossrefs

A055777 is a subsequence.

Programs

  • Mathematica
    Select[Range[200], Mod[#, 3] == 0 && Divisible[#, IntegerExponent[#, 3]] &]
  • PARI
    isok(m) = if (!(m%3), (m % valuation(m,3)) == 0); \\ Michel Marcus, Jul 08 2020

A370597 Even numbers k such that gcd(k, A007814(k)) = 1.

Original entry on oeis.org

2, 6, 8, 10, 14, 18, 22, 26, 30, 32, 34, 38, 40, 42, 46, 50, 54, 56, 58, 62, 66, 70, 74, 78, 82, 86, 88, 90, 94, 96, 98, 102, 104, 106, 110, 114, 118, 122, 126, 128, 130, 134, 136, 138, 142, 146, 150, 152, 154, 158, 162, 166, 170, 174, 178, 182, 184, 186, 190, 194, 198, 200
Offset: 1

Views

Author

Amiram Eldar, Feb 23 2024

Keywords

Comments

The asymptotic density of this sequence is Sum_{k>=0} (phi(2*k+1)/((2*k+1)*2^(2*k+2))) = 0.30845704942203403516..., where phi is Euler's totient function (A000010).

Crossrefs

Programs

  • Mathematica
    Select[2 * Range[200], CoprimeQ[#, IntegerExponent[#, 2]] &]
  • PARI
    is(n) = !(n%2) && gcd(n, valuation(n, 2)) == 1;
Showing 1-3 of 3 results.