## N. J. A. Sloane: Papers on combinatorics (see also
codes,
designs,
graphs, etc.)

**The Enumeration of Rooted Trees by Total Height**,
J. Riordan and N. J. A. Sloane, * J. Australian Math. Soc.*, 10 (1969), pp. 278-282.

**Two-Graphs, Switching Classes, and Euler Graphs are Equal in Number**, C. L. Mallows and N. J. A. Sloane, * SIAM J. Appl. Math.*, 28 (1975), pp. 876-880.

**Pseudo-Random Sequences and Arrays**, F. J. MacWilliams and N. J. A. Sloane, * Proc. IEEE*, 64 (1976), pp. 1715-1729.

**On Pseudo-Random Arrays**, J. H. van Lint, F. J. MacWilliams and N. J. A. Sloane, * SIAM J. Appl. Math.*, 36 (1979), pp. 62-72.

**Designing an Auditing Procedure, or How to Keep Bank Managers on Their Toes**, C. L. Mallows and N. J. A. Sloane, * Mathematics Magazine*, 57 (1984), pp. 142-151.

**Anti-Hadamard Matrices**,
[note:
Fig. 3 ,
Fig. 4 ,
are in separate files]
R. L. Graham and N. J. A. Sloane,
* Linear Algebra and Applications*, 62 (1984), pp. 113-137.

**The Solution to Berlekamp's Switching
Game**,
[note:
Fig. 1 ,
Fig. 4 ,
Fig. 7
are in separate files]
P. C. Fishburn and N. J. A. Sloane, * Discrete Math.*, 74 (1989), pp. 263-290.

**Gray Codes for Reflection Groups**, J. H. Conway, N. J. A. Sloane and A. R. Wilks, * Graphs and Combinatorics*, 5 (1989), pp. 315-325.

**On Cayley's Enumeration of Alkanes (or 4-Valent Trees)**
[arXiv:math.CO/0207176],
E. M. Rains and N. J. A. Sloane,
Journal of Integer Sequences,
Vol. 2 (1999), #99.1.1.**
**

**My Favorite Integer Sequences**
[postscript, pdf],
N. J. A. Sloane,
* Proc. SETA '98*,
1999 (to appear).

**
**

** Up ** [
Full publication list |
Return to my home page
]