The orchard problem is to find an arrangement with the greatest t for each given ... Proof. We shall establish Theorem 1 by constructing, for each p I> 3, a set ... 104. 100. 104. 27 109. 113. 109. 117 t. 28 117. 121. 118 a. 121. 29 126. 131. 126.
Apr 3, 2006 - 1,2,4,6,3,9,12,8,10, 5,15, 18,14,7,21, 24, 16,20,... . It is clear that if a prime p appears in the sequence, 2p will be the term either immediately.
Apr 12, 2001 - idea of digital representation by sampling a source .... His influence on everyday life, which is ... the Information Sciences Research Lab, AT&T.
by N. J. A. Sloane manufacturer .... sional space discovered by John Leech at the are added .... the hexagonal lattice packing L. If the spheres are packed so that.
Then M^, i+, ri, T2. T3 generate a goup (ti trf r~r&r 6 144~ c3nsiPting ~2 the m atckes. From 12), f,srr a!1 p > d, ad is the coeffiiiena of Xd in. I. _- -__._. + ,j--j&B& =.
May 5, 2000 - the last term being due to Watson (see [16]). For nonlattice ...... 1, 2, 4, 6, 10, 12, 18,.... At stage n, the first number and every nth are crossed off.
University, May 2000 (Ray-Chaudhuri Festschrift), ed. ... sequence in [EIS], one finds a unique matching sequence, number A16, .... Write wa(n) = |V Ta(n)|.
Algebraic Description of Coordination Sequences and Exact ... [3] N.J.A. Sloane & S. Plouffe; The Encyclopedia of Integer Sequences; Academic Press 1995.
nation sequences of the root lattices Ad, Dd, E6, E7, E8 and their duals. ... contact graph of a d-dimensional lattice packing (Conway & Sloane 1993) or net.
Illustrations from On-Line Encyclopedia of Integer Sequences (OEIS), Dec. 2014. Ways to arrange n circles. A250001(3)=14 (only 7 shown). Just 4 terms known.
