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 A078608 #94 Apr 30 2025 23:11:51
%S A078608 2,5,8,11,14,17,20,23,25,28,31,34,37,40,43,46,49,51,54,57,60,63,66,69,
%T A078608 72,75,77,80,83,86,89,92,95,98,100,103,106,109,112,115,118,121,124,
%U A078608 126,129,132,135,138,141,144,147,150,152,155,158,161,164,167,170,173,176,178,181
%N A078608 a(n) = ceiling(2/(2^(1/n)-1)).
%C A078608 For n >= 2, a(n) is the least positive integer x such that 2*x^n > (x+2)^n. For example, a(2)=5 as 4^2=16, 5^2=25, 6^2=36 and 7^2=49.
%C A078608 Coincides with floor( 2*n/(log 2) ) for all n from 1 to 777451915729367 but differs at 777451915729368. See A129935.
%C A078608 The first few values of n for which this sequence differs from floor( 2*n/(log 2) ) were found by _Dean Hickerson_ in 2002. - _N. J. A. Sloane_, Apr 30 2014
%C A078608 The sequence floor( log(n)/(2*log(2)) ) is mentioned by Erdős and Selfridge (1973). This sequence begins 0,0,0,1,1,1,1,... = 0 (3 times), 1 (12 times), 2 (48 times), 3 (192 times), 4 (768 times), ..., and grows too slowly to have its own entry. It is related to the game studied by Hales and Jewett (1963). - _N. J. A. Sloane_, Dec 02 2016
%D A078608 S. Golomb, "Martin Gardner and Tictacktoe," in Demaine, Demaine, and Rodgers, eds., A Lifetime of Puzzles, A K Peters, 2008, pp. 293-301.
%D A078608 S. W. Golomb and A. W. Hales, "Hypercube Tic-Tac-Toe", in "More Games of No Chance", ed. R. J. Nowakowski, MSRI Publications 42, Cambridge University Press, 2002, pp. 167-182. Here it is stated that the first counterexample is at n=6847196937, an error due to faulty multiprecision arithmetic. The correct value was found by Dean Hickerson in 2002, and J. Buhler in 2004, and is reported in S. Golomb (2008).
%D A078608 Dean Hickerson, Email to Jon Perry and N. J. A. Sloane, Dec 16 2002. Gives first three terms of A129935: 777451915729368, 140894092055857794, 1526223088619171207, as well as five later terms. - _N. J. A. Sloane_, Apr 30 2014
%H A078608 Vincenzo Librandi, <a href="/A078608/b078608.txt">Table of n, a(n) for n = 1..1000</a>
%H A078608 Max Alekseyev and others, <a href="http://dxdy.ru/topic6838.html">Integer Parts</a> [in Russian]
%H A078608 Max Alekseyev and others, <a href="/A078608/a078608_1.pdf">Integer Parts</a> [in Russian] [Cached copy in pdf format]
%H A078608 Art of Problem Solving, <a href="https://artofproblemsolving.com/community/c6h140737">Logarithmic identity</a>
%H A078608 Paul Erdős and John L. Selfridge, <a href="https://doi.org/10.1016/0097-3165(73)90005-8">On a combinatorial game</a>, Journal of Combinatorial Theory, Series A 14.3 (1973): 298-301.
%H A078608 S. W. Golomb and A. W. Hales, <a href="https://citeseerx.ist.psu.edu/pdf/71b4da2401ff266ffb4c53712f9a63f6a509292f">Hypercube Tic-Tac-Toe</a>
%H A078608 A. W. Hales and R. I. Jewett, <a href="https://doi.org/10.1090/S0002-9947-1963-0143712-1">Regularity and Positional Games</a>, Transactions of the American Mathematical Society, vol. 106, no. 2, Feb. 1963, 222-229.
%H A078608 K. O'Bryant, <a href="http://arxiv.org/abs/1410.2927">The sequence of fractional parts of roots</a>, arXiv preprint arXiv:1410.2927 [math.NT], 2014-2015.
%H A078608 <a href="/index/Se#sequences_which_agree_for_a_long_time">Index entries for sequences which agree for a long time but are different</a>
%t A078608 Table[(Ceiling[2/(2^(1/n)-1)]), {n, 1, 100}] (* _Vincenzo Librandi_, May 01 2014 *)
%o A078608 (PARI) for (n=2,50, x=2; while (2*x^n<=((x+2)^n),x++); print1(x","))
%o A078608 (Haskell)
%o A078608 a078608 = ceiling . (2 /) . (subtract 1) . (2 **) . recip . fromIntegral
%o A078608 -- _Reinhard Zumkeller_, Mar 27 2015
%Y A078608 Cf. A078607, A078609, A129935.
%K A078608 nonn
%O A078608 1,1
%A A078608 _Jon Perry_, Dec 09 2002
%E A078608 Edited by _Dean Hickerson_, Dec 17 2002
%E A078608 Revised by _N. J. A. Sloane_, Jun 07 2007