|
%I #7 Aug 28 2019 18:26:13
%S 1,2,23,240,2355,22320,205942,1866592,16664147,147164464,1287061400,
%T 11174456704,96362903378,826641224992,7055950608008,59990171328640,
%U 508090131646771,4290071141315376,36113651041694280,303253863622924416,2540231448366573400
%N Expected number of distinct squares visited by a knight's random walk on an infinite chessboard after n steps, normalized to give an integer.
%C Based on A326954/A326955.
%C a(0)=1; for n>0, a(n) = (A326954(n)/A326955(n))*2^(3*n-3). (It is only a conjecture that this is always an integer).
%Y Cf. A326954, A326955.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Aug 28 2019
|
