cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A051195 T(2n+2,n), array T as in A050186; a count of aperiodic binary words.

This page as a plain text file.
%I A051195 #9 May 20 2013 09:16:55
%S A051195 0,4,12,56,200,792,2968,11440,43632,167960,646184,2496144,9655984,
%T A051195 37442160,145416240,565722720,2203937120,8597496600,33577908232,
%U A051195 131282408400,513791254704,2012616400080,7890369761872,30957699535776
%N A051195 T(2n+2,n), array T as in A050186; a count of aperiodic binary words.
%F A051195 C(2n+2, n)-[n even]*C(n+1, n/2). - _Ralf Stephan_, Mar 19 2004
%F A051195 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
%K A051195 nonn
%O A051195 0,2
%A A051195 _Clark Kimberling_