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

A078080 Continued fraction for constant defined in A065493.

Original entry on oeis.org

0, 1, 1, 1, 20, 9, 1, 2, 5, 1, 2, 3, 2, 3, 38, 8, 1, 16, 2, 2, 21, 1, 12, 1, 2, 1, 1, 2, 43, 2, 1, 32, 10, 3, 221, 1, 2, 9, 1, 1, 3, 3, 52, 3, 4, 19, 1, 1, 1, 1, 5, 3, 3, 2, 1, 1, 1, 1, 3, 2, 2, 1, 8, 1, 1, 10, 5, 2, 4, 1, 1, 2, 2, 1, 8, 5, 3, 1, 2, 3, 1, 1, 4, 1, 4, 1, 2, 2, 3, 3, 5, 1
Offset: 0

Views

Author

Benoit Cloitre, Dec 02 2002

Keywords

Crossrefs

Cf. A065493 (decimal expansion).

Programs

  • PARI
    contfrac((1 + prodeulerrat(1 - 2/p^2))/2) \\ Amiram Eldar, Jul 08 2024

Extensions

Offset changed and a(86) onwards corrected by Andrew Howroyd, Jul 05 2024

A065474 Decimal expansion of Product_{p prime} (1 - 2/p^2).

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Nov 19 2001

Keywords

Comments

Density of A007674, squarefree n such that n + 1 is squarefree. - Charles R Greathouse IV, Aug 10 2011
Product_{k>=1} (1 - 2/k^2) = sin(sqrt(2)*Pi) / (sqrt(2)*Pi). - Vaclav Kotesovec, May 23 2020
The asymptotic probability that, for two integers k and m, 0 < k <= m, we have gcd(k*(k+1), m) = 1 (when k and m are chosen at random in the range 1..n and n->oo) (Tóth and Sándor, 1989). - Amiram Eldar, Apr 29 2023

Examples

			0.322634098939244670579531692548...
		

References

  • Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.

Crossrefs

Programs

  • Mathematica
    $MaxExtraPrecision = 800; digits = 98; terms = 800; P[n_] := PrimeZetaP[n]; LR = Join[{0, 0}, LinearRecurrence[{0, 2}, {-4, 0}, terms + 10]]; r[n_Integer] := LR[[n]]; Exp[NSum[r[n]*P[n - 1]/(n - 1), {n, 3, terms}, NSumTerms -> terms, WorkingPrecision -> digits + 10]] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Apr 18 2016 *)
  • PARI
    prodeulerrat(1 - 2/p^2) \\ Amiram Eldar, Mar 16 2021

Extensions

Edited by Dean Hickerson, Sep 10 2002
More digits from Vaclav Kotesovec, Dec 18 2019

A333634 Numbers with an even number of non-unitary prime divisors.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 72, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 100, 101, 102
Offset: 1

Views

Author

Amiram Eldar, May 23 2020

Keywords

Comments

Numbers that have an even number of distinct prime factors raised to a power larger than 1.
The asymptotic density of this sequence is 0.661317... (A065493, Feller and Tornier, 1933).

Examples

			1 is a term since it has 0 prime divisors, and 0 is even.
180 is a term since 180 = 2^2 * 3^2 * 5 has 2 prime divisors, 2 and 3, with exponents larger than 1 in its prime factorization, and 2 is even.
		

Crossrefs

Cf. A056170, A065493, A190641, A327877 (complement).

Programs

  • Mathematica
    Select[Range[100], EvenQ @ Count[FactorInteger[#][[;;,2]], u_ /; u > 1]  &]

Formula

Numbers k with A056170(k) == 0 (mod 2).

A327877 Numbers having an odd number of non-unitary prime factors.

Original entry on oeis.org

4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 40, 44, 45, 48, 49, 50, 52, 54, 56, 60, 63, 64, 68, 75, 76, 80, 81, 84, 88, 90, 92, 96, 98, 99, 104, 112, 116, 117, 120, 121, 124, 125, 126, 128, 132, 135, 136, 140, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168
Offset: 1

Views

Author

Amiram Eldar, Sep 28 2019

Keywords

Comments

Differs from A190641(n) from n = 310 (900, the least number with 3 non-unitary prime factors, is in this sequence but not in A190641).
The asymptotic density of the numbers in this sequence is 0.338682... = 1 - A065493.

Crossrefs

Cf. A056170, A065493, A190641, A333634 (complement).

Programs

A340565 Decimal expansion of the Product_{lesser twin primes p == 5 (mod 6)} 1/(1 - 1/p^2).

Original entry on oeis.org

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

Views

Author

Artur Jasinski, Jan 11 2021

Keywords

Comments

Lesser twin primes A001359 (with the exception of the first prime, 3) are congruent to 5 mod 6: this constant is smaller than A340576.
By extrapolating method most probably the next two decimal digits are 1.056932291(46).
The known high-precision algorithms for Euler products are based on the Dirichlet L function and the Moebius inversion formula (see Mathematica procedure of Jean-François Alcover in A175646).
The constant is between 1.056932291453... and 1.056932291494. - R. J. Mathar, Feb 14 2025

Examples

			1.0569322914...
		

Crossrefs

Extensions

One more digit confirmed by a bracketing of partial products - R. J. Mathar, Feb 14 2025
Showing 1-5 of 5 results.