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

A075317 Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the first member of pairs.

Original entry on oeis.org

1, 5, 7, 11, 15, 17, 21, 23, 27, 31, 33, 37, 41, 43, 47, 49, 53, 57, 59, 63, 65, 69, 73, 75, 79, 83, 85, 89, 91, 95, 99, 101, 105, 109, 111, 115, 117, 121, 125, 127, 131, 133, 137, 141, 143, 147, 151, 153, 157, 159, 163, 167, 169, 173, 175, 179, 183, 185, 189, 193
Offset: 1

Views

Author

Amarnath Murthy, Sep 14 2002

Keywords

Comments

(a(n), A075318(n)) = (2A(n)-1, 2B(n)-1), where A and B are the basic Wythoff sequences A(n)=A000201(n) and B(n)=A001950(n). For a proof cf. Section 2 of the Carlitz et al. paper. - Michel Dekking, Sep 05 2016

Links

Crossrefs

Cf. A075318, A075319, A075320.

Programs

  • Magma
    [2*Floor(n*(1+Sqrt(5))/2)-1: n in [1..60]]; // Vincenzo Librandi, Sep 05 2016
  • Maple
    A075317 := proc(nmax) local r,k,a,pairs ; a := [1] ; pairs := [1,3] ; k := 2 ; r := 5 ; while nops(a) < nmax do while r in pairs do r := r+2 ; od ; a := [op(a),r] ; if r+2*k in pairs then printf("inconsistency",k) ; fi ; pairs := [op(pairs),r,r+2*k] ; k := k+1 ; od ; RETURN(a) ; end: a := A075317(200) ; for n from 1 to nops(a) do printf("%d,",op(n,a)) ; od ; # R. J. Mathar, Nov 12 2006
  • Mathematica
    Table[2 Floor[n (1 + Sqrt[5]) / 2] - 1, {n, 80}] (* Vincenzo Librandi, Sep 05 2016 *)
  • Python
    from math import isqrt
def A075317(n): return (n+isqrt(5*n**2)&-2)-1 # Chai Wah Wu, Aug 16 2022

Formula

a(n) = 2*floor(n*phi)-1, where phi=(1+sqrt(5))/2. - Michel Dekking, Sep 05 2016

Extensions

More terms from R. J. Mathar, Nov 12 2006

A075318 Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the second member of pairs.

Original entry on oeis.org

3, 9, 13, 19, 25, 29, 35, 39, 45, 51, 55, 61, 67, 71, 77, 81, 87, 93, 97, 103, 107, 113, 119, 123, 129, 135, 139, 145, 149, 155, 161, 165, 171, 177, 181, 187, 191, 197, 203, 207, 213, 217, 223, 229, 233, 239, 245, 249, 255, 259, 265, 271, 275, 281, 285, 291, 297
Offset: 1

Views

Author

Amarnath Murthy, Sep 14 2002

Keywords

Comments

(A075317(n),a(n)) = (2*A(n)-1, 2*B(n)-1), where A and B are the basic Wythoff sequences A(n)=A000201(n) and B(n)=A001950(n). For a proof, see section 2 of the Carlitz et al. paper. - Michel Dekking, Sep 08 2016

Links

Crossrefs

Cf. A075317, A075319, A075320.

Programs

  • Magma
    [2*Floor(n*((1+Sqrt(5))/2)^2)-1: n in [1..60]]; // Vincenzo Librandi, Sep 08 2016
  • Maple
    A075318 := proc(nmax) local r,k,a,pairs ; a := [3] ; pairs := [1,3] ; k := 2 ; r := 5 ; while nops(a) < nmax do while r in pairs do r := r+2 ; od ; if r+2*k in pairs then printf("inconsistency",k) ; fi ; a := [op(a),r+2*k] ; pairs := [op(pairs),r,r+2*k] ; k := k+1 ; od ; RETURN(a) ; end: a := A075318(200) : for n from 1 to nops(a) do printf("%d,",op(n,a)) ; od ; # R. J. Mathar, Nov 12 2006
  • Mathematica
    Table[2 Floor[n ((1 + Sqrt[5]) / 2)^2] - 1, {n, 60}] (* Vincenzo Librandi, Sep 08 2016 *)
2*Floor[Range[60]GoldenRatio^2]-1 (* Harvey P. Dale, Feb 08 2020 *)
  • PARI
    a(n)=localbitprec(logint(sqrtint(45*n^4)+5*n^2,2)+2); 2*floor(n*(sqrt(5)+1)/2+n)-1 \\ Charles R Greathouse IV, Sep 09 2016
  • Python
    from math import isqrt
def A075318(n): return (n+isqrt(5*n**2)&-2)+(n<<1)-1 # Chai Wah Wu, Aug 16 2022

Formula

a(n) = 2*floor(n*phi^2)-1, where phi=(1+sqrt(5))/2. - Michel Dekking, Sep 08 2016

Extensions

More terms from R. J. Mathar, Nov 12 2006

A075319 Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1,3),(5,9),(7,13),(11,19),(15,25),(17,29),(21,35),(23,39),(27,45),... This is the sequence of the sum of the members of pairs.

Original entry on oeis.org

4, 14, 20, 30, 40, 46, 56, 62, 72, 82, 88, 98, 108, 114, 124, 130, 140, 150, 156, 166, 172, 182, 192, 198, 208, 218, 224, 234, 240, 250, 260, 266, 276, 286, 292, 302, 308, 318, 328, 334, 344, 350, 360, 370, 376, 386, 396, 402, 412, 418, 428, 438, 444, 454, 460
Offset: 1

Views

Author

Amarnath Murthy, Sep 14 2002

Keywords

Crossrefs

Cf. A075317, A075318, A075320.

Programs

  • Maple
    A075319 := proc(nmax) local r,k,a,pairs ; a := [4] ; pairs := [1,3] ; k := 2 ; r := 5 ; while nops(a) < nmax do while r in pairs do r := r+2 ; od ; if r+2*k in pairs then printf("inconsistency",k) ; fi ; a := [op(a),2*(r+k)] ; pairs := [op(pairs),r,r+2*k] ; k := k+1 ; od ; RETURN(a) ; end: a := A075319(200) : for n from 1 to nops(a) do printf("%d,",op(n,a)) ; od ; # R. J. Mathar, Nov 12 2006
  • Python
    from math import isqrt
def A075319(n): return (n+isqrt(5*n**2)&-2)+n-1<<1 # Chai Wah Wu, Aug 16 2022

Formula

a(n) = A075317(n)+A075318(n). - R. J. Mathar, Nov 12 2006

Extensions

More terms from R. J. Mathar, Nov 12 2006
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.