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-4 of 4 results.

A078608 a(n) = ceiling(2/(2^(1/n)-1)).

Original entry on oeis.org

2, 5, 8, 11, 14, 17, 20, 23, 25, 28, 31, 34, 37, 40, 43, 46, 49, 51, 54, 57, 60, 63, 66, 69, 72, 75, 77, 80, 83, 86, 89, 92, 95, 98, 100, 103, 106, 109, 112, 115, 118, 121, 124, 126, 129, 132, 135, 138, 141, 144, 147, 150, 152, 155, 158, 161, 164, 167, 170, 173, 176, 178, 181
Offset: 1

Views

Author

Jon Perry, Dec 09 2002

Keywords

Comments

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.
Coincides with floor( 2*n/(log 2) ) for all n from 1 to 777451915729367 but differs at 777451915729368. See A129935.
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
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

References

  • S. Golomb, "Martin Gardner and Tictacktoe," in Demaine, Demaine, and Rodgers, eds., A Lifetime of Puzzles, A K Peters, 2008, pp. 293-301.
  • 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).
  • 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

Crossrefs

Programs

  • Haskell
    a078608 = ceiling . (2 /) . (subtract 1) . (2 **) . recip . fromIntegral
    -- Reinhard Zumkeller, Mar 27 2015
  • Mathematica
    Table[(Ceiling[2/(2^(1/n)-1)]), {n, 1, 100}] (* Vincenzo Librandi, May 01 2014 *)
  • PARI
    for (n=2,50, x=2; while (2*x^n<=((x+2)^n),x++); print1(x","))
    

Extensions

Edited by Dean Hickerson, Dec 17 2002
Revised by N. J. A. Sloane, Jun 07 2007

A120754 Records in continued fraction expansion of 1/log(2) (cf. A016730).

Original entry on oeis.org

1, 2, 3, 6, 10, 13, 14, 18, 32, 52, 113, 485, 3377, 4714, 963664, 10467647, 14779710, 15407967, 70919074, 73672410, 363144903, 409121736, 628298429, 2803904265, 4054561652, 53155160769
Offset: 1

Views

Author

N. J. A. Sloane, Jun 08 2007

Keywords

Comments

a(n) are also the incrementally largest terms in the continued fraction of log(2) = [a_0; a_1, a_2, ...] = [0; 1, 2, 3, 1, 6, 3, 1, 1, 2] (excluding the a_0 term). - Eric W. Weisstein, Aug 20 2013

Crossrefs

Cf. A016730 (continued fraction of log(2)).
Cf. A120755 (positions of records in the continued fraction of 1/log(2) and log(2)).
Cf. A129935.

Programs

  • Maple
    with(numtheory); read transforms; t1:= cfrac(1/log(2),2000,'quotients'); RECORDS(t1);

Extensions

a(14)-a(22) from Eric W. Weisstein, Aug 20 2013
a(23)-a(26) from Eric W. Weisstein, Aug 21 2013

A120755 Where records occur in continued fraction expansion of 1/log(2) (cf. A016730).

Original entry on oeis.org

1, 2, 3, 5, 15, 28, 41, 47, 74, 109, 123, 166, 501, 6528, 9168, 465506, 3456790, 28568688, 47066208, 146052963, 201331652, 415612810, 1047079803, 1464289355, 2294768489, 2565310827
Offset: 1

Views

Author

N. J. A. Sloane, Jun 08 2007

Keywords

Comments

a(n) are also the positions of incrementally highest terms in the continued fraction of log(2) = [a_0; a_1, a_2, ...] = [0; 1, 2, 3, 1, 6, 3, 1, 1, 2] (excluding the term a_0) - Eric W. Weisstein, Aug 20 2013

Crossrefs

Cf. A016730 (continued fraction of log(2)).
Cf. A120754 (records in the continued fraction expansion of 1/log(2) and log(2)).
Cf. A129935.

Extensions

a(14)-a(22) from Eric W. Weisstein, Aug 20 2013
a(23)-a(26) from Eric W. Weisstein, Aug 21 2013

A258703 a(n) = floor(n/sqrt(2) - 1/2).

Original entry on oeis.org

0, 0, 1, 2, 3, 3, 4, 5, 5, 6, 7, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 17, 18, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 26, 27, 27, 28, 29, 29, 30, 31, 32, 32, 33, 34, 34, 35, 36, 36, 37, 38, 39, 39, 40, 41, 41, 42, 43, 44, 44, 45, 46, 46, 47, 48, 48, 49, 50, 51, 51, 52, 53, 53
Offset: 1

Views

Author

N. J. A. Sloane, Jun 09 2015

Keywords

Comments

From Michel Dekking, Aug 11 2022: (Start)
By definition, (a(n)) is an inhomogeneous Beatty sequence. The associated Sturmian word is s(alpha, rho) = (floor((n + 1)*alpha + rho) - floor(n*alpha + rho), n= 0, 1, 2,...) = 1,0,1,1,1,0,1,1,0,1,1,..., with slope alpha = sqrt(2)/2, and intercept rho = -1/2.
Also, s(alpha, rho) = s(alpha,rho+1) - 1. Since 0 < alpha < 1 and 0 < rho +1 < 1, with algebraic conjugates
alpha* = -sqrt(2)/2, and (rho +1)* = 1/2,
Yasutomi's criterion gives that s(alpha, rho) is fixed point of a morphism.
The morphism can be found following the ideas of Chapter 2 in Lothaire's book and Section 4 of my paper "Substitution invariant Sturmian words and binary trees" (cf. A006340).
For a better fit with the literature we will determine the morphism that fixes the binary complement s(1-alpha, 1-(1+rho) ) = 0,1,0,0,0,1,0,0,1,0,0....
Let psi_1 and psi_8 be the elementary Sturmian morphisms given by
psi_1(0)=01 , psi_1(1)=0; psi_8(0)=01, psi(8)1=1.
Let psi := psi_1 psi_8. Then psi is given by
psi(0)=010 , psi(1)=0.
We see that psi fixes the Octanacci sequence A324772.
That psi is the right morphism can be proved by checking that (x,y) = (1-alpha, -rho) is fixed point of the composition T_1 T_8 of the fractional linear maps
T_1(x,y) = ((1-x)/(2-x), (1-y)/(2-x)),
T_8(x,y) = ((1/(2-x), y/(2-x))).
Conclusion, taking the binary complement of psi: the Sturmian word equals A104521. (End)

Crossrefs

Programs

  • Haskell
    a258703 = floor . (/ 2) . subtract 1 . (* sqrt 2) . fromIntegral
    -- Reinhard Zumkeller, Jun 09 2015
    
  • Magma
    [Floor(n/Sqrt(2) - 1/2): n in [1..80]]; // Vincenzo Librandi, Jun 09 2015
    
  • Mathematica
    Table[Floor[n/Sqrt[2] - 1/2], {n, 1, 100}] (* Vincenzo Librandi, Jun 09 2015 *)
  • PARI
    vector(100, n, n--; floor(n/sqrt(2) - 1/2)) \\ G. C. Greubel, Sep 30 2018

Formula

a(n) = floor(1/(exp(sqrt(2)/n)-1)) for all positive integers n [O'Bryant].
a(n) = floor((n*sqrt(2) - 1) / 2). - Reinhard Zumkeller, Jun 09 2015

Extensions

Offset changed from 0 to 1 Michel Dekking, Aug 11 2022
Showing 1-4 of 4 results.