|
Search: id:A153008
|
|
| |
|
| 0, 0, 0, 1, 5, 21, 81, 302, 1107, 4027, 14608, 52988, 192501, 701065, 2560806, 9384273, 34504203, 127288011, 471102318, 1749063906, 6513268401, 24323719461, 91081800417, 341929853235, 1286711419527, 4852902998951, 18341683253676
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
FORMULA
|
a(n) = A000108(n)-A001006(n).
|
|
MAPLE
|
A000108 := proc(n) binomial(2*n, n)/(n+1) ; end: A001006 := proc(n) (3/2)^(n+2)*add( 3^(-k)*A000108(k-1)*binomial(k, n+2-k), k=1..n+2) ; end: A153008 := proc(n) A000108(n)-A001006(n) ; end: for n from 0 to 30 do printf("%d, ", A153008(n)) ; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 22 2009]
|
|
CROSSREFS
|
Cf. A000108, A001006.
Sequence in context: A027172 A029870 A081038 this_sequence A051196 A094834 A147504
Adjacent sequences: A153005 A153006 A153007 this_sequence A153009 A153010 A153011
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Omar E. Pol (info(AT)polprimos.com), Dec 20 2008
|
|
EXTENSIONS
|
I added more terms. - Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Dec 21 2008
Two more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 22 2009
|
|
|
Search completed in 0.002 seconds
|
