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.

A080281 Numbers k such that Pi^k - 1/phi is closer to its nearest integer than any value of Pi^j - 1/phi for 1 <= j < k.

Original entry on oeis.org

1, 2, 4, 8, 17, 19, 23, 35, 221, 424, 3846, 16708, 19142, 19937, 55188, 87368
Offset: 1

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 13 2003

Keywords

Comments

phi is the Golden ratio (1 + sqrt(5))/2.
At k = 3846 the discrepancy is 0.0000887984081945...
From Ryan Propper, Jul 27 2005: (Start)
At n = 16708 the discrepancy from an integer is 0.00006159...
At n = 19142 the discrepancy from an integer is 0.00003501...
At n = 19937 the discrepancy from an integer is 0.00001498...
At n = 55188 the discrepancy from an integer is 0.00001048...
At n = 87368 the discrepancy from an integer is 0.00000693...
(End)
As 1/phi = phi - 1, the sequence is equivalent to "Numbers k such that Pi^k - phi is closer to its nearest integer than any value of Pi^j - phi for 1 <= j < k." - David A. Corneth, Nov 19 2018

Examples

			The first term is 1 because this is just Pi - 1/phi  = 2.52355...
The second term is 2 because Pi^2 - 1/phi = 9.25157...
The next term is 4 because Pi^4 - 1/phi is closer to an integer than Pi^3 - 1/phi.
		

Crossrefs

Programs

  • Mathematica
    $MaxExtraPrecision = 10^6; p = 2/(1+Sqrt[5]); b = 1; Do[a = Abs[N[Round[Pi^n - p] - (Pi^n - p), 30]]; If[a < b, Print[n]; b = a], {n, 1, 10^5}] (* Ryan Propper, Jul 27 2005 *)
  • PARI
    upto(n) = my(c = 2, phi = (1 + sqrt(5)) / 2, res = List, r = 2); Pik = 1; for(i = 1, n, Pik *= Pi; c = frac(Pik - phi); c = min(c, 1-c); if(c < r, listput(res, i); r = c)); res \\ David A. Corneth, Nov 19 2018

Extensions

a(12)-a(16) from Ryan Propper, Jul 27 2005

A080282 Numbers n such that log(n) + log_10(n) is closer to its nearest integer than any value of log(k) + log_10(k) for 1 < = k < n.

Original entry on oeis.org

2, 132, 264, 531, 8636, 69934, 140437, 282017, 566329, 1137266, 2283785, 4586151, 37138783, 74579724, 149766223, 603948755, 2435489735, 9821380043, 19722666141, 39605794500, 159714719422, 320728866517, 320728866518
Offset: 1

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 13 2003

Keywords

Comments

log(320728866518) + log_10(320728866518) = 38.00000000000122913669...

Examples

			Interestingly, values of n that satisfy the criterion seem to start appearing in pairs if this sequence is extended further.
For example, the values 320728866517 and 320728866518 and later on the values 11169523543872502 and 11169523543872503. Many more of these n, n+1 pairs crop up in the sequence.
		

Crossrefs

Extensions

More terms from Michel ten Voorde Jun 20 2003
Still more terms from Mark Hudson, Aug 26 2004
Showing 1-2 of 2 results.