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.

A008343 a(1)=1; thereafter a(n+1) = a(n)-n if a(n) >= n otherwise a(n+1) = a(n)+n.

Original entry on oeis.org

1, 0, 2, 5, 1, 6, 0, 7, 15, 6, 16, 5, 17, 4, 18, 3, 19, 2, 20, 1, 21, 0, 22, 45, 21, 46, 20, 47, 19, 48, 18, 49, 17, 50, 16, 51, 15, 52, 14, 53, 13, 54, 12, 55, 11, 56, 10, 57, 9, 58, 8, 59, 7, 60, 6, 61, 5, 62, 4, 63, 3
Offset: 1

Views

Author

Keywords

Comments

For n>0, a(A060816(n))=0. - Dmitry Kamenetsky, Feb 14 2017

Crossrefs

Programs

  • Maple
    A008343 := proc(n) option remember; if n = 1 then 1 elif A008343(n-1) >= (n-1) then A008343(n-1)-(n-1) else A008343(n-1)+(n-1); fi; end;
  • Mathematica
    nxt[{n_,a_}]:={n+1,If[a>=n,a-n,a+n]}; Transpose[NestList[nxt,{1,1},60]][[2]] (* Harvey P. Dale, May 04 2014 *)

Formula

a(n) = (n-1+a(n-1)) mod (2*(n-1)). - Jon Maiga, Jul 09 2021

Extensions

Name edited by Dmitry Kamenetsky, Feb 14 2017