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

A248930 Decimal expansion of c = 2*Product_{prime p == 3 (mod 4)} (1 - 2/(p*(p-1)^2)), a constant related to the problem of integral Apollonian circle packings.

Original entry on oeis.org

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

Views

Author

Jean-François Alcover, Oct 17 2014

Keywords

Examples

			1.64933768909803...
		

Crossrefs

Programs

  • Mathematica
    kmax = 25; Do[ P[k] = Product[p = Prime[n]; If[Mod[p, 4] == 3, 1 - 2/(p*(p - 1)^2) // N[#, 40]&, 1], {n, 1, 2^k}]; Print["P(", k, ") = ", P[k]], {k, 10, kmax}]; c = 2*P[kmax]; RealDigits[c, 10, 15] // First
    (* -------------------------------------------------------------------------- *)
    $MaxExtraPrecision = 1000; digits = 121;
    f[p_] := (1 - 2/(p*(p - 1)^2));
    coefs = Rest[CoefficientList[Series[Log[f[1/x]], {x, 0, 1000}], x]];
    S[m_, n_, s_] := (t = 1; sums = 0; difs = 1; While[Abs[difs] > 10^(-digits - 5) || difs == 0, difs = (MoebiusMu[t]/t) * Log[If[s*t == 1, DirichletL[m, n, s*t], Sum[Zeta[s*t, j/m]*DirichletCharacter[m, n, j]^t, {j, 1, m}]/m^(s*t)]]; sums = sums + difs; t++]; sums);
    P[m_, n_, s_] := 1/EulerPhi[m] * Sum[Conjugate[DirichletCharacter[m, r, n]] * S[m, r, s], {r, 1, EulerPhi[m]}] + Sum[If[GCD[p, m] > 1 && Mod[p, m] == n, 1/p^s, 0], {p, 1, m}];
    m = 2; sump = 0; difp = 1; While[Abs[difp] > 10^(-digits - 5) || difp == 0, difp = coefs[[m]]*P[4, 3, m]; sump = sump + difp; m++];
    RealDigits[Chop[N[2*Exp[sump], digits]], 10, digits - 1][[1]] (* Vaclav Kotesovec, Jan 16 2021 *)

Extensions

More digits from Vaclav Kotesovec, Jun 27 2020

A248938 Decimal expansion of beta = G^2*(2/3)*Product_{prime p == 3 (mod 4)} (1 - 2/(p*(p-1)^2)) (where G is Catalan's constant), a constant related to the problem of integral Apollonian circle packings.

Original entry on oeis.org

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

Views

Author

Jean-François Alcover, Oct 17 2014

Keywords

Examples

			0.4612609086138613...
		

Crossrefs

Programs

  • Mathematica
    kmax = 25; Clear[P]; Do[P[k] = Product[p = Prime[n]; If[Mod[p, 4] == 3 , 1 - 2/(p*(p - 1)^2) // N[#, 40]&, 1], {n, 1, 2^k}]; Print["P(", k, ") = ", P[k]], {k, 10, kmax}]; beta = Catalan^2*(2/3)*P[kmax]; RealDigits[beta, 10, 16] // First
    (* -------------------------------------------------------------------------- *)
    $MaxExtraPrecision = 1000; digits = 121;
    f[p_] := (1 - 2/(p*(p - 1)^2));
    coefs = Rest[CoefficientList[Series[Log[f[1/x]], {x, 0, 1000}], x]];
    S[m_, n_, s_] := (t = 1; sums = 0; difs = 1; While[Abs[difs] > 10^(-digits - 5) || difs == 0, difs = (MoebiusMu[t]/t) * Log[If[s*t == 1, DirichletL[m, n, s*t], Sum[Zeta[s*t, j/m]*DirichletCharacter[m, n, j]^t, {j, 1, m}]/m^(s*t)]]; sums = sums + difs; t++]; sums);
    P[m_, n_, s_] := 1/EulerPhi[m] * Sum[Conjugate[DirichletCharacter[m, r, n]] * S[m, r, s], {r, 1, EulerPhi[m]}] + Sum[If[GCD[p, m] > 1 && Mod[p, m] == n, 1/p^s, 0], {p, 1, m}];
    m = 2; sump = 0; difp = 1; While[Abs[difp] > 10^(-digits - 5) || difp == 0, difp = coefs[[m]]*P[4, 3, m]; sump = sump + difp; m++];
    RealDigits[Chop[N[2*Catalan^2/3 * Exp[sump], digits]], 10, digits - 1][[1]] (* Vaclav Kotesovec, Jan 16 2021 *)

Formula

beta = (G^2/3)*A248930, where G is Catalan's constant A006752.

Extensions

More digits from Vaclav Kotesovec, Jun 27 2020

A189226 Curvatures in the nickel-dime-quarter Apollonian circle packing, ordered first by generation and then by size.

Original entry on oeis.org

-11, 21, 24, 28, 40, 52, 61, 157, 76, 85, 96, 117, 120, 132, 181, 213, 237, 376, 388, 397, 132, 156, 160, 189, 204, 205, 216, 237, 253, 285, 288, 309, 316, 336, 349, 405, 412, 421, 453, 460, 469, 472, 517, 544, 565, 616, 628, 685, 717, 741, 1084, 1093, 1104, 1125, 1128, 1140
Offset: 1

Views

Author

Jonathan Sondow, Apr 18 2011

Keywords

Comments

For a circle, curvature = 1/radius. The curvatures of a quarter, nickel, and dime are approximately proportional to 21, 24, and 28, respectively. Three mutually tangent circles with curvatures 21, 24, 28 can be inscribed in a circle of curvature 11.
Apollonius's and Descartes's Theorems say that, given three mutually tangent circles of curvatures a, b, c, there are exactly two circles tangent to all three, and their curvatures are a + b + c +- 2*sqrt(ab + ac + bc). (Here negative curvature of one of the two circles means that the three circles are inscribed in it.)
Fuchs (2009) says "An Apollonian circle packing ... is made by repeatedly inscribing circles into the triangular interstices in a Descartes configuration of four mutually tangent circles. Remarkably, if the original four circles have integer curvature, all of the circles in the packing will have integer curvature as well." That is because if a + b + c - 2s*qrt(ab + ac + bc) is an integer, then so is a + b + c + 2*sqrt(ab + ac + bc).
For n > 1, the n-th generation of the packing has 4*3^(n-2) circles.
Infinitely many of the curvatures are prime numbers A189227. In fact, in any integral Apollonian circle packing that is primitive (i.e., the curvatures have no common factor), the prime curvatures constitute a positive fraction of all primes (Bourgain 2012) and there are infinitely many pairs of tangent circles both of whose curvatures are prime (Sarnak 2007, 2011).
Fuchs and Sanden (2012) report on experiments with the nickel-dime-quarter Apollonian circle packing, which they call the coins packing P_C.

Examples

			The 1st-generation curvatures are -11, 21, 24, 28, the 2nd are 40, 52, 61, 157, and the 3rd are 76, 85, 96, 117, 120, 132, 181, 213, 237, 376, 388, 397. The 4th generation begins 132, 156, 160, 189, 204, 205, 216, ....
As 21 + 24 + 28 +- 2*sqrt(21*24 + 21*28 + 24*28) = 157 or -11, the sequence begins -11, 21, 24, 28, ... and 157 is in it.
The primes 157 and 397 are the curvatures of two circles that are tangent.
		

Crossrefs

Programs

  • Mathematica
    root = {-11, 21, 24, 28};
    triples = Subsets[root, {3}];
    a = {root};
    Do[
      ng = Table[Total@t + 2 Sqrt@Total[Times @@@ Subsets[t, {2}]], {t, triples}];
      AppendTo[a, Sort@ng];
      triples = Join @@ Table[{t, r} = tr; Table[Append[p, r], {p, Subsets[t, {2}]}], {tr, Transpose@{triples, ng}}]
      , {k, 3}];
    Flatten@a (* Andrey Zabolotskiy, May 29 2022 *)

Formula

a(n) == 0, 4, 12, 13, 16, or 21 (mod 24).

Extensions

Terms a(28) and beyond from Andrey Zabolotskiy, May 29 2022

A187089 Decimal expansion of the fractal dimension of the Apollonian sphere packing.

Original entry on oeis.org

2, 4, 7, 3, 9, 4, 6
Offset: 1

Views

Author

Paul Muljadi, Mar 08 2011

Keywords

Examples

			2.473946...
		

Crossrefs

Cf. A052483.
Showing 1-4 of 4 results.