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!)
A081289 a(0) = 0, a(n) = A081293(A081288(n)-1). 5
0, 3, 6, 6, 6, 14, 14, 14, 14, 14, 14, 14, 14, 14, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
After n>0, A081293(n) occurs A000245(n) times.
LINKS
PROG
(PARI) A000108(n) = binomial(2*n, n)/(n+1);
A081293(n) = A000108(n) + sum(k=0, n, A000108(k));
A081288(n) = my(i=0); while(binomial(2*i, i)/(i+1) <= n, i++); i;
a(n) = if (n==0, 0, A081293(A081288(n)-1)); \\ Michel Marcus, Apr 28 2020
CROSSREFS
Sequence in context: A295558 A295559 A161645 * A160504 A291801 A227501
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 18:04 EDT 2024. Contains 372340 sequences. (Running on oeis4.)