[go: up one dir, main page]

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!)
Revision History for A229756 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A229756 Triangle T(n,k): the number of binary sequences of n zeros and n ones in which the longest run is of length k.
(history; published version)
#13 by Ralf Stephan at Sat Oct 05 05:43:56 EDT 2013
STATUS

reviewed

approved

#12 by Joerg Arndt at Sat Oct 05 05:21:51 EDT 2013
STATUS

proposed

reviewed

#11 by T. D. Noe at Wed Oct 02 13:20:15 EDT 2013
STATUS

editing

proposed

#10 by T. D. Noe at Wed Oct 02 13:19:42 EDT 2013
COMMENTS

Row n sums to C(2n, ,n) (A000984).

LINKS

Andrew Woods, <a href="/A229756/b229756.txt">Rows n = 1..50 of triangle, flattened</a>

EXAMPLE

.. 2

.. 2 4

.. 2 12 6

.. 2 32 28 8

.. 2 82 110 48 10

STATUS

proposed

editing

Discussion
Wed Oct 02 13:20
T. D. Noe: This probably related to other sequences. Please add something to the Cf. section.
#9 by Andrew Woods at Sun Sep 29 08:21:28 EDT 2013
STATUS

editing

proposed

#8 by Andrew Woods at Sun Sep 29 08:21:08 EDT 2013
LINKS

Andrew Woods, <a href="/A229756/b229756.txt">Rows n = 1..50 of triangle, flattened</a>

STATUS

proposed

editing

#7 by Andrew Woods at Sun Sep 29 08:13:28 EDT 2013
STATUS

editing

proposed

#6 by Andrew Woods at Sun Sep 29 08:10:45 EDT 2013
FORMULA

Let h(n,p,k) := sum(j=0..floor((n-p)/k), (-1)^j*C(p,j)*C(n-1-j*k,p-1)) with h(n,p,0) := 0, and let g(n,k) := 2*sum(i=1..n, h(n,i,k)*(h(n,i,k)+h(n,i+1,k))). Then T(n,k) = g(n,k)-g(n,k-1).

PROG

(PARI)

h(n, p, k)=if(k==0, 0, sum(j=0, floor((n-p)/k), (-1)^j*binomial(p, j)*binomial(n-1-j*k, p-1)))

g(n, k)=2*sum(i=1, n, h(n, i, k)*(h(n, i, k)+h(n, i+1, k)))

T(n, k)=g(n, k)-g(n, k-1)

r(n)=vector(n, x, 2*T(n, x))

STATUS

proposed

editing

Discussion
Sun Sep 29 08:13
Andrew Woods: Yes. I just added it.
#5 by Joerg Arndt at Sun Sep 29 04:56:16 EDT 2013
STATUS

editing

proposed

#4 by Joerg Arndt at Sun Sep 29 04:56:12 EDT 2013
COMMENTS

Row n sums to C(2n, n) (A000984).

STATUS

proposed

editing

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 August 29 17:19 EDT 2024. Contains 375518 sequences. (Running on oeis4.)