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.

A110882 a(n) is the least integer x such that x^n < 2 * (x-1)^n.

Original entry on oeis.org

1, 3, 4, 5, 7, 8, 10, 11, 13, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 28, 30, 31, 33, 34, 36, 37, 39, 40, 41, 43, 44, 46, 47, 49, 50, 51, 53, 54, 56, 57, 59, 60, 62, 63, 64, 66, 67, 69, 70, 72, 73, 75, 76, 77, 79, 80, 82, 83, 85, 86, 88, 89, 90, 92, 93, 95, 96, 98, 99, 101, 102
Offset: 0

Views

Author

Ken Tozier (kentozier(AT)comcast.net), Oct 02 2005

Keywords

Comments

Similar to the Beatty sequence for 1/log(2).

Examples

			a(9) = 14 because 14^9 < 2 * 13^9.
		

Crossrefs

Equals A078607(n)+1 for n > 0.

Programs

  • Mathematica
    {1}~Join~Table[SelectFirst[Range[10^3], #^n < 2 (# - 1)^n &], {n, 70}] (* Michael De Vlieger, May 01 2016, Version 10 *)

Extensions

Edited by Don Reble, May 16 2006