登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 


A320574型
a(n)给出了n×n棋盘上对称的非攻击车的配置数量,使得车之间不同距离的数量由下式给出A320448型(n) ●●●●。
6
1, 1, 2, 1, 1, 3, 6, 4, 4, 2, 6, 3, 18, 9
抵消
1,3
评论
猜想:a(n)=A320573型(n) 对于所有n>3,为/8。
例子
对于n=6,a(6)=3配置A320448型(6) =11个不同的距离为:
+---+---+---+---+---+---+
| * | | | | | |
+---+---+---+---+---+---+
| | | * | | | |
+---+---+---+---+---+---+
| | * | | | | |
+---+---+---+---+---+---+,
| | | | | * | |
+---+---+---+---+---+---+
| | | | | | * |
+---+---+---+---+---+---+
| | | | * | | |
+---+---+---+---+---+---+
+---+---+---+---+---+---+
| * | | | | | |
+---+---+---+---+---+---+
| | | * | | | |
+---+---+---+---+---+---+
| | | | | | * |
+---+---+---+---+---+---+、和
| | | | * | | |
+---+---+---+---+---+---+
| | | | | * | |
+---+---+---+---+---+---+
| | * | | | | |
+---+---+---+---+---+---+
+---+---+---+---+---+---+
| * | | | | | |
+---+---+---+---+---+---+
| | * | | | | |
+---+---+---+---+---+---+
| | | | | * | |
+---+---+---+---+---+---+.
| | | | * | | |
+---+---+---+---+---+---+
| | | | | | * |
+---+---+---+---+---+---+
| | | * | | | |
+---+---+---+---+---+---+
关键字
非n,更多
作者
彼得·卡吉2018年10月15日
扩展
a(10)-a(14)来自乔瓦尼·雷斯塔2018年10月21日
状态
经核准的

查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|网络摄像头
贡献新序列。或评论|格式|样式表|变换|超级搜索|最近
OEIS社区|维护人OEIS基金会。

许可协议、使用条款、隐私政策。.

上次修改时间:美国东部夏令时2024年9月21日08:46。包含376084个序列。(在oeis4上运行。)