login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of complementary pairs of circulant digraphs on n nodes.
1

%I #13 Jan 16 2022 22:09:26

%S 1,1,2,3,4,10,8,23,27,70,56,312,180,700,1096,2131,2068,11020,7316,

%T 34008,44232,104968,95420,531296,419654,1398500,1864674,5638352,

%U 4794088,33597760,17896832

%N Number of complementary pairs of circulant digraphs on n nodes.

%H V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2.

%F Average of A049297 and A049309.

%F a(2*n) = A049297(2*n)/2; a(2*n-1) = (A049297(2*n-1) + A049309(n))/2. - _Andrew Howroyd_, Jan 16 2022

%Y Cf. A049297, A049309, A054929.

%K nonn,more

%O 1,3

%A _N. J. A. Sloane_, May 24 2000

%E a(12)-a(31) added by _Andrew Howroyd_, Jan 16 2022