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.

Previous Showing 11-12 of 12 results.

A153725 Least number m such that floor((3^n-m)/(2^n-m)) > floor(3^n/2^n).

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 7, 4, 8, 7, 12, 9, 17, 4, 8, 16, 99, 20, 39, 235, 49, 97, 194, 885, 1106, 439, 2059, 968, 4034, 5268, 3070, 1163, 2325, 4649, 9297, 18593, 16210, 4452, 8903, 67524, 68757, 49124, 98248, 39360, 288234, 17763, 35526, 567677, 1135354
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Comments

Provided A002379(n) = floor((3^n-1)/(2^n-1)) holds (which is proved only for 1 < n <= 305000), then a(n) > 1.

Examples

			a(5)=2, since floor((3^5-1)/(2^5-1)) = floor(242/31) = 7 = floor(243/32) = floor(3^5/2^5), but floor((3^5-2)/(2^5-2)) = floor(241/30) = 8 > 7.
		

Crossrefs

Programs

  • Mathematica
    Table[n3 = 3^n; n2 = 2^n; m = 1;
    While[Floor[(n3 - m)/(n2 - m)] <= Floor[n3/n2], m++]; m, {n,1,50}] (* Robert Price, Mar 27 2019 *)
  • PARI
    a(n) = my(f = floor(3^n/2^n)); ceil(((f + 1)*(2^n) - 3^n)/f) \\ David A. Corneth, Mar 27 2019

Formula

a(n) = ceiling(((f + 1)*(2^n) - 3^n)/f) where f = floor(3^n/2^n). - David A. Corneth, Mar 27 2019

A154131 Numbers n such that the fractional part of (4/3)^n is less than 1/n.

Original entry on oeis.org

1, 4, 17, 1738, 1739, 12863, 15705, 109705, 174894, 289047, 720429, 2087694, 2087695, 4475944, 6968999
Offset: 1

Views

Author

Hieronymus Fischer, Jan 11 2009

Keywords

Comments

Numbers n such that fract((4/3)^n) < 1/n, where fract(x) = x - floor(x).
The next term is greater than 3*10^8.

Examples

			a(3)=17 since fract((4/3)^17) = 0.03273... < 1/17, but fract((4/3)^k) >= 1/k for 5 <= k <= 16.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[1000], N[FractionalPart[(4/3)^#], 100] < (1/#) &] (* G. C. Greubel, Sep 02 2016 *)
  • PARI
    isok(n) = frac((4/3)^n) < 1/n; \\ Michel Marcus, Sep 03 2016

Extensions

a(10)-a(15) from Robert Gerbicz, Nov 21 2010
Previous Showing 11-12 of 12 results.