login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082852 a(0)=0, a(n) = A014137(A072643(n)-1). 9
0, 1, 2, 2, 4, 4, 4, 4, 4, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

A014137(n) occurs A000108(n+1) times.

LINKS

Table of n, a(n) for n=0..76.

MATHEMATICA

a014137[n_] := Sum[CatalanNumber[k], {k, 0, n}];

a072643[n_] := Module[{i, c, a}, i = c = 0; a = 1; While[n > c, a *= (4*i + 2)/(i + 2); i++; c += a]; i];

a[n_] := a014137[a072643[n] - 1];

Table[a[n], {n, 0, 76}] (* Jean-Fran├žois Alcover, Dec 26 2017 *)

PROG

(Scheme) (define (A082852 n) (if (zero? n) 0 (A014137 (-1+ (A072643 n)))))

(Sage)

def A082852(n) :

    i = c = 0; a = 1

    while n > c :

        a *= (4*i+2)/(2+i)

        i += 1; c += a

    return c-a+1

[A082852(n) for n in (0..76)] # - Peter Luschny, Sep 07 2012

CROSSREFS

Used to compute A082853. Cf. also A082855.

Sequence in context: A164632 A063095 A156726 * A083551 A080374 A165040

Adjacent sequences:  A082849 A082850 A082851 * A082853 A082854 A082855

KEYWORD

nonn

AUTHOR

Antti Karttunen Apr 17 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 16:04 EST 2019. Contains 329371 sequences. (Running on oeis4.)