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.

A325159 Denominators of convergents to Pi using best rational approximation whose denominator is between consecutive powers of 2: [2^n, 2^(n+1)-1], where n = 0, 1, 2, ...

Original entry on oeis.org

1, 2, 7, 14, 21, 57, 113, 226, 339, 565, 1130, 2147, 4181, 8249, 32763, 33215, 99532, 199064, 364913, 995207, 1725033, 3450066, 5175099, 15160384, 25510582, 52746197, 131002976, 209259755, 340262731, 811528438, 1963319607, 3926639214, 6701487259, 13402974518, 20104461777
Offset: 0

Views

Author

Serguei Zolotov, Apr 04 2019

Keywords

Examples

			The convergents are 3/1, 6/2, 22/7, 44/14, 66/21, 179/57, 355/113, 710/226, 1065/339, 1775/565, 3550/1130, 6745/2147, 13135/4181, 25915/8249, 102928/32763, ... = A325158/A325159.
		

Crossrefs

Cf. A325158 (numerators), A002485.

A337249 Numbers k for which csc(k) > k.

Original entry on oeis.org

1, 3, 44, 710, 1420, 2130, 2840, 312689, 10838702, 6167950454, 21053343141, 63160029423, 105266715705
Offset: 1

Views

Author

Joseph C. Y. Wong, Aug 21 2020

Keywords

Comments

a(14) > 1.129*10^12, if it exists. - Kevin P. Thompson, Nov 07 2021
a(14) exists. The numbers 428224593349304, 6134899525417045, 66627445592888887, 430010946591069243, and 2646693125139304345 all satisfy csc(k) > k and are larger than a(13). It is not yet proven whether these are a(14) - a(18) or if there are any other numbers in the sequence before or between them. - Wolfe Padawer, Apr 11 2023

Examples

			csc(1) = 1.1884... so 1 is a term.
		

Crossrefs

Subsequence of A080142, A046955.
Subsequence of A265735 and A325158 if you omit the first term of A337249.

Programs

  • Mathematica
    Select[Range[10^6], Csc[#] > # &] (* Amiram Eldar, Aug 21 2020 *)
  • PARI
    isok(m) = 1/sin(m) > m; \\ Michel Marcus, Aug 27 2020
  • Python
    import math
    i = 1
    while True:
      if 1 / math.sin(i) > i:
        print(i)
      i += 1
    

Extensions

a(11)-a(13) from Kevin P. Thompson, Nov 07 2021

A327360 Minimal numerator among the fractions with n-digit numerator and n-digit denominator that best approximate Pi.

Original entry on oeis.org

3, 44, 355, 3195, 99733, 833719, 5419351, 80143857, 657408909, 6167950454, 42106686282, 983339177173, 8958937768937, 94960529682104, 428224593349304, 6134899525417045, 66627445592888887, 430010946591069243, 5293386250278608690, 31760317501671652140
Offset: 1

Views

Author

Jason Zimba, Sep 03 2019

Keywords

Examples

			The fractions with 2-digit numerators and 2-digit denominators that best approximate Pi are 44/14 and 88/28. The fraction with 6-digit numerator and 6-digit denominator that best approximates Pi is 833719/265381.
		

References

  • O. Zelenyak, Programming workshop on Turbo Pascal: Tasks, Algorithms and Solutions, Litres, 2018, page 255. (Provides first 8 terms. Also contains similar sequences for sqrt(2) and e.)

Crossrefs

A327361 gives the corresponding denominators.
Cf. A072398/A072399, which gives the best rational approximation to Pi subject to a different constraint.

Programs

  • Mathematica
    (* Given the 8th term, find the 9th term *)
    (* This took twelve-plus hours to run on a laptop *)
    ResultList = {};
    nVal = 9;
    tol = Abs[80143857/25510582 - Pi]; (* 80143857 is A327360(8), 25510582 is A327361(8) *)
    Do[
      CurrentNumerator = i;
      Do[
       CurrentDenominator = j;
       CurrentQuotient = N[CurrentNumerator/CurrentDenominator];
       If[
        Abs[CurrentQuotient - Pi] <= tol,
        ResultList = Append[ResultList, {CurrentNumerator, CurrentDenominator}]
        ],
       {j, Floor[i/(Pi + tol)], Floor[i/(Pi - tol)] + 1}],
      {i, Floor[(Pi - tol)*10^(nVal - 1)], (10^nVal - 1)}];
    DifferenceList =
      Table[
       Abs[ResultList[[i, 1]]/ResultList[[i, 2]] - Pi],
       {i, 1, Length[ResultList]}];
    Extract[ResultList, Position[DifferenceList, Min[DifferenceList]]]

Extensions

Terms a(10) and beyond from Jon E. Schoenfield, Mar 11 2021

A327361 Minimal denominator among the fractions with n-digit numerator and n-digit denominator that best approximate Pi.

Original entry on oeis.org

1, 14, 113, 1017, 31746, 265381, 1725033, 25510582, 209259755, 1963319607, 13402974518, 313006581566, 2851718461558, 30226875395063, 136308121570117, 1952799169684491, 21208174623389167, 136876735467187340, 1684937174853026414, 10109623049118158484
Offset: 1

Views

Author

Jason Zimba, Sep 03 2019

Keywords

Examples

			The fractions with 2-digit numerators and 2-digit denominators that best approximate Pi are 44/14 and 88/28.
The fraction with 6-digit numerator and 6-digit denominator that best approximates Pi is 833719/265381.
		

References

  • O. Zelenyak, Programming workshop on Turbo Pascal: Tasks, Algorithms and Solutions, Litres, 2018, page 255. (Provides first 8 terms. Also contains similar sequences for sqrt(2) and e.)

Crossrefs

A327360 gives the corresponding numerators.
Cf. A072398/A072399, which gives the best rational approximation to Pi subject to a different constraint.

Programs

  • Mathematica
    (* Given the 8th term, find the 9th term *)
    (* This took twelve-plus hours to run on a laptop *)
    ResultList = {};
    nVal = 9;
    tol = Abs[80143857/25510582 - Pi]; (* 80143857 is A327360(8), 25510582 is A327361(8) *)
    Do[
      CurrentNumerator = i;
      Do[
       CurrentDenominator = j;
       CurrentQuotient = N[CurrentNumerator/CurrentDenominator];
       If[
        Abs[CurrentQuotient - Pi] <= tol,
        ResultList = Append[ResultList, {CurrentNumerator, CurrentDenominator}]
        ],
       {j, Floor[i/(Pi + tol)], Floor[i/(Pi - tol)] + 1}],
      {i, Floor[(Pi - tol)*10^(nVal - 1)], (10^nVal - 1)}];
    DifferenceList =
      Table[
       Abs[ResultList[[i, 1]]/ResultList[[i, 2]] - Pi],
       {i, 1, Length[ResultList]}];
    Extract[ResultList, Position[DifferenceList, Min[DifferenceList]]]

Extensions

a(10)-a(20) from Jon E. Schoenfield, Mar 12 2021
Showing 1-4 of 4 results.