Search: id:A103315
Results 1-1 of 1 results found.

%I A103315
%S A103315 1,1,8,9,47,127,10,2,2,4,800,2,152,4,504,2,212,19562
%N A103315 Sequence A006075 gives minimal number of knights needed to cover an n 
               X n board. This sequence gives total number of solutions using A006075(n) 
               knights (compare A006076).
%H A103315 Lee Morgenstern, <a href="http://home.earthlink.net/~morgenstern">Knight 
               Domination</a>
%Y A103315 Sequence in context: A048068 A037957 A165239 this_sequence A042847 A121330 
               A152189
%Y A103315 Adjacent sequences: A103312 A103313 A103314 this_sequence A103316 A103317 
               A103318
%K A103315 nonn
%O A103315 1,3
%A A103315 N. J. A. Sloane (njas(AT)research.att.com), Mar 20 2005, following a 
               suggestion from Lee Morgenstern.

Search completed in 0.002 seconds