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.

A309216 a(0)=0; thereafter a(n) = a(n-1)+n if the (n-1)st digit of the sequence is even, otherwise a(n) = a(n-1)-n.

Original entry on oeis.org

0, 1, -1, -4, 0, 5, -1, -8, 0, 9, -1, -12, -24, -11, 3, 18, 2, -15, -33, -52, -32, -11, -33, -56, -80, -105, -131, -104, -132, -103, -133, -164, -196, -229, -263, -228, -192, -155, -193, -154, -194, -235, -277, -320, -364, -319, -273, -320, -368, -319, -369, -318, -370, -423, -477, -532
Offset: 0

Views

Author

N. J. A. Sloane, Aug 10 2019

Keywords

Comments

The absolute values of the digits are 0, 1, 1, 4, 0, 5, 1, 8, 0, 9, 1, 1, 2, 2, 4, 1, 1, 3, 1, 8, 2, 1, 5, 3, 3, 5, 2, ... (Of course the signs can be ignored when looking at the parity of the digits.)

Crossrefs

Programs

  • Maple
    t:=0;
    a:=[0]; b:=[]; M:=100;
    for i from 1 to M do
    v1:=convert(abs(t),base,10); L:=nops(v1);
    v2:=[seq(v1[L-i+1],i=1..L)];
    b:=[op(b),op(v2)];
    if (b[i] mod 2) = 0 then t:=t+i else t:=t-i; fi;
    a:=[op(a),t];
    od:
    a;