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.

A064552 a(0) = 1, a(n) = a(n-1) + 2*q(n) - n for n > 0, where q(n) = A064657(n) = q(|n-q(n-3)|) + q(|n-q(n-4)|) for n > 3, q(n) = 1 for n = 0, 1, 2, 3.

Original entry on oeis.org

1, 2, 2, 1, 1, 4, 14, 31, 43, 44, 38, 31, 45, 56, 94, 105, 95, 96, 106, 109, 111, 140, 142, 171, 173, 174, 202, 229, 253, 232, 206, 187, 223, 210, 296, 271, 291, 360, 366, 451, 461, 468, 470, 477, 477, 534, 564, 567, 575, 532, 534, 589, 569, 622, 622, 693, 689, 640, 602, 567, 679
Offset: 0

Views

Author

Roger L. Bagula, Oct 08 2001

Keywords

Comments

Ill defined beyond n=866. - M. F. Hasler, Aug 28 2012

Crossrefs

Programs

  • ARIBAS
    : function qfunc(n: integer): integer; var r: integer; begin if n < 4 then r := 1; else r := qfunc(abs(n - qfunc(n - 3))) + qfunc(abs(n - qfunc( n - 4))); end; return r; end; function a064552(n: integer); var k,r: integer; begin if n = 0 then r := 1; else r := a064552(n - 1) + round(2*(qfunc(n) - n/2)); end; return r; end; for n := 1 to 60 do write(a064552(n)," "); end;.
  • Mathematica
    a[0] = q[0] = q[1] = q[2] = q[3] = 1;
    q[n_] := q[n] = q[Abs[n - q[n - 3]]] + q[Abs[n - q[n - 4]]];
    a[n_] := a[n] = a[n - 1] + 2*(q[n] - n/2);
    Table[a[n], {n, 0, 70} ]

Extensions

Corrected and extended by Vladeta Jovovic, Matthew Conroy and Klaus Brockhaus, Oct 09 2001
Sequence A064657, and thus the present one, is ill defined beyond n=866. Keyword 'fini' added by M. F. Hasler, Aug 28 2012