Results 1 
2 of
2
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 636 (15 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs to generate the sequence, references, links to relevant web pages, and other
Counting bipartite Steinhaus graphs
, 1994
"... Abstract. A Steinhaus matrix is a symmetric 01 matrix [ai,j]n×n such that ai,i = 0 for 0 ≤ i ≤ n − 1 and ai,j ≡ (ai−1,j−1 + ai−1,j) (mod 2) for 1 ≤ i < j ≤ n − 1. A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper, we present a new characterization of bipartite ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. A Steinhaus matrix is a symmetric 01 matrix [ai,j]n×n such that ai,i = 0 for 0 ≤ i ≤ n − 1 and ai,j ≡ (ai−1,j−1 + ai−1,j) (mod 2) for 1 ≤ i < j ≤ n − 1. A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper, we present a new characterization of bipartite Steinhaus graphs. 1.