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.

A010058 1 if n is a Catalan number else 0.

Original entry on oeis.org

0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Keywords

Comments

a(A000108(n)) = 1, a(A092459(n)) = 0. - Reinhard Zumkeller, Mar 29 2011

Crossrefs

Programs

  • Maple
    V:= Array(0..1000):
    for n from 1 do
    c:= binomial(2*n,n)/(n+1);
      if c > 1000 then break fi;
    V[c]:= 1;
    od:
    convert(V,list); # Robert Israel, Oct 13 2015
  • Mathematica
    t = CatalanNumber@ Range@ 12; Table[Boole@ MemberQ[t, n], {n, 0, 96}] (* Michael De Vlieger, Sep 29 2015 *)

Formula

a(n) = abs(sgn(n - sup((2*k)!/(k!*(k + 1)!))) - 1), for n - (2*k)!/(k!*(k + 1)!) >= 0. - Ilya Gutkovskiy, Sep 27 2015