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.

A006695 a(2n)=2*a(2n-2)^2-1, a(2n+1)=2*a(2n)-1, a(0)=2.

Original entry on oeis.org

2, 3, 7, 13, 97, 193, 18817, 37633, 708158977, 1416317953, 1002978273411373057, 2005956546822746113, 2011930833870518011412817828051050497, 4023861667741036022825635656102100993
Offset: 0

Views

Author

Keywords

Comments

An infinite coprime sequence defined by recursion.
Every term is relatively prime to all others. - Michael Somos, Feb 01 2004

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    nxt[{n_,a_,b_}]:=If[OddQ[n],{n+1,b,2a^2-1},{n+1,b,2b-1}]; Transpose[ NestList[ nxt,{1,2,3},15]][[2]] (* Harvey P. Dale, Jun 22 2015 *)
  • PARI
    a(n)=if(n<1,2*(n==0),if(n%2,2*a(n-1)-1,2*a(n-2)^2-1))

Formula

a(2n) = A001075(2^n).