[go: up one dir, main page]

login
Revision History for A201862 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of ways to place k nonattacking bishops on an n X n board, sum over all k>=0.
(history; published version)
#23 by Joerg Arndt at Mon Aug 24 11:56:27 EDT 2020
STATUS

reviewed

approved

#22 by Wesley Ivan Hurt at Mon Aug 24 10:39:04 EDT 2020
STATUS

proposed

reviewed

#21 by Michel Marcus at Mon Aug 24 09:22:45 EDT 2020
STATUS

editing

proposed

#20 by Michel Marcus at Mon Aug 24 09:22:40 EDT 2020
LINKS

V. Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>

STATUS

proposed

editing

#19 by Elijah Beregovsky at Mon Aug 24 09:20:44 EDT 2020
STATUS

editing

proposed

#18 by Elijah Beregovsky at Mon Aug 24 09:20:35 EDT 2020
LINKS

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/IndpendentVertexSetIndependentVertexSet.html">Independent Vertex Set</a>

STATUS

approved

editing

Discussion
Mon Aug 24
09:20
Elijah Beregovsky: Typo
#17 by N. J. A. Sloane at Tue May 09 00:07:34 EDT 2017
STATUS

proposed

approved

#16 by Andrew Howroyd at Tue May 09 00:01:35 EDT 2017
STATUS

editing

proposed

#15 by Andrew Howroyd at Mon May 08 23:55:00 EDT 2017
FORMULA

a(n) = A216078(n+1) * A216332(n+1). - Andrew Howroyd, May 08 2017

STATUS

approved

editing

#14 by N. J. A. Sloane at Sat Sep 12 11:00:28 EDT 2015
LINKS

V. Kotesovec, <a href="httphttps://web.telecomoeis.czorg/vaclav.kotesovecwiki/math.htmUser:Vaclav_Kotesovec">Non-attacking chess pieces</a>

Discussion
Sat Sep 12
11:00
OEIS Server: https://oeis.org/edit/global/2459