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”).

A054930
Number of complementary pairs of circulant digraphs on n nodes.
1
1, 1, 2, 3, 4, 10, 8, 23, 27, 70, 56, 312, 180, 700, 1096, 2131, 2068, 11020, 7316, 34008, 44232, 104968, 95420, 531296, 419654, 1398500, 1864674, 5638352, 4794088, 33597760, 17896832
OFFSET
1,3
LINKS
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
FORMULA
Average of A049297 and A049309.
a(2*n) = A049297(2*n)/2; a(2*n-1) = (A049297(2*n-1) + A049309(n))/2. - Andrew Howroyd, Jan 16 2022
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, May 24 2000
EXTENSIONS
a(12)-a(31) added by Andrew Howroyd, Jan 16 2022
STATUS
approved