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.

A287793 Eight steps forward, seven steps back.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11, 10, 9, 8, 7, 6, 5, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 7, 6, 5, 6, 7, 8, 9, 10, 11
Offset: 0

Views

Author

Wesley Ivan Hurt, May 31 2017

Keywords

Links

Crossrefs

Cf. A008611 (one step back, two steps forward).
Cf. A058207 (three steps forward, two steps back).
Cf. A260644 (four steps forward, three steps back).
Cf. A271800 (five steps forward, four steps back).
Cf. A271859 (six steps forward, five steps back).
Cf. A287655 (seven steps forward, six steps back).

Programs

  • Maple
    A287793:=n->add((-1)^floor((2*i-2)/15), i=1..n): seq(A287793(n), n=0..200);
  • Mathematica
    Table[Sum[(-1)^Floor[(2 i - 2)/15], {i, n}], {n, 0, 100}]

Formula

a(n) = Sum_{i=1..n} (-1)^floor((2*i-2)/15).
a(n) = a(n-1) + a(n-15) - a(n-16) for n > 15.

A287794 Nine steps forward, eight steps back.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 10, 9, 8, 7, 6, 5, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 7, 6, 5, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 11, 10
Offset: 0

Views

Author

Wesley Ivan Hurt, May 31 2017

Keywords

Links

Crossrefs

Cf. A008611 (one step back, two steps forward).
Cf. A058207 (three steps forward, two steps back).
Cf. A260644 (four steps forward, three steps back).
Cf. A271800 (five steps forward, four steps back).
Cf. A271859 (six steps forward, five steps back).
Cf. A287655 (seven steps forward, six steps back).
Cf. A287793 (eight steps forward, seven steps back).

Programs

  • Maple
    a:=n->add((-1)^floor((2*i-2)/17), i=1..n): seq(a(n), n=0..200);
  • Mathematica
    Table[Sum[(-1)^Floor[(2 i - 2)/17], {i, n}], {n, 0, 100}]
LinearRecurrence[{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1},{0,1,2,3,4,5,6,7,8,9,8,7,6,5,4,3,2,1},100] (* Harvey P. Dale, Aug 25 2024 *)

Formula

a(n) = Sum_{i=1..n} (-1)^floor((2*i-2)/17).
a(n) = a(n-1) + a(n-17) - a(n-18) for n > 17.

A287796 Ten steps forward, nine steps back.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 5, 6, 7, 8
Offset: 0

Views

Author

Wesley Ivan Hurt, May 31 2017

Keywords

Links

Crossrefs

Cf. A008611 (one step back, two steps forward).
Cf. A058207 (three steps forward, two steps back).
Cf. A260644 (four steps forward, three steps back).
Cf. A271800 (five steps forward, four steps back).
Cf. A271859 (six steps forward, five steps back).
Cf. A287655 (seven steps forward, six steps back).
Cf. A287793 (eight steps forward, seven steps back).
Cf. A287794 (nine steps forward, eight steps back).

Programs

  • Maple
    A287796:=n->add((-1)^floor((2*i-2)/19), i=1..n): seq(A287796(n), n=0..200);
  • Mathematica
    Table[Sum[(-1)^Floor[(2 i - 2)/19], {i, n}], {n, 0, 100}]

Formula

a(n) = Sum_{i=1..n} (-1)^floor((2*i-2)/19).
a(n) = a(n-1) + a(n-19) - a(n-20) for n > 19.
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.