This site is supported by donations to The OEIS Foundation.

# User:Jean-Bernard François

## \$whoami?

I'm Jean-Bernard François (aka infofiltrage) born in France the 03/05/69 & DP Engineer (Engineering Graphics Software).

My current blog is Bondissant (almost art from geometry).

I love number theory, mathematics, and of course OEIS.

I only worked under Debian Linux System with LibreOffice, Inkscape and a LiberKey.

## Sequence of the Day for August 14

A035287: Number of ways to place a non-attacking white and black rook on
 n  ×  n
chessboard.
{ 4, 36, 144, 400, 900, 1764, 3136, ... }
As it happens, this sequence has a very simple formula:
 n 2  (n  −  1) 2 = (n (n  −  1)) 2 = {(n) 2} 2
, the product of two consecutive square numbers, the square of oblong numbers or the square of the falling factorial
 (n) 2
. This is the number of ways of placing two objects on an
 n  ×  n
grid so that they don’t share a row or a column. Now, the number of ways of placing
 k
objects on an
 n  ×  n
grid so that they don’t share a row or a column is
 {(n)k } 2
, e.g.
 {(n) 3} 2 = (n (n  −  1) (n  −  2)) 2
for 3 objects. And then for an
 n  ×  n  ×  n
grid, the number of ways of placing
 k
objects so that they don’t share a coordinate is
 {(n)k } 3
which generalizes to higher dimensions...

See:

* {{(x)_n}} (falling factorial function template)