login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051195 T(2n+2,n), array T as in A050186; a count of aperiodic binary words. 0
0, 4, 12, 56, 200, 792, 2968, 11440, 43632, 167960, 646184, 2496144, 9655984, 37442160, 145416240, 565722720, 2203937120, 8597496600, 33577908232, 131282408400, 513791254704, 2012616400080, 7890369761872, 30957699535776 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

C(2n+2, n)-[n even]*C(n+1, n/2). - Ralf Stephan, Mar 19 2004

Conjecture: -(n+2)*(n-1)*a(n) +2*(n+1)*(3*n-4)*a(n-1) +4*(-n^2+5*n-1)*a(n-2) -8*n*(3*n-4)*a(n-3) +16*(n-1)*(2*n-5)*a(n-4)=0. - R. J. Mathar, May 20 2013

CROSSREFS

Sequence in context: A149420 A298680 A149421 * A179607 A149422 A149423

Adjacent sequences: A051192 A051193 A051194 * A051196 A051197 A051198

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 December 8 06:47 EST 2022. Contains 358673 sequences. (Running on oeis4.)