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.
%I A110882 #8 Oct 19 2017 03:14:43
%S A110882 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,
%T A110882 37,39,40,41,43,44,46,47,49,50,51,53,54,56,57,59,60,62,63,64,66,67,69,
%U A110882 70,72,73,75,76,77,79,80,82,83,85,86,88,89,90,92,93,95,96,98,99,101,102
%N A110882 a(n) is the least integer x such that x^n < 2 * (x-1)^n.
%C A110882 Similar to the Beatty sequence for 1/log(2).
%e A110882 a(9) = 14 because 14^9 < 2 * 13^9.
%t A110882 {1}~Join~Table[SelectFirst[Range[10^3], #^n < 2 (# - 1)^n &], {n, 70}] (* _Michael De Vlieger_, May 01 2016, Version 10 *)
%Y A110882 Equals A078607(n)+1 for n > 0.
%K A110882 nonn
%O A110882 0,2
%A A110882 Ken Tozier (kentozier(AT)comcast.net), Oct 02 2005
%E A110882 Edited by _Don Reble_, May 16 2006