login
The OEIS is supported by the many generous donors 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

%I #11 Jan 11 2024 13:10:56

%S 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,

%T 23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,

%U 23,23,23,23,23,23,23,23,23,23,23,23,65,65,65,65,65,65,65,65,65,65,65,65

%N a(0)=0, a(n) = A014137(A072643(n)-1).

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

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

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

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

%t Table[a[n], {n, 0, 76}] (* _Jean-François Alcover_, Dec 26 2017 *)

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

%o (Sage)

%o def A082852(n) :

%o i = c = 0; a = 1

%o while n > c :

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

%o i += 1; c += a

%o return c-a+1

%o [A082852(n) for n in (0..76)] # - _Peter Luschny_, Sep 07 2012

%Y Used to compute A082853. Cf. also A082855.

%K nonn

%O 0,3

%A _Antti Karttunen_, Apr 17 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 10:28 EDT 2024. Contains 374318 sequences. (Running on oeis4.)