cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A002968 Number of pairings {(b(1), c(1)), (b(2), c(2)), ..., (b(n), c(n))} of the first 2n positive integers satisfying b(i) < c(i) and such that the 2n numbers c(i)+b(i) and c(i)-b(i) are all distinct.

Original entry on oeis.org

1, 1, 0, 1, 8, 22, 51, 342, 2609, 16896, 99114, 876579, 8551800, 79595269, 764804085, 8905825760
Offset: 0

Views

Author

Keywords

Comments

Huff paper has a typographical error, a(8)=2669. - Sean A. Irvine, Dec 14 2014

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • R. Spira, Noncomplete residue systems, Problem 71-4, SIAM Rev., 14 (1972), 173ff.

Crossrefs

Cf. A007631.

Extensions

Better definition and values of a(11)-a(15) from Sean A. Irvine, Dec 14 2014
a(0)=1 prepended by Alois P. Heinz, Oct 05 2018