N.J.A. Sloane, An on-line version of the Encyclopedia of integer sequences, Elect. J. Combin., 1 No.1, (1994) F1. http://akpublic.research.att.com/~njas/sequences/ol.html.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....product u = v w. This is equivalent to our study of global descents, as we may write u = v w with v 2 S p exactly when n 1 p is a global descent of u n . For instance, u = 563241 has global descents f2; 5g and u 6 = 142365 = 1 312 21. See the Encyclopedia of Integer Sequences [31] (A003319 and A059438) for additional references in this connection. Poirier and Reutenauer [28] showed that the elements of the dual basis fF u g indexed by the connected permutations freely generate (SSym) Duchamp, Hivert, and Thibon dualize the resulting linear basis, giving a di erent ....

Neil J. A. Sloane, An on-line version of the encyclopedia of integer sequences, Electron. J. Combin. 1 (1994), Feature 1, approx. 5 pp. (electronic), http://akpublic.research.att.com/~njas/sequences/ol.html. MR 95b:05001

....basis consisting of all sqs functions ff where I(ff) contains no internal peak. We sketch the proof of Theorem 4.2 later. Theorem 4.3. The rank of Xi is given by the recurrence with initial conditions 1 = 1, 2 = 1, 3 = 2, 4 = 4. This recurrence was suggested by a superseeker query [6]. Proof. By direct calculation we obtain that 1 = 1, 2 = 1, 3 = 2, and 4 = 4. To obtain our recurrence, we observe that for each sqs function, ff where ff ffl n, we can encode I(ff) as a binary word of length n Gamma 2, by placing a 1 in position i Gamma 1 if i is contained in I(ff) and ....

N.J.A. Sloane,An on-line version of the Encyclopedia of integer sequences, Elect. J. Combin., 1 No.1, (1994) F1. http://akpublic.research.att.com/~njas/sequences/ol.html.

....the residues of polynomials, mod #m (x) The theorem and conjectures to be presented here are based on computational results. During the course of the work integer sequences, relating to the 8PSK# and 16PSK# constellations, were entered into Sloane s On Line Encyclopedia of Integer Sequences [3] and were found to refer, in particular, to the paper by Conway and Sloane on Low Dimensional Lattices [4] which, in turn, references work by O Keefe [5] and others [6] ## This work was funded by NFR Project Number 119390 431 Their results have applications to crystallography, and use ....

Sloane, N.J.A.: An On-Line Version of the Encyclopedia of Integer Sequences. http://www.research.att.com/ njas/sequences/index.html, The Electronic Journal of Combinatorics. 1, (1994) 1--5

.... where I( contains no internal peak. We sketch the proof of Theorem 4.2 later. Theorem 4.3. The rank of n is given by the recurrence n = n 1 n 2 n 4 ; with initial conditions 1 = 1, 2 = 1, 3 = 2, 4 = 4. This recurrence was suggested by a superseeker query [6]. Proof. By direct calculation we obtain that 1 = 1, 2 = 1, 3 = 2, and 4 = 4. To obtain our recurrence, we observe that for each sqs function, where n, we can encode I( as a binary word of length n 2, by placing a 1 in position i 1 if i is contained in I( and 0 otherwise. By ....

N.J.A. Sloane,An on-line version of the Encyclopedia of integer sequences, Elect. J. Combin., 1 No.1, (1994) F1. http://akpublic.research.att.com/~njas/sequences/ol.html.

.... where I( contains no internal peak. We sketch the proof of Theorem 4.2 later. Theorem 4.3. The rank of n is given by the recurrence n = n 1 n 2 n 4 ; with initial conditions 1 = 1, 2 = 1, 3 = 2, 4 = 4. This recurrence was suggested by a superseeker query [6]. Proof. By direct calculation we obtain that 1 = 1, 2 = 1, 3 = 2, and 4 = 4. To obtain our recurrence, we observe that for each sqs function, where n, we can encode I( as a binary word of length n 2, by placing a 1 in position i 1 if i is contained in I( and 0 otherwise. By ....

N.J.A. Sloane,An on-line version of the Encyclopedia of integer sequences, Elect. J. Combin., 1 No.1, (1994) F1. http://akpublic.research.att.com/~njas/sequences/ol.html.

....contact graph for the b.c.c. lattice D 3 , and we shall refer to it as the generalized b.c.c. net. The coordination number is 2 d , and the crystal 2 We remark in passing that most of the sequences mentioned in the paper have been added to the electronically accessible version of this table [23]. 3 We are grateful to Colin Mallows for this formula. balls are cubes, with S(n) n 1) d Gamma (n Gamma 1) d ; n 0 ; 33) G(n) n 1) d n d ; n 0 : 34) The G(n) are centered cube numbers. The coordinator triangle is 1 1 1 1 2 1 1 5 5 1 1 12 22 12 1 1 27 92 92 27 1 ....

N. J. A. Sloane, An on-line version of the Encyclopedia of Integer Sequences, Electronic J. Combinatorics, vol. 1, no. 1, 1994.

No context found.

N.J.A. Sloane, An on-line version of the Encyclopedia of integer sequences, Elect. J. Combin., 1 No.1, (1994) F1. http://akpublic.research.att.com/~njas/sequences/ol.html.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC