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.

A076896 a(1) = 1, a(n) = n-a(floor(2n/3)).

Original entry on oeis.org

1, 1, 2, 3, 3, 3, 4, 5, 6, 7, 7, 7, 8, 8, 8, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 16, 16, 17, 17, 18, 19, 19, 19, 20, 20, 21, 22, 22, 23, 24, 25, 25, 26, 27, 27, 28, 28, 29, 30, 31, 31, 32, 33, 33, 34, 34, 35, 36, 36, 36, 37, 37, 38, 39, 39, 39, 40, 41, 41, 42, 43, 43, 44, 44
Offset: 1

Views

Author

Benoit Cloitre, Nov 26 2002

Keywords

Crossrefs

Cf. A050292.

Programs

  • Mathematica
    a[1] = 1; a[n_] := a[n] = n - a[Floor[2*n/3]]; Array[a, 100] (* Amiram Eldar, May 09 2022 *)
  • PARI
    a(n)=if(n==0,0,n-a(floor(2*n/3))); \\ Joerg Arndt, Apr 27 2013

Formula

a(n) is asymptotic to (6/10)*n.