• In order to demonstrate some of the ways in which people have found the On-Line Encyclopedia of Integer Sequences or Superseeker useful, the following is a list of some papers and books that reference the database.
• I have included several papers of my own - well, I too find the database very useful!
• Suggestions for additional references will be welcomed. Send them to me at this address: njas@research.att.com
• Since there are always problems because web pages change their names, or simply vanish, Simon Plouffe has made a cache of pdf versions of many of these references to serve as a backup (Nov 25 2004). The file names are same as the originals, but the suffixes have all been changed to "pdf".
• If the database helped your work and you wish to reference it, the usual citation is something like this:
  N. J. A. Sloane, (2009), The On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/.
  Or, since that often causes spacing problems with LaTeX (the line is too long and is hard to break):
  N. J. A. Sloane, (2009), The On-Line Encyclopedia of Integer Sequences, published electronically at http://www.research.att.com/~njas/sequences/.
  

1. J. Abate and W. O. Whitt, Explicit M/G/1 Waiting-Time Distributions for a Class of Long-Tail Service-Time Distributions. Operations Research Letters, vol. 25, No. 1, August 1999, pp. 25-31. (PostScript, PDF).
2. Ali Aberkane, James D. Currie and Narad Rampersad, "The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially", J. Integer Sequences, Volume 7, 2004, Article 04.2.7.
3. Ackerman, Eyal; Barequet, Gill; Pinter, Ron Y. On the number of rectangulations of a planar point set. J. Combin. Theory Ser. A 113 (2006), no. 6, 1072-1091.
4. Michal Adamaszek, Efficient enumeration of graceful permutations (2006), http://arxiv.org/abs/math/0608513.
5. V. S. Adamchik, The multiple Gamma Function and Its Application to Computation of Series, The Ramanujan Journal, 9(3) (2005) 271-288
6. Jan Adem, Yves Crama, Willy Gochet, Frits C.R. Spieksma, Counting and enumerating aggregate classifiers, Discrete Applied Mathematics, Volume 156, Issue 13, 6 July 2008, Pages 2459-2468.
7. F. Adorjan, Binary mapping of monotone sequences, the Aronson and cellular automaton functions, preprint, 2004.
8. Aguiar, Marcelo; Bergeron, Nantel; Sottile, Frank, Combinatorial Hopf algebras and generalized Dehn-Sommerville relations. Compos. Math. 142 (2006), no. 1, 1-30.
9. Aguiar, Marcelo; Loday, Jean-Louis, Quadri-algebras. J. Pure Appl. Algebra 191 (2004), no. 3, 205-221.
10. Aguiar, Marcelo; Moreira, Walter, Combinatorics of the free Baxter algebra. Electron. J. Combin. 13 (2006), no. 1, Research Paper 17, 38 pp.
11. Aguiar, Marcelo; Nyman, Kathryn; Orellana, Rosa, New results on the peak algebra. J. Algebraic Combin. 23 (2006), no. 2, 149-188.
12. Marcelo Aguiar and Frank Sottile, Structure of the Malvenuto-Reutenauer Hopf algebra of permutations (2002), http://arxiv.org/abs/math/0203282; Adv. Math. 191 (2005), no. 2, 225-275. [math.CO/0203282]
13. Stefano Aguzzoli, Brunella Gerla and Corrado Manara, Poset Representation for Goedel and Nilpotent Minimum Logics, in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Computer Science, Volume 3571/2005, Springer-Verlag.
14. Maher Ahmed, Rabab Ward, Nawwaf Kharma, Solving mathematical problems using knowledge-based systems, Mathematics and Computers in Simulation, Volume 67, Issues 1-2, 3 September 2004, Pages 149-161.
15. Soohan Ahn, Taboo probability on a simple fluid flow model, Journal of the Korean Statistical Society, Volume 37, Issue 1, March 2008, Pages 47-52.
16. Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann, On the number of pseudo-triangulations of certain point sets, (2006), http://arxiv.org/abs/math/0601747; Journal of Combinatorial Theory, Series A, Volume 115, Issue 2, February 2008, Pages 254-278.
17. Aichholzer, Oswin; Hackl, Thomas; Huemer, Clemens; Hurtado, Ferran; Krasser, Hannes; Vogtenhuber, Birgit, On the number of plane geometric graphs. Graphs Combin. 23 (2007), suppl. 1, 67-84.
18. Aichholzer, Oswin; Krasser, Hannes, Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36 (2007), no. 1, 2-15.
19. O. Aichholzer, D. Orden, F. Santos and B. Speckmann, On the number of pseudo-triangulations of certain point sets, Proc 20th European Workshop Computational Geometry, EWGC04, p119-122, Sevilla, Spain, 2004
20. A. Akbary and Z. Friggstad, Superabundant numbers and the Riemann hypothesis, Amer. Math. Monthly, 116 (2009), 273-275.
21. Amir Akbary and Qiang Wang, A generalized Lucas sequence and permutation binomials, Proc. Amer. Math. Soc. 134 (2006), 15-22.
22. S. Akiyama, S. Egami and Y. Tanigawa, Analytic continuation of multiple zeta-functions and their values at non-positive integers, Acta Arith., vol.98, no.2 (2001) 107-116.
23. Shigeki Akiyama, Christiane Frougny and Jacques Sakarovitch, Powers of rationals modulo 1 and rational base number systems, Israel Journal of Mathematics, Volume 168, Number 1 / November, 2008.
24. Esen Aksoy, Ayca Cemeliolu, Wilfried Meidl, Alev Topuzolu, On the Carlitz rank of permutation polynomials, Finite Fields and Their Applications, Volume 15, Issue 4, August 2009, Pages 428-440.
25. M. H. Albert, The fine structure of 321 avoiding permutations, Technical Report OUCS-2002-11, submitted to The Electronic Journal of Combinatorics.
26. Albert, M. H.; Aldred, R. E. L.; Atkinson, M. D.; Handley, C. C.; Holton, D. A.; and McCaughan, D. J.; Sorting classes, Electron. J. Combin. 12 (2005), no. 1, Research Paper 31, 25 pp. 05A15
27. M.H. Albert, M. Elder, A. Rechnitzer, P. Westcott, M. Zabrocki, On the StanleyWilf limit of 4231-avoiding permutations and a conjecture of Arratia, Advances in Applied Mathematics, Volume 36, Issue 2, February 2006, Pages 96-105.
28. Albert, M. H.; Atkinson, M. D. Sorting with a forklift. Permutation patterns (Otago, 2003). Electron. J. Combin. 9 (2002/03), no. 2, Research paper 9, 23 pp.
29. M. H. Albert, M. D. Atkinson and M. Klazar, "The Enumeration of Simple Permutations", J. Integer Sequences, Volume 6, 2003, Article 03.4.4.
30. Albert, M. H.; Elder, M.; Rechnitzer, A.; Westcott, P.; Zabrocki, M. On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia. Adv. in Appl. Math. 36 (2006), no. 2, 96-105.
31. Albert, M. H.; Linton, Steve; Ruskuc, Nik, The insertion encoding of permutations. Electron. J. Combin. 12 (2005), Research Paper 47, 31 pp.
32. R.E.L. Aldred, M.D. Atkinson, H.P. van Ditmarsch, C.C. Handley, D.A. Holton, D.J. McCaughan, Permuting machines and priority queues, Theoretical Computer Science, Volume 349, Issue 3, 16 December 2005, Pages 309-317.
33. M. Alekseyev, Josephus problem, in "The Empire of Mathematics" (Russian journal), 2, 2000.
34. Max A. Alekseyev, On the number of two-dimensional threshold functions (2006), http://arxiv.org/abs/math/0602511.
35. Lubomir Alexandrov, Prime number logarithmic geometry on the plane (2002), http://arxiv.org/abs/math/0204167.
36. L. Alexandrov, D. B. Baranov and P. Yotov, Polynomial splines interpolating prime series.
37. Gadi Aleksandrowicz and Gill Barequet, Counting d-Dimensional Polycubes and Nonrectangular Polyominoes, in Computing and Combinatorics, Lecture Notes in Computer Science, Volume 4112, 2006, pp. 418-427, Springer-Verlag.
38. Gadi Aleksandrowicz, Gill Barequet, Counting polycubes without the dimensionality curse, Discrete Mathematics, Volume 309, Issue 13, 6 July 2009, Pages 4576-4583.
39. Abbas Alhakim and Mufutau Akinwande, De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences (2008) http://arxiv.org/abs/0812.4012
40. Iskander Aliev, Siegel's Lemma and Sum-Distinct Sets (2005), http://arxiv.org/abs/math/0503115; Discrete and Computational Geometry, Volume 39, Numbers 1-3 / March, 2008.
41. Giedrius Alkauskas, The moments of Minkowski question mark function: the dyadic period function (2007); http://arxiv.org/abs/0801.0051
42. Giedrius Alkauskas, J\"orn Steuding, Statistical properties of the Calkin--Wilf tree: real an p-adic distribution (2007); http://arxiv.org/abs/0801.0054
43. J.-P. Allouche, Finite automata and arithmetic Seminaire Lotharingien de Combinatoire, B30c (1993), 23 pp. [Formerly: Publ. I.R.M.A. Strasbourg, 1993, 1993/034, p. 1-18.]
44. J.-P. Allouche, La recherche expérimentale en mathématiques.
45. Jean-Paul Allouche, On a conjecture of Deutsch, Sagan and Wilson (2006), http://arxiv.org/abs/math/0606670.
46. J.-P. Allouche, N. Rampersad and J. Shallit, On integer sequences whose first iterates are linear, Preprint, 2003.
47. J.-P. Allouche and J. Shallit, The ring of k-regular sequences, Theoret. Comput. Sci. 98 (1992), 163-197.
48. J.-P. Allouche and J. Shallit, The Ring of k-regular Sequences, II, Theoret. Comput. Sci. 307 (2003), 3-29.
49. J.-P. Allouche, J. Shallit and G. Skordev, Self-generating sets, integers with missing blocks and substitutions, Discrete Math. 292 (2005) 1-15.
50. Marco Almeida, Nelma Moreira, Rogerio Reis, Enumeration and generation with a string automata representation, Theoretical Computer Science, Volume 387, Issue 2, 12 November 2007, Pages 93-102.
51. Horst Alzer, Sharp inequalities for the harmonic numbers, Expo. Math 24 (2006) 385-388.
52. Horst Alzer, Dimitri Karayannakis, H.M. Srivastava, Series representations for some mathematical constants, Journal of Mathematical Analysis and Applications, Volume 320, Issue 1, 1 August 2006, Pages 145-162.
53. Tewodros Amdeberhan and Richard P. Stanley, Polynomial Coefficient Enumeration (2008) http://arxiv.org/abs/0811.3652
54. Junkyu An, Wilf conjecture (2008); http://arxiv.org/abs/0807.2150
55. A. Andoni, D. Daniliuc, S. Khurshid and D. Marinov, Evaluating the "Small Scope Hypothesis" for Code, [.ps] [.pdf]. Submitted to the 11th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE 2003).
56. George E. Andrews, Ramanujan's Lost notebook IV. Stacks and alternating parity in partitions, Advances in Mathematics, Volume 53, Issue 1, July 1984, Pages 55-74.
57. Andrews, George E.; Sellers, James A. On Sloane's generalization of non-squashing stacks of boxes. Discrete Math. 307 (2007), no. 9-10, 1185-1190.
58. Dorin Andrica and Ioan Tomescu, "On an Integer Sequence Related to a Product of Trigonometric Functions and Its Combinatorial Relevance", J. Integer Sequences, Volume 5, 2002, Article 02.2.4.
59. E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
60. David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, "Sloping Binary Numbers: A New Sequence Related to the Binary Numbers", J. Integer Sequences, Volume 8, 2005, Article 05.3.6.
61. David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing (arXiv: math.NT/0611293). Published in "The Mathematics of Preference, Choice and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 393-402.
62. D. Applegate, E. M. Rains and N. J. A. Sloane, On Asymmetric Coverings and Covering Numbers, J. Combinatorial Designs, 11 (2003), 218-222.
63. David Applegate and N. J. A. Sloane, The Gift Exchange Problem, arXiv:0907.0513.
64. Arratia, Richard; Bollobás, Béla; Coppersmith, Don; Sorkin, Gregory B., Euler circuits and DNA sequencing by hybridization. Combinatorial molecular biology. Discrete Appl. Math. 104 (2000), no. 1-3, 63-96.
65. R. Arratia, L. Goldstein and B. Langholz, Frequency Matching in Logistic Regression, Rejective Sampling and ...
66. Shogo Asai, Yuusuke Kounoike, Yuji Shinano and Keiichi Kaneko, Computing the Diameter of 17-Pancake Graph Using a PC Cluster, in Euro-Par 2006 Parallel Processing, Lecture Notes in Computer Science, Volume 4128/2006, Springer-Verlag.
67. D. Ashlock, Ordered Structures, in Evolutionary Computation for Modeling and Optimization, Springer-Verlag.
68. Andrei Asinowski, Toufik Mansour, Dyck paths with coloured ascents (2007), http://arxiv.org/abs/math/0701733; European Journal of Combinatorics, Volume 29, Issue 5, July 2008, Pages 1262-1279.
69. Andrei Asinowski, Toufik Mansour, Separable d-permutations and guillotine partitions (2008); http://arxiv.org/abs/0803.3414
70. Ricardo Astudillo, "On a Class of Thue-Morse Type Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.4.2.
71. Asveld, Peter R. J. Generating all permutations by context-free grammars in Chomsky normal form. Theoret. Comput. Sci. 354 (2006), no. 1, 118-130.
72. Jean-Christophe Aval, Multivariate Fuss-Catalan numbers, arXiv:0711.0906v1, Discrete Math., 308 (2008), 4660-4669.
73. S. Avgustinovich and S. Kitaev, On uniquely k-determined permutations, Discr. Math., 308 (2008), 1500-1507.
74. O.B. Awojoyogbe, O.P. Faromika, Folorunsho O. Moses, M. Dada, I.A. Fuwape, K. Boubaker, Mathematical model of the Bloch NMR flow equations for the analysis of fluid flow in restricted geometries using the Boubaker polynomials expansion scheme, Current Applied Physics, In Press, Corrected Proof, Available online 11 June 2009.
75. Arvind Ayyer, The Half-Perimeter Generating Function of Gated and Wicketed Ferrers diagrams (2007), http://arxiv.org/abs/0710.5133.
76. Arvind Ayyer, Towards a human proof of Gessel's conjecture (2009) http://arxiv.org/abs/0902.2329
77. Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem II, Missouri Journal of Mathematical Sciences, Vol. 16, No. 1, Winter 2004, pp. 12-17.
78. Azarian, Mohammad K., On the hyperfactorial function, hypertriangular function and the discriminants of certain polynomials. Int. J. Pure Appl. Math. 36 (2007), 251-257.
79. M. Baake and U. Grimm, Coordination sequences for root lattices and related graphs, Zeit. f. Kristallographie, 212 (1997), 253-256.
80. Michael Baake, Uwe Grimm, Manuela Heuer et al., Coincidence rotations of the root lattice A_4 (2007), http://arxiv.org/abs/0709.1341; European Journal of Combinatorics, Volume 29, Issue 8, November 2008, Pages 1808-1819.
81. Michael Baake, Manuela Heuer, Robert V. Moody, Similar sublattices of the root lattice A_4 (2007), http://arxiv.org/abs/math/0702448; Journal of Algebra, Volume 320, Issue 4, 15 August 2008, Pages 1391-1408.
82. M. Baake and R. V. Moody, Similarity submodules and root systems in four dimensions, Canadian Journal of Mathematics (1999), Vol 51 No 6, pp. 1258-1276.
83. Michael Baake and Natascha Neumaerker, A note on the relation between fixed point and orbit count sequences (2008) http://arxiv.org/abs/0812.4354
84. Michael Baake , John A.G. Roberts , Alfred Weiss, Periodic orbits of linear endomorphisms on the 2-torus and its lattices (2008); http://arxiv.org/abs/0808.3489
85. L. Babai and P. J. Cameron, Automorphisms and enumeration of switching classes of tournaments, The Electronic Journal of Combinatorics, Volume 7(1), 2000, R#38.
86. Silvia Bacchelli, Luca Ferrari, Renzo Pinzani et al., Mixed succession rules: the commutative case (2008); http://arxiv.org/abs/0806.0799
87. Eric Bach and Lev Borisov, Absorption Probabilities for the Two-Barrier Quantum Walk (2009) http://arxiv.org/abs/0901.4349
88. Roland Bacher, Fair Triangulations (2007), http://arxiv.org/abs/0710.0960.
89. Roland Bacher, On generating series of complementary planar trees (2004), http://arxiv.org/abs/math/0409050.
90. Roland Bacher, Philippe Flajolet, Pseudo-factorials, elliptic functions, and continued fractions (2009) http://arxiv.org/abs/0901.1379
91. R. Bacher and D. Garber, Spindle configurations of skew lines, Geom. Topol. 11 (2007), 1049-1081.
92. Bacher, Roland; Schaeffer, Gilles, On generating series of coloured planar trees. Sém. Lothar. Combin. 55 (2005/06), Art. B55e, 20 pp.
93. Dave Bacon, Andrew M. Childs, Wim van Dam, Optimal measurements for the dihedral hidden subgroup problem (2005), http://arxiv.org/abs/quant-ph/0501044.
94. C. Badea, On some criteria of irrationality for series of positive rationals : a survey, in Actes ds rencontres Arithmetiques de Caen (a la memoire de Roger Apery), 2-3 juin 1995, 1-14.
95. Bernard De Baets, Radko Mesiar, Triangular norms on product lattices, Fuzzy Sets and Systems, Volume 104, Issue 1, 16 May 1999, Pages 61-75.
96. D. H. Bailey, Book Reviews, Math. Comp. 65 (1996), 877-895.
97. D. H. Bailey, Compendium to BBP formulas
98. D. H. Bailey and J. M. Borwein, Experimental mathematics: recent developments and future outlook, pp. 51-66 of B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and Beyond, 2 vols., Springer-Verlag, 2001 [ps or pdf].
99. D. H. Bailey and J. M. Borwein, Experimental mathematics: examples, methods and implications, Notices Amer. Math. Soc. 52 (2005), 502-514.
100. David H. Bailey, Jonathan M. Borwein, David Broadhurst and M. L. Glasser, Elliptic integral evaluations of Bessel moments, arXiv:0801.0891. "This paper contains several proofs of identities that we first conjectured on the basis of numerical investigation, hugely facilitated by access to Sloane's wonderful sequence finder."
101. R. A. Bailey and P. J. Cameron, Latin squares: Equivalents and equivalence, Draft, May 2003.
102. R. Baillie, D. Borwein and J. M. Borwein, Surprising sync sums and integrals, Amer. Math. Monthly, 115 (2008), 888-901.
103. Valentin Bakoev, Algorithmic approach to counting certain types of m-ary partitions, Discrete Mathematics, Vol 275 (2004), pp. 17-41.
104. B. Balamohan, A. Kuznetsov and Stephen Tanny, "On the Behavior of a Variant of Hofstadter's Q-Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.7.1.
105. B. Balamohan, Zhiqiang Li, Stephen Tanny, A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence (2008); http://arxiv.org/abs/0801.1097
106. Peter Balazs, Generation and Empirical Investigation of hv-Convex Discrete Sets, in Image Analysis, Lecture Notes in Computer Science, Volume 4522/2007, Springer-Verlag.
107. Peter Balazs, A benchmark set for the reconstruction of hv-convex discrete sets, Discrete Applied Mathematics, In Press, Corrected Proof, Available online 2 April 2009.
108. Barry Balof and Jacob Menashe, "Semiorders and Riordan Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.7.6.
109. Giorgio Balzarotti and Paolo P. Lava, Le sequenze di numeri interi, Divagazioni matematiche tra curiosit�, tradizione e invenzioni, Hoepli, 2008. Link to book: http://libreriarizzoli.corriere.it/libro/balzarotti_giorgio_lava_paolo_p-le_sequenze_di_numeri_interi.aspx?ean=9788820341107
110. C. Banderier, Classifying ECO-Systems and Random Walks, Algorithms Project, INRIA Rocquencourt, September 27, 1999.
111. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating Functions for Generating Trees, Discrete Mathematics 246(1-3), March 2002, pp. 29-55.
112. C. Banderier, J.-M. Fédou, C. Garcia and D. Merlini, Algebraic succession rules and Lattice paths with an infinite set of jumps, Preprint (2003).
113. C. Banderier and P. Flajolet, Basic Analytic Combinatorics of Directed Lattice Paths, Theoretical Computer Science Vol. 281. Issue 1-2, pp. 37-80, Jun. 2002, (special volume dedicated to M. Nivat).
114. Cyril Banderier, Philippe Flajolet, Daniele Gardy et al., Generating functions for generating trees (2004), http://arxiv.org/abs/math/0411250.
115. C. Banderier and S. Schwer, Why Delannoy numbers?, 5th International Conference on Lattice Path Combinatorics and Discrete Distributions, 2002. Journal of Statistical Planning and Inference, Volume 135, Issue 1, 1 November 2005, Pages 40-54.
116. R. B. Banks, Slicing Pizzas, Racing Turtles, and Further Adventues in Applied Mathematics, Princeton Univ. Press, 1999.
117. William D. Banks and Florian Luca, "Concatenations with Binary Recurrent Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.1.3.
118. H. Barcelo and R. Laubenbacher, Perspectives on A-homotopy theory and its applications, Discr. Math., 298 (2005), 39-61.
119. Barcelo, Hélène; Sagan, Bruce E.; and Sundaram, Sheila, Counting permutations by congruence class of major index. Adv. in Appl. Math. 39 (2007), no. 2, 269-281.
120. E. Barcucci, L. Belanger and S. Brlek, On Tribonacci Sequences, to appear in Fibonacci Quarterly, 2002.
121. Barcucci, Elena; Bernini, Antonio; Ferrari, Luca; Poneti, Maddalena, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations. Order 22 (2005), no. 4, 311-328 (2006).
122. E. Barcucci, A. Bernini, M. Poneti, From Fibonacci to Catalan permutations (2006), http://arxiv.org/abs/math/0612277.
123. E. Barcucci, A. Del Lungo, A. Frosini and S. Rinaldi, A technology for reverse-engineering a combinatorial problem from a rational generating function. Adv. in Appl. Math. 26 (2001), no. 2, 129-153.
124. E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, From Motzkin to Catalan permutations, Discrete Mathematics, 217 (2000), 33-49.
125. Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Deco polyominoes, permutations and random generation, Theoretical Computer Science, Volume 159, Issue 1, 28 May 1996, Pages 29-42.
126. E. Barcucci, A. Frosini and S. Rinaldi, On directed-convex polyominoes in a rectangle, Discr. Math., 298 (2005). 62-78.
127. E. Barcucci, E. Pergola, R. Pinzani and S. Rinaldi, ECO method and hill-free generalized Motzkin paths, Seminaire Lotharingien de Combinatoire, B46b (2001), 14 pp.
128. E. Barcucci, E. Pergola, R. Pinzani and S. Rinaldi, A bijection for some paths on the slit plane. Adv. in Appl. Math. 26 (2001), no. 2, 89-96.
129. Barcucci, E.; Rinaldi, S., Some linear recurrences and their combinatorial interpretation by means of regular languages. Theoret. Comput. Sci. 255 (2001), no. 1-2, 679-686.
130. Baril, J. L.; Pallo, J. M. The phagocyte lattice of Dyck words. Order 23 (2006), no. 2-3, 97-107.
131. J.L. Baril, J.M. Pallo, The pruning-grafting lattice of binary trees, Theoretical Computer Science, Volume 409, Issue 3, 28 December 2008, Pages 382-393.
132. Marilena Barnabei, Flavio Bonetti, Matteo Silimbani, Bijections and recurrences for integer partitions into a bounded number of parts, Applied Mathematics Letters, Volume 22, Issue 3, March 2009, Pages 297-303.
133. M. Barnabei, F. Bonetti, and M. Silimbani, Restricted involutions and Motzkin paths (2008) http://arxiv.org/abs/0812.0463
134. M. Barnabei, F. Bonetti, and M. Silimbani, The distribution of consecutive patterns of length 3 in 3\textrm{-}1\textrm{-}2 -avoiding permutations (2009) http://arxiv.org/abs/0904.0079
135. M. Barnabei, F.Bonetti, and M.Silimbani, Combinatorial properties of the numbers of tableaux of bounded height (2008); http://arxiv.org/abs/0803.2112
136. Paul Barry, "A Catalan Transform and Related Transformations on Integer Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.4.5.
137. Paul Barry, "On Integer-Sequence-Based Constructions of Generalized Pascal Triangles", J. Integer Sequences, Volume 9, 2006, Article 06.2.4.
138. Paul Barry, "On a Family of Generalized Pascal Triangles Defined by Exponential Riordan Arrays", J. Integer Sequences, Volume 10, 2007, Article 07.3.5.
139. Paul Barry, "Some Observations on the Lah and Laguerre Transforms of Integer Sequences", J. Integer Sequences, Volume 10, 2007, Article 07.4.6.
140. Paul Barry, "On Integer Sequences Associated With the Cyclic and Complete Graphs", J. Integer Sequences, Volume 10, 2007, Article 07.4.8.
141. Paul Barry, A Study of Integer Sequences, Riordan Arrays, Pascal-like Arrays and Hankel Transforms, Ph D Thesis, University College, Cork, Republic of Ireland.
142. Paul Barry and Patrick Fitzpatrick, "On a One-Parameter Family of Riordan Arrays and the Weight Distribution of MDS Codes", J. Integer Sequences, Volume 10, 2007, Article 07.9.8.
143. Kim Baskerville, Peter Grassberger and Maya Paczuski, Graph animals, subgraph sampling and motif search in large networks (2007), http://arxiv.org/abs/q-bio.MN/0702029.
144. Kim Baskerville, Peter Grassberger and Maya Paczuski, Graph animals, subgraph sampling and motif search in large networks (2007), http://arxiv.org/abs/q-bio/0702029.
145. Bassetti, Federico; Diaconis, Persi, Examples comparing importance sampling and the Metropolis algorithm. Illinois J. Math. 50 (2006), no. 1-4, 67-91 .
146. F. Bassino, Cyril Nicaud, Pascal Weil, Random generation of finitely generated subgroups of a free group (2007), http://arxiv.org/abs/0707.3185.
147. M. T. Batchelor, J. de Gier and B. Nienhuis, The quantum symmetric XXZ chain at Delta=-1/2, alternating sign matrices and plane partitions, LANL cond-mat/0101385
148. C. Bauer, Triangular monoids and an analog to the derived sequence of a solvable group. Internat. J. Algebra Comput. 10 (2000), no. 3, 309-321.
149. Michel Bauer and Olivier Golinelli, "On the Kernel of Tree Incidence Matrices", J. Integer Sequences, Volume 3, 2000, Article 00.1.4.
150. M. Bauer and O. Golinelli, Random incidence matrices: Moments of the spectral density, J. Stat. Phys. 103, 301-307 (2001).
151. Karin Baur and Nolan Wallach, Nice Parabolic Subalgebras of Reductive Lie Algebras (2004), http://arxiv.org/abs/math/0409295.
152. Andrew M. Baxter and Ron Umble, Periodic Orbits of Billiards on an Equilateral Triangle, Amer. Math. Monthly, 115 (No. 6, 2008), 479-491.
153. R. Bayon, N. Lygeros, Advanced results in enumeration of hyperstructures, Journal of Algebra, Volume 320, Issue 2, 15 July 2008, Pages 821-835.
154. Cecilia Bebeacua, Toufik Mansour, Alex Postnikov, Simone Severini, On the X-rays of permutations, Electronic Notes in Discrete Mathematics, Volume 20, 1 July 2005, Pages 193-203. http://arxiv.org/abs/math/0506334.
155. M. Beck and S. Robins, Computing the Continuous Discretely, Springer, 2007.
156. Andrea Bedini, Sergio Caracciolo, Andrea Sportiello, Hyperforests on the Complete Hypergraph by Grassmann Integral Representation (2008); http://arxiv.org/abs/0802.1506
157. Hacene Belbachir, Farid Bencherif, Sums of products of generalized Fibonacci and Lucas numbers (2007), http://arxiv.org/abs/0708.2347.
158. Hacène Belbachir, Farid Bencherif and László Szalay, "Unimodality of Certain Sequences Connected With Binomial Coefficients", J. Integer Sequences, Volume 10, 2007, Article 07.2.3.
159. Hacene Belbachir, Sadek Bouroubi, Abdelkader Khelladi, Connection between ordinary multinomials, generalized Fibonacci numbers, partial Bell partition polynomials and convolution powers of discrete uniform distribution (2007), http://arxiv.org/abs/0708.2195.
160. M. Beleggia, D. Vokoun, M. De Graef, Demagnetization factors for cylindrical shells and related shapes, Journal of Magnetism and Magnetic Materials, Volume 321, Issue 9, May 2009, Pages 1306-1315.
161. George I. Bell, Solving Triangular Peg Solitaire [arXiv:math/0703865v4]
162. George I. Bell, Diamond Solitaire (2007), http://arxiv.org/abs/0711.2749.
163. George I. Bell, Daniel S. Hirschberg and Pablo Guerrero-Garcia, The minimum size required of a solitaire army (2006), http://arxiv.org/abs/math/0612612.
164. Jordan Bell, Brett Stevens, A survey of known results and research areas for n-queens, Discrete Mathematics, Volume 309, Issue 1, 6 January 2009, Pages 1-31.
165. Lourdes Benito, Solutions of the problem of Erd\"os-Sierpi\'nski: sigma(n)=sigma(n+1), (2007), http://arxiv.org/abs/0707.2190.
166. A. Benjamin, J. Neer, D. Otero and J. A. Sellers, A Probabilistic View of Certain Weighted Fibonacci Sums, to appear in Fibonacci Quarterly.
167. Moussa Benoumhani, "A Sequence of Binomial Coefficients Related to Lucas and Fibonacci Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.2.1.
168. Moussa Benoumhani, "The Number of Topologies on a Finite Set", J. Integer Sequences, Volume 9, 2006, Article 06.2.6.
169. Allan Berele and Bridget Eileen Tenner, Doubly Symmetric Functions (2009) http://arxiv.org/abs/0903.5306
170. F. Bergeron and F. Gascon, "Counting Young Tableaux of Bounded Height", J. Integer Sequences, Volume 3, 2000, Article 00.1.7.
171. F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998.
172. F. Bergeron and S. Plouffe, Computing the Generating Function of a Series Given its First Few Terms, Experimental Mathematics , Volume 1, (1992), 307-312. (ps.gz, pdf )
173. N. Bergeron, F. Descouens, M. Zabrocki, A Filtration of (q,t)-Catalan numbers (2008); http://arxiv.org/abs/0806.3046
174. Bergeron, N.; Hohlweg, C.; Zabrocki, M., Posets related to the connectivity set of Coxeter groups. J. Algebra 303 (2006), no. 2, 831-846.
175. N. Bergeron, S. Mykytiuk, F. Sottile and S. J. van Willigenburg, Shifted quasi-symmetric functions and the Hopf algebra of peak functions, Discrete Math., 256 (2002), 57-66. [math.CO/9904105]
176. Nantel Bergeron, Mike Zabrocki, The Hopf algebras of symmetric functions and quasisymmetric functions in non-commutative variables are free and cofree (2005), http://arxiv.org/abs/math/0509265.
177. G. Berkolaiko and J.P. Keating, Two-point spectral correlations for star graphs, J. Phys. A 32 (1999), 7827-7841.
178. F. R. Bernhart, Catalan, Motzkin and Riordan numbers, Discr. Math., 204 (1999) 73-112.
179. Antonio Bernini, Filippo Disanto, Renzo Pinzani and Simone Rinaldi, "Permutations Defining Convex Permutominoes", J. Integer Sequences, Volume 10, 2007, Article 07.9.7.
180. Antonio Bernini and Elisa Pergola, "Enumerating Permutations Avoiding More Than Three Babson-Steingr�msson Patterns", J. Integer Sequences, Volume 10, 2007, Article 07.6.4.
181. M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Algebra and Its Applications, vol. 226-228, pp. 57-72, 1995. Erratum: Linear Algebra Appl. 320 (2000), no. 1-3, 210.
182. M. Bernstein, N. J. A. Sloane and P. E. Wright, On Sublattices of the Hexagonal Lattice, Discrete Math., 170 (1997) 29-39.
183. Berstel, Jean, Growth of repetition-free words--a review. Theoret. Comput. Sci. 340 (2005), no. 2, 280-290.
184. Bessenrodt, Christine; Olsson, J. B., A note on Cartan matrices for symmetric groups. Arch. Math. (Basel) 81 (2003), no. 5, 497-504.
185. A. Betten and D. Betten, Linear Spaces with at Most 12 Points, Journal of Combinatorial Designs 7 (1999), 119-145.
186. D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.
187. Robert J. Betts, "Using Bonse's Inequality to Find Upper Bounds on Prime Gaps", J. Integer Sequences, Volume 10, 2007, Article 07.3.8.
188. Bevan, David, Sets of points determining only acute angles and some related colouring problems. Electron. J. Combin. 13 (2006), no. 1, Research Paper 12, 24 pp.
189. R. Bisdorff, J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph (2007), http://arxiv.org/abs/math/0701647.
190. A. Bjorner and R. P. Stanley, A Combinatorial Miscellany in ``New directions in mathematics'', Cambridge Univ. Press, to appear. Preprint 1998.
191. Blanchard, Peter Floodstrand, Pseudo-arithmetic sets and Ramsey theory. J. Combin. Theory Ser. A 106 (2004), no. 1, 49-57.
192. Blanchini, Franco; Lepschy, Antonio; Miani, Stefano; Viaro, Umberto, Characterization of PID and lead/lag compensators satisfying given H_\infty specifications. IEEE Trans. Automat. Control 49 (2004), no. 5, 736-740.
193. R. Blanco, Complexity of Villamayor's algorithm in the monomial case (2007), http://arxiv.org/abs/0704.3416.
194. P. Blasiak , G. Dattoli , A. Horzela et al., Motzkin numbers, central trinomial coefficients and hybrid polynomials (2008); http://arxiv.org/abs/0802.0075
195. P. Blasiak, A. Horzela, K. A. Penson, G. H. E. Duchamp and A. I. Solomon, Boson Normal Ordering via Substitutions and Sheffer-Type Polynomials; Physics Letters A, Volume 338, Issue 2, 25 April 2005, Pages 108-116.
196. P. Blasiak, K. A. Penson and A. I. Solomon, The Boson Normal Ordering Problem and Generalized Bell Numbers
197. P. Blasiak, K. A. Penson and A. I. Solomon, Dobinski-type relations and the Log-normal distribution
198. P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, Combinatorial field theories via boson normal ordering
199. P. Blasiak, K. A. Penson, A. I. Solomon, The general boson normal ordering problem, Physics Letters A, Volume 309, Issues 3-4, 24 March 2003, Pages 198-205; http://arxiv.org/abs/quant-ph/0402027.
200. P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, Some useful combinatorial formulas for bosonic operators, J. Math. Phys. 46, 052110 (2005) (6 pages).
201. Bloch, Ethan D., The angle defect for odd-dimensional simplicial manifolds. Discrete Comput. Geom. 35 (2006), no. 2, 311-328.
202. V. Blondel, Structured Numbers. Properties of a hierarchy of internal operations on binary trees, Acta Informatica, 35, pp. 1-15, 1998. (ps, pdf)
203. Johannes Blumlein, Algebraic relations between harmonic sums and associated quantities, Computer Physics Communications, Volume 159, Issue 1, 1 May 2004, Pages 19-54.
204. J. Blümlein and W. L. van Neerven, Less Singular Terms and Small x Evolution in a Soluble Model, Phys.Lett. B450 (1999), 412-416.
205. H. Boas and S. Geller, A Survey of Mathematical Problems, Instructor's Guide.
206. Florin P. Boca, An AF algebra associated with the Farey tessellation (2005), http://arxiv.org/abs/math/0511505.
207. J.-P. Bode, Strategien für Aufbauspiele mit Mosaik-Polyominos, Doctoral Dissertation, 2000.
208. Arnaud Bodin, Number of irreducible polynomials in several variables over finite fields (2007), http://arxiv.org/abs/0706.0157, Amer. Math. Monthly, 115 (2008), 653-660.
209. Olivier Bodini and Eric Rivals, Tiling an Interval of the Discrete Line, in Combinatorial Pattern Matching, Lecture Notes in Computer Science, Volume 4009/2006, Springer-Verlag.
210. Manuel Bodirsky, Eric Fusy, Mihyun Kang et al., Enumeration of Unlabeled Outerplanar Graphs (2005), http://arxiv.org/abs/math/0511422.
211. M. Bodirsky, Clemens Gröpl and Mihyun Kang, Generating Labeled Planar Graphs Uniformly at Random, Theoret. Comput. Sci. 379 (2007), no. 3, 377-386.
212. Bodirsky, Manuel; Kang, Mihyun, Generating outerplanar graphs uniformly at random. Combin. Probab. Comput. 15 (2006), no. 3, 333-343.
213. Rutger Boels, Kasper J. Larsen, Niels A. Obers and Marcel Vonk, MHV, CSW and BCFW: field theory structures in string theory amplitudes (2008); http://arxiv.org/abs/0808.2598
214. Stefan Boettcher, Stephan Mertens, Analysis of the Karmarkar-Karp Differencing Algorithm (2008); http://arxiv.org/abs/0802.4040; The European Physical Journal B-Condensed Matter and Complex Systems, Volume 65, Number 1 / September, 2008.
215. Samuel Boissiere, Etienne Mann and Fabio Perroni, Crepant resolutions of weighted projective spaces and quantum deformations (2006), http://arxiv.org/abs/math/0610617.
216. E. Bolker, V. Guillemin and T. Holm, How is a graph like a manifold?, preprint.
217. Jurgen Bokowski, Branko Grunbaum, Lars Schewe, Topological configurations (n4) exist for all n17, European Journal of Combinatorics, In Press, Corrected Proof, Available online 13 January 2009.
218. Tommaso Bolognesi, A pseudo-random network mobile automaton with linear growth, Information Processing Letters, Volume 109, Issue 13, 15 June 2009, Pages 668-674.
219. Miklos Bona, On Two Related Questions of Wilf Concerning Standard Young Tableaux (2008); http://arxiv.org/abs/0805.2590; European Journal of Combinatorics, Volume 30, Issue 5, July 2009, Pages 1318-1322.
220. Miklos Bona, Philippe Flajolet, Isomorphism and Symmetries in Random Phylogenetic Trees (2009) http://arxiv.org/abs/0901.0696
221. Miklos Bona and Hyeong-Kwan Ju, Enumerating Solutions of a System of Linear Inequalities Related to Magic Squares, Annals of Combinatorics, Volume 10, Number 2 / September, 2006.
222. Miklós Bóna and Bruce E. Sagan, "On Divisibility of Narayana Numbers by Primes", J. Integer Sequences, Volume 8, 2005, Article 05.2.4.
223. Maria Paola Bonacina and Nachum Dershowitz, Canonical Inference for Implicational Systems, in Automated Reasoning, Lecture Notes in Computer Science, Volume 5195/2008, Springer-Verlag.
224. J. Bonin, A. de Mier and M. Noy, Lattice path matroids: enumerative aspects and Tutte polynomials, Journal of Combinatorial Theory, Series A, 104 (2003), no. 1, 63-94.
225. Julius Borcea, Boris Shapiro, Classifying real polynomial pencils (2004), http://arxiv.org/abs/math/0404215.
226. Olivier Bordellès, "A Note on the Average Order of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.3.3.
227. Magnus Bordewich, Martin Dyer and Marek Karpinski, Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs (2005), http://arxiv.org/abs/math/0501081.
228. A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, Multiplicative measures on free groups, Internat. J. Algebra Comput. 13 (2003), no. 6, 705-731.
229. J. Borwein, Aesthetics for the Working Mathematician, April 2001. [ps pdf]
230. J. Borwein, The Impact of Technology on the Doing of Mathematics, April 2000. [ps pdf]
231. J. Borwein and P. Borwein, Some observations on computer aided analysis, Notices Amer. Math. Soc. 39 (1992), 825-829.
232. J. M. Borwein and D. M. Bailey, Mathematics by Experiment, Peters, Boston, 2004.
233. J. M. Borwein and P. B. Borwein, Challenges in Mathematical Computing, Computing in Science and Engineering 3 (2001), 48-53. (PostScript , Pdf)
234. J. M. Borwein, P. R. Borwein and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.
235. J. M. Borwein, D. M. Bradley and D. J. Broadhurst, Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k, Elect. J. Combin., #R5 of Vol. 4(2), 1997.
236. J. M. Borwein, D. M. Bradley, D. J. Broadhurst and P. Lisonek, Special Values of Multiple Polylogarithms, Transactions of the American Mathematical Society, Vol. 353, No. 3, March 2001, pp. 907-941.
237. J. M. Borwein and K.-K. S. Choi, On the Representations of xy+yz+zx, Experimental Math., 9 (2000), 153-158.
238. J. M. Borwein and K.-K. S. Choi, On Dirichlet series for sums of squares, The Ramanujan Journal, special issue for Robert Rankin, Volume 7, Numbers 1-3 / March, 2003. (ps, pdf)
239. J. M. Borwein, K.-K. S. Choi and W. Pigulla, Continued Fractions of Tails of Hypergeometric Series, (ps, pdf), Amer. Math. Monthly, 112 (2005), 493-501.
240. J. M. Borwein and R. M. Corless, Review of ``An Encyclopedia of Integer Sequences'' by N. J. A. Sloane and Simon Plouffe", SIAM Review, 38 (1996), 333-337. (A review rather than a paper, but relevant.)
241. J. M. Borwein and R. M. Corless, Emerging tools for experimental mathematics, Amer. Math. Monthly, 106 (No. 10, 1999), 889-909.
242. W. Bosma, Signed bits and fast exponentiation, 21st Journées Arithmétiques (Rome, 2001). J. Théor. Nombres Bordeaux 13 (2001), no. 1, 27-41.
243. N. Boston, Explicit Galois Groups of Infinite p-Extensions Unramified at p, preprint.
244. O. Bottema, The Malfatti problem, Forum Geom. 1, 43-50, (2001).
245. H. Bottomley, Some Smarandache-type multiplicative sequences, Smarandache Notions Journal, Vol. 13, 2002, pp. 134-139.
246. Youssef Boudabbous, Maurice Pouzet, The morphology of infinite tournaments; application to the growth of their profile, European Journal of Combinatorics, In Press, Corrected Proof, Available online 17 May 2009.
247. Jacques Boulanger and Jean-Luc Chabert. On the representation of integers as linear combinations of consecutive values of a polynomial. Trans. Amer. Math. Soc. 356 (2004) 5071-5088.
248. Sadek Bouroubi, "Integer Partitions and Convexity", J. Integer Sequences, Volume 10, 2007, Article 07.6.3.
249. M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar 2-face maps, Discrete Mathematics, 222 (2000), 1-25.
250. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees, Proceedings FPSAC02, 133-147, (2002). (PostScript, Pdf)
251. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.
252. Bousquet-Mélou, Mireille, Four classes of pattern-avoiding permutations under one roof: generating trees with two labels. Permutation patterns (Otago, 2003). Electron. J. Combin. 9 (2002/03), no. 2, Research paper 19, 31 pp.
253. Mireille Bousquet-Melou and Marni Mishna, Walks with small steps in the quarter plane (preliminary version), arXiv:0810.4387 [math.CO]
254. Mireille Bousquet-Melou, Svante Linusson and Eran Nevo, On the independence complex of square grids, Journal of Algebraic Combinatorics, Volume 27, Number 4 / June, 2008.
255. M. Bousquet-Mélou and G. Schaeffer, Walks on the slit plane, Probab. Theory Related Fields, 124 (2002), no. 3, 305-344.
256. J. Bouttier, Énumération des méandres: une approche à partir des méthodes de physique théorique, Mémoire d'exposé bibliographique du DEA de Physique Théorique, 2001.
257. Mathilde Bouvel , Elisa Pergola, Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents (2008); http://arxiv.org/abs/0806.1494
258. C. Boyapati, S. Khurshid and D. Marinov, Korat: Automated testing Based on Java Predicates, ACM International Symposium on Software Testing and Analysis (ISSTA), Rome, Italy, July 2002. (This paper won an ACM Distinguished Paper Award) [PostScript, PDF]
259. Christian Boyer, "Some Notes on the Magic Squares of Squares Problem", The Mathematical Intelligencer, Vol. 27, No. 2, Spring 2005, pages 52-64, Springer, New-York, 2005
260. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János, Einstein metrics on spheres. Ann. of Math. (2) 162 (2005), no. 1, 557-580.
261. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János; Thomas, Evan, Einstein metrics on exotic spheres in dimensions 7, 11 and 15. Experiment. Math. 14 (2005), no. 1, 59-64.
262. Harry W. Braden, Victor Z. Enolskii and Andrew N.W. Hone, Bilinear recurrences and addition formulae for hyperelliptic sigma functions (2005), http://arxiv.org/abs/math/0501162.
263. D. M. Bradley, A Class of Series Acceleration Formulae for Catalan's Constant, The Ramanujan Journal, Vol. 3, Issue 2, June 1999, pp. 159-173.
264. D. M. Bradley, Experimental Mathematics via Inverse Symbolic Computation, Invited Talk, Department of Mathematics and Statistics, University of Maine, Orono, Maine, June 12, 1997.
265. R. Brak, A. C. Oppenheim and A. L. Owczarek, Anisotropic step, surface contact and area weighted directed walks on the triangular lattice, Int. J. Mod. Phys. B, Vol. 16, N. 9 (2002), 1269-1299.
266. Brändén, Petter; Mansour, Toufik, Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A 110 (2005), no. 1, 127-145.
267. Petter Branden, Toufik Mansour, Finite automata and pattern avoidance in words, Journal of Combinatorial Theory, Series A, Volume 110, Issue 1, April 2005, Pages 127-145.
268. Maria Bras-Amoros, Fibonacci-like behavior of the number of numerical semigroups of a given genus, Semigroup Forum, Volume 76, Number 2 / March, 2008.
269. Bremner, Murray R.; Hentzel, Irvin R.; Peresi, Luiz A., Dimension formulas for the free nonassociative algebra. Comm. Algebra 33 (2005), no. 11, 4063-4081.
270. Y. V. Brezhnev, Uniformization: on the Burnside curve y^2=x^5-x (2001), http://arxiv.org/abs/math/0111150.
271. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the S_n-module structure of the noncommutative harmonics (2007), http://arxiv.org/abs/0704.1101.
272. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the image-module structure of the noncommutative harmonics, Journal of Combinatorial Theory, Series A, Volume 115, Issue 6, August 2008, Pages 1077-1085.
273. Robert Brignall, A Survey of Simple Permutations (2008); http://arxiv.org/abs/0801.0963
274. David Brink, Five peculiar theorems on simultaneous representation of primes by quadratic forms. J. Number Theory, 2008, to appear. Links: doi:10.1016/j.jnt.2008.04.007, http://www.youtube.com/watch?v=l_yRq0oqKx4 (video abstract).
275. Gunnar Brinkmann and Brendan D. McKay, "Counting Unlabelled Topologies and Transitive Relations", J. Integer Sequences, Volume 8, 2005, Article 05.2.1.
276. Marcus Brinkmann and Gregor Leander, On the classification of APN functions up to dimension five, Designs, Codes and Cryptography, Volume 49, Numbers 1-3 / December, 2008.
277. S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for succession rules, Discr. Math., 298 (2005), 142-154.
278. Brlek, Srecko; Frosini, Andrea; Rinaldi, Simone; Vuillon, Laurent, Tilings by translation: enumeration by a rational language approach. Electron. J. Combin. 13 (2006), no. 1, Research Paper 15, 24 pp.
279. D. J. Broadhurst, On the enumeration of irreducible k-fold Euler sums and their roles in knot theory and field theory.
280. D. J. Broadhurst, Conjectured enumeration of irreducible multiple zeta values, from knots and Feynman diagrams.
281. D. J. Broadhurst, Conjectured enumeration of Vassiliev invariants.
282. D. J. Broadhurst, Four-loop Dyson-Schwinger-Johnson anatomy.
283. David Broadhurst, Solutions by radicals at singular values k_N from new class invariants for N \equiv 3 mod 8 (2008); http://arxiv.org/abs/0807.2976
284. D. J. Broadhurst and D. Kreimer: Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops. Phys. Lett. B 393, No.3-4, 403-412 (1997).
285. D. J. Broadhurst and D. Kreimer: Renormalization automated by Hopf algebra.
286. D. J. Broadhurst and D. Kreimer: Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Pade-Borel resummation; Physics Letters B, Volume 475, Issues 1-2, 24 February 2000, Pages 63-70.
287. D. J. Broadhurst and D. Kreimer, Towards cohomology of renormalization: bigrading the combinatorial Hopf algebra of rooted trees. Comm. Math. Phys. 215 (2000), no. 1, 217-236.
288. A. Broder, M. Mitzenmacher and L. Moll, Unscrambling Address Lines, In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), January 1999. (PostScript , Pdf)
289. Brodmann, Markus, Castelnuovo-Mumford regularity and degrees of generators of graded submodules. Illinois J. Math. 47 (2003), no. 3, 749-767.
290. A. Brodsky, S. Durocher and E. Gethner, The Rectilinear Crossing Number of K10 is 62, The Electronic Journal of Combinatorics, Volume 8(1), 2001, R#23.
291. D. M. Broline and D. E. Loeb, The Combinatorics of Mancala-Type Games: Ayo, Tchoukaitlon and 1/pi, UMAP Journal, 16.1 (1995) 21-36.
292. Kevin A. Broughan, "The Gcd-Sum Function", J. Integer Sequences, Volume 4, 2001, Article 01.2.2.
293. Kevin A. Broughan, "Characterizing the Sum of Two Cubes", J. Integer Sequences, Volume 6, 2003, Article 03.4.6.
294. Kevin A. Broughan, "The Average Order of the Dirichlet Series of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.4.2.
295. S. A. Broughton, D. M. Haney, L. T. McKeough and B. S. Mayfield, Divisible Tilings in the Hyperbolic Plane, New York J. Math. 6 (2000) 237-283.
296. J. Brousek, R. Cada, T. Kaiser, Z. Ryjácek, Diskrétní matematika, Lecture Notes.
297. Nicolas Broutin, Philippe Flajolet, The height of random binary unlabelled trees (2008); http://arxiv.org/abs/0807.2365
298. A. E. Brouwer, The Enumeration of Locally Transitive Tournaments. Math. Centr. Report ZW138, Amsterdam, April 1980.
299. F. C. S. Brown, T. M. A. Fink and K. Willbrand, On arithmetic and asymptotic properties of up-down numbers, arXiv:math/0607763 [math.CO] (2006); Discrete Math. 307 (2007), no. 14, 1722-1736.
300. F. Brunault, La fonction 'tau' de Ramanujan, Séminaire des doctorants de l'équipe de théorie des nombres de Chevaleret. (ps, pdf)
301. A. B. Buan and H. Krause, Tilting and cotilting for quivers of type Ãn, J. Pure Appl. Algebra 190 (2004), no. 1-3, 1-21.
302. R. H. Buchholz and R. L Rathbun, An infinite set of Heron triangles with two rational medians, Amer. Math. Monthly 104 (1997), no. 2, 107-115.
303. Yann Bugeaud, Christophe Reutenauer, Samir Siksek, A Sturmian sequence related to the uniqueness conjecture for Markoff numbers, Theoretical Computer Science, Volume 410, Issues 30-32, 20 August 2009, Pages 2864-2869.
304. Grady Bullington, "The Connell Sum Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.2.6.
305. Fokko J. van de Bult, Dion C. Gijswijt, John P. Linderman, N. J. A. Sloane and Allan R. Wilks, "A Slow-Growing Sequence Defined by an Unusual Recurrence", J. Integer Sequences, Volume 10, 2007, Article 07.1.2. [pdf, ps].
306. Fokko van de Bult and Jaap Korevaar, Mean value one of prime-pair constants (2008); http://arxiv.org/abs/0806.1667
307. A. P. Burger, M. P. Kidd and J. H. van Vuuren, Enumeration of self-orthogonal Latin squares, Submitted to Journal of Combinatorial Designs.
308. Emily Burgunder, Ralf Holtkamp, Partial magmatic bialgebras (2007), http://arxiv.org/abs/0708.4191.
309. Burstein, Alexander, Restricted Dumont permutations. Ann. Comb. 9 (2005), no. 3, 269-280.
310. Alexander Burstein, Sergi Elizalde and Toufik Mansour, Restricted Dumont permutations, Dyck paths and noncrossing partitions, arXiv math.CO/0610234, Discrete Math. 306 (2006), no. 22, 2851-2869.
311. Alexander Burstein, Sergey Kitaev, Toufik Mansour, Independent sets in certain classes of (almost) regular graphs (2003), http://arxiv.org/abs/math/0310379.
312. Alexander Burstein and Isaiah Lankham, Restricted Patience Sorting and Barred Pattern Avoidance (2005), http://arxiv.org/abs/math/0512122.
313. Steve Butler, Ron Graham, Enumerating (multiplex) juggling sequences (2008); http://arxiv.org/abs/0801.2597
314. Steve Butler, Ron Graham, Nan Zang, Jumping sequences (2008); http://arxiv.org/abs/0807.2890
315. Andrea Caggegi, Alfonso Di Bartolo, Giovanni Falcone, Boolean 2-designs and the embedding of a 2-design in a group (2008); http://arxiv.org/abs/0806.3433
316. A. R. Calderbank, P. Delsarte and N. J. A. Sloane, A Strengthening of the Assmus-Mattson Theorem, IEEE Trans. Information Theory, 37 (1991), pp. 1261-1268. (postscript, pdf)
317. Chris K. Caldwell and Yuanyou Cheng, "Determining Mills' Constant and a Note on Honaker's Problem", J. Integer Sequences, Volume 8, 2005, Article 05.4.1.
318. C. Caldwell and G. L. Honaker, Jr., "Palindromic prime pyramids," J. Recreational Math., 30:3 (1999-2000) 169-176. [ps, pdf, doc]
319. C. Caldwell and G. L. Honaker, Jr., Is pi(6521)=6!+5!+2!+1! unique?, Math. Spectrum, 22:2 (2000/2001) 34-36. [ps, pdf, doc]
320. N. Calkin and H. S. Wilf, Recounting the rationals, Amer. Math. Monthly, 107 (No. 4, 2000), pp. 360-363. (Only the printed version mentions the On-Line Encyclopedia of Integer Sequences.)
321. J. Callaghan, J. J. Chew, III and S. M. Tanny, On the Behaviour of a Family of Meta-Fibonacci Sequences, SIAM J. Discrete Math. 18 (2005), no. 4, 794-824.
322. D. Callan, Certificates of Integrality for Linear Binomials, Fibonacci Quarterly, 38 (Aug 2000), 317-325.
323. David Callan, "A Combinatorial Derivation of the Number of Labeled Forests", J. Integer Sequences, Volume 6, 2003, Article 03.4.7.
324. Callan, David, A uniformly distributed statistic on a class of lattice paths. Electron. J. Combin. 11 (2004), no. 1, Research Paper 82, 8 pp.
325. David Callan, "Counting Stabilized-Interval-Free Permutations", J. Integer Sequences, Volume 7, 2004, Article 04.1.8.
326. David Callan, "A Combinatorial Interpretation for a Super-Catalan Recurrence", J. Integer Sequences, Volume 8, 2005, Article 05.1.8.
327. David Callan, "A Combinatorial Interpretation of the Eigensequence for Composition", J. Integer Sequences, Volume 9, 2006, Article 06.1.4.
328. David Callan, A Combinatorial Interpretation of j/n {kn}\choose{n+j} (2006), http://arxiv.org/abs/math/0604471.
329. David Callan, "On Generating Functions Involving the Square Root of a Quadratic Polynomial", J. Integer Sequences, Volume 10, 2007, Article 07.5.2.
330. David Callan, Sets, Lists and Noncrossing Partitions (2007), http://arxiv.org/abs/0711.4841.
331. David Callan, Klazar trees and perfect matchings (2008); http://arxiv.org/abs/0810.4901
332. C. S. Calude, E. Calude and M. J. Dinneen, What is the value of Taxicab(6)?, J. Universal Computer Science, 9 (2003), 1196-1203.
333. Naiomi T. Cameron and Asamoah Nkwanta, "On Some (Pseudo) Involutions in the Riordan Group", J. Integer Sequences, Volume 8, 2005, Article 05.3.7.
334. P. J. Cameron, Some sequences of integers, Discrete Math., 75 (1989), 89-102 ; also in "Graph Theory and Combinatorics 1988", ed. B. Bollobas, Annals of Discrete Math., 43 (1989), 89-102.
335. P. J. Cameron, Counting two-graphs related to trees, Electronic Journal of Combinatorics, Volume 2(1), 1995, R#4.
336. P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1994 (reprinted 1996).
337. P. J. Cameron, Stories about groups and sequences, in Special issue dedicated to Hanfried Lenz of Des. Codes Cryptogr. 8 (1996), no. 1-2, 109-133 (DVI or PostScript). Corrected reprint in op. cit. 8 (1996), no. 3, 109-133.
338. P. J. Cameron, The algebra of an age, pp. 126-133 in Model Theory of Groups and Automorphism Groups (ed. D. M. Evans), London Mathematical Society Lecture Notes 244, Cambridge University Press, Cambridge, 1997. (dvi, ps)
339. Peter J. Cameron, "Sequences Realized by Oligomorphic Permutation Groups", J. Integer Sequences, Volume 3, 2000, Article 00.1.5.
340. P. J. Cameron, Homogeneous permutations, Electronic J. Combinatorics 9(2) (2002), #R2 (9pp).
341. Cameron, Peter J. Research problems from the 19th British Combinatorial Conference. Discrete Math. 293 (2005), no. 1-3, 313-320.
342. P. J. Cameron, D. A. Gewurz and F. Merola, Product action, Discrete Math., 308 (2008), 386-394.
343. P. J. Cameron and C. R. Johnson, The number of equivalence patterns of symmetric sign patterns, Discr. Math., 306 (2006), 3074-3077.
344. P. J. Cameron and D. A. Preece, Primitive lambda-roots, Combinatorics Study Group notes, March 2003.
345. Peter Cameron, Thomas Prellberg and Dudley Stark, Asymptotic enumeration of incidence matrices (2005), http://arxiv.org/abs/math/0511008.
346. P. J. Cameron, T. Prellberg and D. Stark, Asymptotics for incidence matrix classes , Electron. J. Combin. 13 (2006), no. 1, Research Paper 85, 19 pp.
347. Saverio Caminiti and Emanuele G. Fusco, "On the Number of Labeled k-arch Graphs", J. Integer Sequences, Volume 10, 2007, Article 07.7.5.
348. E. Rodney Canfield, Carla D. Savage and Herbert S. Wilf, Regularly Spaced Subsums of Integer Partitions, Acta Arith. 115 (2004), no. 3, 205-216.
349. E. Rodney Canfield, Herbert S. Wilf, Counting permutations by their alternating runs, http://arxiv.org/abs/math/0609704, Journal of Combinatorial Theory, Series A, Volume 115, Issue 2, February 2008, Pages 213-225.
350. C. Cannings, J. Haigh, Montreal Solitaire, Journal of Combinatorial Theory, Series A, Volume 60, Issue 1, May 1992, Pages 50-66.
351. Gabriel Cardona, Merce Llabres, Francesc Rossello et al., Nodal distances for rooted phylogenetic trees (2008); http://arxiv.org/abs/0806.2035
352. J. Carlsson and B. H. J. McKellar, SU(N) Glueball Masses in 2+1 Dimensions, hep-lat/0303016, (2003).
353. Gordon G. Cash and Jerry Ray Dias, Computation, Properties and Resonance Topology of Benzenoid Monoradicals and Polyradicals and the Eigenvectors Belonging to Their Zero Eigenvalues, J. Math. Chem., 30 (2002), 429-444.
354. Castiglione, G.; Frosini, A.; Munarini, E.; Restivo, A.; Rinaldi, S., Combinatorial aspects of L-convex polyominoes. European J. Combin. 28 (2007), no. 6, 1724-1741.
355. Castiglione, G.; Frosini, A.; Restivo, A.; Rinaldi, S., Enumeration of L-convex polyominoes by rows and columns. Theoret. Comput. Sci. 347 (2005), no. 1-2, 336-352.
356. Jose Castillo, Other Smarandache type functions
357. M. Catalani, Polymatrix and generalized polynacci numbers, (2002). arXiv:math.CO/0210201
358. M. Catalani, Identities for Tribonacci-related sequences, (2002). arXiv:math.CO/0209179
359. M. Catalani, Sequences related to convergents to square root of rationals, (2003). arXiv:math.NT/0305270
360. M. Catalani, On the average of triangular numbers, (2003). arXiv:math.NT/0304160
361. M. Catalani, Sequences related to the Pell generalized equation, (2003). arXiv:math.CO/0304062
362. N. Cavenagh and P. Lisonek, Planar Eulerian triangulations are equivalent to spherical latin bitrades, J. Combin. Theory, Series A, to appear, 2007.
363. F. Cazals, Combinatorial properties of one-dimensional arrangements. J. Exp. Math. 6, No.1, 87-94 (1997).
364. F. Cazals, Combinatorics of Non-Crossing Configurations, Studies in Automatic Combinatorics, Volume II (1997).
365. F. Cazals, Monomer-Dimer Tilings, Studies in Automatic Combinatorics, Vol. 2, 1997.
366. Cerin, Zvonko, Some alternating sums of Lucas numbers. Cent. Eur. J. Math. 3 (2005), no. 1, 1-13 .
367. Zvonko Cerin, "Sums of Squares and Products of Jacobsthal Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.2.5.
368. Jean-Luc Chabert and Paul-Jean Cahen, Old problems and new questions around integer-valued polynomials and factorial sequences, in Multiplicative Ideal Theory in Commutative Algebra, Springer-Verlag.
369. Chaichanavong, Panu; Marcus, Brian H. Stabilization of block-type-decodability properties for constrained systems. SIAM J. Discrete Math. 19 (2005), no. 2, 321-344 .
370. N. Chair, Explicit Computations for the Intersection Numbers on Grassmannians and on the Space of Holomorphic Maps from CP^1 into G_r(C^n), Trieste 1998, 16 p. (SISSA-ISAS 92/98/FM-EP).
371. Chair, Noureddine, Intersection numbers on Grassmannians and on the space of holomorphic maps from CP^1 into G_r(C^n). J. Geom. Phys. 38 (2001), no. 2, 170-182.
372. Chair, Noureddine, The Waring formula and fusion rings. J. Geom. Phys. 37 (2001), no. 3, 216-228.
373. Noureddine Chair, Partition Identities From Partial Supersymmetry (2004), http://arxiv.org/abs/hep-th/0409011.
374. Marc Chamberland, "Binary BBP-Formulae for Logarithms and Generalized Gaussian-Mersenne Primes", J. Integer Sequences, Volume 6, 2003, Article 03.3.7.
375. Marc Chamberland and Christopher French, "Generalized Catalan Numbers and Generalized Hankel Transformations", J. Integer Sequences, Volume 10, 2007, Article 07.1.1.
376. A. C. Chan, W. I. Gasarch and C. P. Kruskal, Refined Upper and Lower Bounds for Two-sum. 1997.
377. Ray Chandler and Eugen J. Ionascu, A characterization of all equilateral triangles in Z^3 (2007), http://arxiv.org/abs/0710.0708.
378. Shu-Chiuan Chang and Lung-Chi Chen, Spanning forests on the Sierpinski gasket (2006), http://arxiv.org/abs/math-ph/0612083.
379. Shu-Chiuan Chang, Jesper Lykke Jacobsen, Jesus Salas and Robert Shrock, Exact Potts Model Partition Functions for Strips of the Triangular Lattice, Journal of Statistical Physics, Volume 114, Numbers 3-4 / February, 2004.
380. Shu-Chiuan Chang, Jesus Salas and Robert Shrock, Exact Potts Model Partition Functions for Strips of the Square Lattice, Journal of Statistical Physics, Volume 107, Numbers 5-6 / June, 2002.
381. Shu-Chiuan Chang, Robert Shrock, Structural properties of Potts model partition functions and chromatic polynomials for lattice strips, Physica A: Statistical Mechanics and its Applications, Volume 296, Issues 1-2, 1 July 2001, Pages 131-182.
382. Shu-Chiuan Chang and Robert Shrock, Flow Polynomials and Their Asymptotic Limits for Lattice Strip Graphs, Journal of Statistical Physics, Volume 112, Numbers 3-4 / August, 2003.
383. Shu-Chiuan Chang, Robert Shrock, Transfer matrices for the partition function of the Potts model on lattice strips with toroidal and Klein-bottle boundary conditions, Physica A: Statistical Mechanics and its Applications, Volume 364, 15 May 2006, Pages 231-262.
384. Robin J. Chapman, Timothy Y. Chow, Amit Khetan et al., Simple formulas for lattice paths avoiding certain periodic staircase boundaries (2007), http://arxiv.org/abs/0705.2888; Journal of Combinatorial Theory, Series A, Volume 116, Issue 1, January 2009, Pages 205-214.
385. Chapoton, F., Sur le nombre d'intervalles dans les treillis de Tamari. Sém. Lothar. Combin. 55 (2005/06), Art. B55f, 18 pp.
386. F. Chapoton, Florent Hivert, Jean-Christophe Novelli et al., An operational calculus for the Mould operad (2007), http://arxiv.org/abs/0710.0349.
387. Alain Chaumont and Tom Müller "All Elite Primes Up to 250 Billion", J. Integer Sequences, Volume 9, 2006, Article 06.3.8.
388. C. Chauve, Structures arborescentes : problèmes algorithmiques et combinatoires, PHD thesis - LaBRI, Université Bordeaux 1 (2000).
389. D. Chavarria-Miranda, A. Darte, R. Fowler and J. Mellor-Crummey, On efficient parallelization of line-sweep computations, Research Report 2001-45, Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superiore de Lyon, November 2001.
390. L. B. Chaves and P. A. Velloso, Teoria e pratica na busca de numeros primos de Mersenne, 1st Simposio Sul-Brasileiro de Matematica e Informatica Uniandrade.
391. H. Cheballah , G. H. E. Duchamp , K. A. Penson, Approximate substitutions and the normal ordering problem (2008); http://arxiv.org/abs/0802.1162
392. Denis Chebikin, Richard Ehrenborg, Pavlo Pylyavskyy et al., Cyclotomic factors of the descent set polynomial (2007), http://arxiv.org/abs/0705.2451.
393. Hongwei Chen, "Evaluations of Some Variant Euler Sums", J. Integer Sequences, Volume 9, 2006, Article 06.2.3.
394. Kwang-Wu Chen, "Algorithms for Bernoulli numbers and Euler numbers", J. Integer Sequences, Volume 4, 2001, Article 01.1.6.
395. Kwang-Wu Chen, "An Interesting Lemma for Regular C-fractions", J. Integer Sequences, Volume 6, 2003, Article 03.4.8.
396. Ricky X. F. Chen and Louis W. Shapiro, "On Sequences Gn Satisfying Gn = (d+2)Gn-1 - Gn-2", J. Integer Sequences, Volume 10, 2007, Article 07.8.1.
397. William Y. C. Chen, Eva Y. P. Deng, Laura L. M. Yang, Riordan Paths and Derangements (2006), http://arxiv.org/abs/math/0602298; Discrete Mathematics, Volume 308, Issue 11, 6 June 2008, Pages 2222-2227.
398. William Y. C. Chen, Nelson Y. Li, Louis W. Shapiro, The Butterfly Decomposition of Plane Trees (2005), http://arxiv.org/abs/math/0511045; Discrete Applied Mathematics, Volume 155, Issue 17, 15 October 2007, Pages 2187-2201.
399. Chen, William Y. C.; Li, Nelson Y.; Shapiro, Louis W.; Yan, Sherry H. F. Matrix identities on weighted partial Motzkin paths. European J. Combin. 28 (2007), no. 4, 1196-1207.
400. Chen, William Y. C.; Mansour, Toufik; Yan, Sherry H. F. Matchings avoiding partial patterns. Electron. J. Combin. 13 (2006), no. 1, Research Paper 112, 17 pp.
401. W. Y. C. Chen, S. X. M. Pang, E. X. Y. Qu and R. P Stanley, Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions, http://arxiv.org/abs/0804.2930; Discrete Math., 309 (2009), 2834-2838.
402. William Y. C. Chen, Susan Y. J. Wu and Catherine Yan, Linked Partitions and Linked Cycles (2006), http://arxiv.org/abs/math/0607719; European Journal of Combinatorics, Volume 29, Issue 6, August 2008, Pages 1408-1426.
403. William Y. C. Chen, Sherry H. F. Yan, Laura L. M. Yang, Weighted 2-Motzkin Paths (2004), http://arxiv.org/abs/math/0410200.
404. William Y.C. Chen, Sherry H.F. Yan, Laura L.M. Yang, Identities from weighted Motzkin paths, Advances in Applied Mathematics, Volume 41, Issue 3, September 2008, Pages 329-334.
405. Eddie Cheng, Marc J. Lipman, Laszlo Liptak, Strong structural properties of unidirectional star graphs, Discrete Applied Mathematics, Volume 156, Issue 15, 6 August 2008, Pages 2939-2949.
406. Cheng, Szu-En; Eu, Sen-Peng; Fu, Tung-Shan, Area of Catalan paths on a checkerboard. European J. Combin. 28 (2007), no. 4, 1331-1344.
407. Gi-Sang Cheon, M.E.A. El-Mikkawy, Generalized harmonic numbers with Riordan arrays, Journal of Number Theory, Volume 128, Issue 2, February 2008, Pages 413-425.
408. Gi-Sang Cheon, Sung-Tae Jin, Hana Kim, Louis W. Shapiro, Riordan group involutions and the -sequence, Discrete Applied Mathematics, Volume 157, Issue 8, 28 April 2009, Pages 1696-1701.
409. Gi-Sang Cheon, Hana Kim, Simple proofs of open problems about the structure of involutions in the Riordan group, Linear Algebra and its Applications, Volume 428, Issue 4, 1 February 2008, Pages 930-940.
410. Gi-Sang Cheon, Hana Kim, Louis W. Shapiro, Riordan group involutions, Linear Algebra and its Applications, Volume 428, Issue 4, 1 February 2008, Pages 941-952.
411. Gi-Sang Cheon, Hana Kim, Louis W. Shapiro, A generalization of Lucas polynomial sequence, Discrete Applied Mathematics, Volume 157, Issue 5, 6 March 2009, Pages 920-927.
412. Gi-Sang Cheon, Sang-Gu Lee, Louis W. Shapiro, The Fine numbers refined, European Journal of Combinatorics, In Press, Corrected Proof, Available online 16 June 2009.
413. Otfried Cheong, Mira Lee, The Hadwiger Number of Jordan Regions is Unbounded (2007), http://arxiv.org/abs/cs/0702079; Discrete and Computational Geometry, Volume 37, Number 4 / May, 2007.
414. Andrew M. Childs, Pawel Wocjan, On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems (2005), http://arxiv.org/abs/quant-ph/0510185.
415. L. N. Childs, A Concrete Introduction to Higher Algebra, Springer-Verlag.
416. P. Z. Chinn, R. Grimaldi and S. Heubach, Rises, Levels, Drops and "+" Signs in Compositions, to appear in Fibonacci Quarterly.
417. P. Z. Chinn, R. Grimaldi and S. Heubach, The Frequency of Summands of a Particular Size in Palindromic Compositions, Ars Combin. 69 (2003), 65-78.
418. Phyllis Chinn, Ralph Grimaldi and Silvia Heubach, "Tiling with L's and Squares", J. Integer Sequences, Volume 10, 2007, Article 07.2.8.
419. Phyllis Chinn and Silvia Heubach, "Integer Sequences Related to Compositions without 2's", J. Integer Sequences, Volume 6, 2003, Article 03.2.3.
420. P. Z. Chinn and S. Heubach, Compositions of n with no occurrence of k, preprint (submitted to Congressus Numerantium).
421. P. Z. Chinn and S. Heubach, (1,k)-Compositions, preprint (submitted to Congressus Numerantium).
422. P. Z. Chinn and D. R. Oliver, Some Results Inspired by Covering Rectangles with 1x1 and 1x3 Rectangles, Congr. Numerantium 122, 119-124 (1996).
423. F.A. Chishtie, K.M. Rao, I.S. Kotsireas et al., An investigation of uniform expansions of large order Bessel functions in Gravitational Wave Signals from Pulsars (2006), http://arxiv.org/abs/astro-ph/0611035.
424. B. Chitturi, W. Fahle, Z. Meng, L. Morales, C.O. Shields, I.H. Sudborough, W. Voit, An (18/11)n upper bound for sorting by prefix reversals, Theoretical Computer Science, In Press, Corrected Proof, Available online 10 May 2008.
425. Y.B. Choe, K.T. Huber, J.H. Koolen, Y.S. Kwon, V. Moulton, Counting vertices and cubes in median graphs of circular split systems, European Journal of Combinatorics, Volume 29, Issue 2, February 2008, Pages 443-456.
426. Choi, Gyoung-Sik; Hwang, Suk-Geun; Kim, Ik-Pyo; Shader, Bryan L. (+-1)-invariant sequences and truncated Fibonacci sequences. Linear Algebra Appl. 395 (2005), 303-312.
427. Chak-On Chow, On certain combinatorial expansions of the Eulerian polynomials, Advances in Applied Mathematics, Volume 41, Issue 2, August 2008, Pages 133-157.
428. Stirling Chow and Frank Ruskey, "Minimum Area Venn Diagrams Whose Curves Are Polyominoes", Mathematics Magazine, Vol. 80, (2007) pp. 91-103.
429. Stirling Chow, Frank Ruskey, Gray codes for column-convex polyominoes and a new class of distributive lattices, Discrete Mathematics, 309 (2009), 5284-5297.
430. T. Y. Chow, H. Eriksson and C. K. Fan, Chess tableaux, Elect. J. Combin., 11 (2) (2005), #A3. [T. Y. Chow writes that although they forgot to mention it in the paper, the OEIS helped them discover the main theorem.]
431. Julie Christophe, Jean-Paul Doignon and Samuel Fiorini, "Counting Biorders", J. Integer Sequences, Volume 6, 2003, Article 03.4.3.
432. Wenchang Chu, Three Combinatorial Sequences Derivable from the Lattice Path Counting, Annals of Discrete Mathematics, Volume 52, 1992, Pages 81-92.
433. K. S. Chua, The root lattice A*_n and Ramanujan's circular summation of theta functions, Proc. Amer. Math. Soc. 130 (2002), no. 1, 1-8.
434. F. R. K. Chung, R. L. Graham, V. E. Hoggatt Jr., M. Kleiman, The number of baxter permutations, Journal of Combinatorial Theory, Series A, Volume 24, Issue 3, May 1978, Pages 382-394.
435. V. Chvatal, Notes on the Kolakoski Sequence, DIMACS Technical Report 93-84, December 1993.
436. F. Chyzak, I. Gutman and P. Paule, Predicting the number of hexagonal systems with 24 and 25 hexagons, Communications in Mathematical and Computer Chemistry, no. 40, p. 139-151.
437. Chyzak, Frédéric; Mishna, Marni; Salvy, Bruno, Effective scalar products of D-finite symmetric functions. J. Combin. Theory Ser. A 112 (2005), no. 1, 1-43.
438. Irena Cieslinska, Co rozpala umysly, kt�rych nikt nie rozumie?, [What enkindles the greatest intellects in the world?] (Polish), Gazeta Wyborcza, September 28, 2009

439. Johann Cigler, Some results and conjectures about recurrence relations for certain sequences of binomial sums (2006), http://arxiv.org/abs/math.CO/0611189.
440. Johann Cigler, Recurrence relations for powers of q-Fibonacci polynomials (2008); http://arxiv.org/abs/0806.0805
441. Johann Cigler, Some conjectures about q-Fibonacci polynomials (2008); http://arxiv.org/abs/0805.0415
442. A. Claesson, Generalized Pattern Avoidance, FPSAC01, European Journal of Combinatorics 22 (2001), 961-971. (PostScript, Pdf)
443. Anders Claesson, Sergey Kitaev, Kari Ragnarsson et al., Boolean complexes for Ferrers graphs (2008); http://arxiv.org/abs/0808.2307
444. Anders Claesson and Toufik Mansour, Permutations avoiding a pair of generalized patterns of the form x-yz or xy-z (2001), http://arxiv.org/abs/math/0107044.
445. A. Claesson and T. Mansour, Counting occurrences of a pattern of type (1,2) or (2,1) in permutations, Accepted for publication in Advances in Applied Mathematics. (PostScript, Pdf, Dvi)
446. A. Claesson and T. Mansour, Enumerating Permutations Avoiding a Pair of Babson-Steingrímsson Patterns, (ps, pdf) Ars Combin. 77 (2005), 17-31.
447. A. Claesson and T. K. Petersen, Conway's Napkin Problem, American Mathematical Monthly, 114 (No. 3, 2007), 217-231.
448. Lieven Clarisse, Sibasish Ghosh, Simone Severini et al., Entangling Power of Permutations (2005), http://arxiv.org/abs/quant-ph/0502040.
449. Lane Clark, "An Asymptotic Expansion for the Catalan-Larcombe-French Sequence", J. Integer Sequences, Volume 7, 2004, Article 04.2.1.
450. J. C. Claussen, Time evolution of the rule 150 cellular automaton activity from a Fibonacci iteration, J. Math. Phys 49 (2008) 062701
451. Benoit Cloitre, Chemins dans un tableau arithmetique, 2007.
452. Benoit Cloitre, N. J. A. Sloane and Matthew J. Vandermast, "Numerical Analogues of Aronson's Sequence", J. Integer Sequences, Volume 6, 2003, Article 03.2.2.
453. Pietro Codara, Ottavio M. D'Antona and Vincenzo Marra, Best Approximation of Ruspini Partitions in G�del Logic, in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Computer Science, Volume 4724/2007, Springer-Verlag.
454. Pietro Codara, Ottavio M. D'Antona, Vincenzo Marra, An analysis of Ruspini partitions in Godel logic, International Journal of Approximate Reasoning, Volume 50, Issue 6, June 2009, Pages 825-836.
455. A. M. Cohen, Communicating mathematics across the web, pp. 283-300 of B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and Beyond, 2 vols., Springer-Verlag, 2001.
456. A. M. Cohen, H. Cuypers, E. Reinaldo Barreiro and H. Sterk, Interactive Mathematical Documents on the Web, to appear in Proceedings of Dagstuhl Conference.
457. D. Cohen, Machine Head, New Scientist, 24 Feb 2001, Vol. 169, Number 2279, pp. 26-29. (Article about artificial intelligence that mentions the database.)
458. G. L. Cohen and D. E. Iannucci, "Derived Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.1.1.
459. Jonathan D. Cohen, Concepts and Algorithms for Polygonal Simplification, SIGGRAPH 99 Course Tutorial #20: Interactive Walkthroughs of Large Geometric Datasets. pp. C1-C34. 1999. also in SIGGRAPH 2000 Course Tutorial.
460. C. Coker, A family of eigensequences, Discrete Math., 282 (2004), 249-250.
461. Coker, Curtis, Enumerating a class of lattice paths. Discrete Math. 271 (2003), no. 1-3, 13-28.
462. S. Cokus, Summing Sums Symbolically: How Computers Revolutionized the Field of Combinatorial Identities, ACMS Seminar, Winter Quarter 2001.
463. C. S. Collberg and T. A. Proebsting, AlgoVista - A Search Engine for Computer Scientists, Arizona Computer Science, Technical Report, 2000.
464. C. S. Collberg and T. A. Proebsting, Problem Classification using Program Checking, Fun with Algorithms 2, May 2001.
465. Collberg, Christian S.; Proebsting, Todd A., Problem identification using program checking. Discrete Appl. Math. 144 (2004), no. 3, 270-280.
466. Simon Colton, "Refactorable Numbers - A Machine Invention", J. Integer Sequences, Volume 2, 1999, Article 99.1.2.
467. S. Colton, Theory Formation Applied to Learning, Discovery and Problem Solving, presented at Machine Intelligence 17, Bury St. Edmunds, July 2000.
468. S. Colton, An Application-based Comparison of Automated Theory Formation and Inductive Logic Programming, Electronic Transactions on Artificial Intelligence, Vol. 4 (2000), Section B, pp. 97-117.
469. S. Colton, Automated Theory Formation Applied to Four Learning Tasks, Linkoping Electronic Articles in Computer and Information Science, Vol. 5 (2000): nr 38.
470. S. Colton, Automated Theorem Discovery: A Future Direction for Theorem Provers, Proceedings of the IJCAR workshop on Future Directions in Automated Reasoning, Siena, Italy, 2001.
471. S. Colton, Mathematics - a new domain for datamining?, Proc IJCAI-01, Seattle, 2001
472. Colton, Simon, Automated conjecture making in number theory using HR, Otter and Maple. J. Symbolic Comput. 39 (2005), no. 5, 593-615.
473. S. Colton, A. Bundy and T. Walsh, HR - A system for machine discovery in finite algebra, Proceedings of the machine discovery workshop, European Conference on Artificial Intelligence, 1998. (postscript)
474. S. Colton, A. Bundy and T. Walsh, Automated Discovery in Pure Mathematics, Proceedings of the ECAI-98 workshop on machine discovery, 1998.
475. S. Colton, A. Bundy and T. Walsh, Automatic Concept Formation in Pure Mathematics. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999. (postscript)
476. S. Colton, A. Bundy and T. Walsh, On the Notion of Interestingness in Automated Mathematical Discovery, to appear in the Special Issue of the International Journal of Human Computer Studies, 2000.
477. S. Colton, A. Bundy and T. Walsh, Automatic Invention of Integer Sequences, in Proceedings, Seventeenth National Conference on Artificial Intelligence (Austin, Texas, July 30 - June 5, 2000), AAAI Press, 2000, to appear. [Winner of prize paper award] (postscript)
478. S. Colton, A. Bundy and T. Walsh, Automatic identification of mathematical concepts, Proc ICML-2000, Stanford, CA, 2000.
479. S. Colton and L. Dennis, The NumbersWithNames Program, 7th International Symposium on Artificial Intelligence and Mathematics, 2002.
480. S. Colton and G. Steel, Artificial Intelligence and Scientific Creativity , Quarterly Journal of the Society for the Study of Artificial Intelligence and the Simulation of Behaviour, Volume 102, Summer/Autumn 1999.
481. L. Comtet, Advanced Combinatorics, Reidel, 1974.
482. Matthew M. Conroy, "A Sequence Related to a Conjecture of Schinzel", J. Integer Sequences, Volume 4, 2001, Article 01.1.7.
483. J. H. Conway, "On Happy Factorizations", J. Integer Sequences, Volume 1, 1998, Article 98.1.1.
484. J. H. Conway, E. M. Rains and N. J. A. Sloane, On the Existence of Similar Sublattices, Canad. J. Math., 51 (1999), 1300-1306.
485. J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389.
486. M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic Journal of Combinatorics, Vol. 7(1) 2000, article #R44.
487. C. Cooper and M. Wiemann, Divisibility of an F-L Type Convolution, Applications of Fibonacci Numbers, Volume 9.
488. J. Copeland and J. Haemer, Odds and Ends, SunExpert, May 1999, pp. 50-53.
489. J. Copeland and J. Haemer, High-School Algebra, Backwards, SunExpert, Feb 2001, pp. 34-37.
490. Robert Cori, Indecomposable permutations, hypermaps and labeled Dyck paths, Journal of Combinatorial Theory, Series A, In Press, Corrected Proof, Available online 21 May 2009.
491. R. M. Corless, Symbolic Computation in Nonlinear Dynamics, Proceedings of Let's Face Chaos Through Nonlinear Dynamics, Ljubljana, Slovenia, 1993.
492. Ruth Corran , Matthieu Picantin, A new Garside structure for braid groups of type (e,e,r) (2009) http://arxiv.org/abs/0901.0645
493. Sylvie Corteel and Pawe Hitczenko, "Generalizations of Carlitz Compositions", J. Integer Sequences, Volume 10, 2007, Article 07.8.8.
494. G. E. Cossali, "A Common Generating Function for Catalan Numbers and Other Integer Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.1.8.
495. D. Coupier, A. Desolneux and B. Ycart, Image Denoising by Statistical Area Thresholding, Journal of Mathematical Imaging and Vision, Volume 22, Numbers 2-3 / May, 2005.
496. M. A. Covington, The number of distinct alignments of two strings, (pdf, ps), Journal of Quantitative Linguistics, 2004, to appear.
497. D. A. Cox and J. Shurman, Geometry and number theory on clovers, Amer. Math. Monthly, 112 (2005), 682-704.
498. Michael Cuntz, Integral modular data and congruences (2006), http://arxiv.org/abs/math/0611233; Journal of Algebraic Combinatorics, Volume 29, Number 3 / May, 2009.
499. B. Curry, G. A. Wiggins and G. Hayes, Representing trees with constraints, Lloyd, J. (ed.) et al., Computational Logic- CL 2000. 1st International Conference, London, GB, July 24-28, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1861, 315-325 (2000). Also another version. Also still another version
500. Aleksandar Cvetkovic, Predrag Rajkovic and Milos Ivkovic, "Catalan Numbers, the Hankel Transform and Fibonacci Numbers", J. Integer Sequences, Volume 5, 2002, Article 02.1.3.
501. Cvetkovic, Dragos; Fowler, Patrick; Rowlinson, Peter; Stevanovic, Dragan, Constructing fullerene graphs from their eigenvalues and angles. Special issue on algebraic graph theory (Edinburgh, 2001). Linear Algebra Appl. 356 (2002), 37-56.
502. Predrag Cvitanovic, Asymptotic estimates and gauge invariance, Nuclear Physics B, Volume 127, Issue 1, 22 August 1977, Pages 176-188.
503. P. Cvitanovic', Group Theory, webbook.
504. D'Andrea, Carlos; Hare, Kevin G. On the height of the Sylvester resultant. Experiment. Math. 13 (2004), no. 3, 331-341.
505. D'Antona, Ottavio M.; Munarini, Emanuele, A combinatorial interpretation of the connection constants for persistent sequences of polynomials. European J. Combin. 26 (2005), no. 7, 1105-1118.
506. Ilda P.F. da Silva, Recursivity and geometry of the hypercube, Linear Algebra and its Applications, Volume 397, 1 March 2005, Pages 223-233.
507. M. R. T. Dale, J. W. Moon, The permuted analogues of three Catalan sets, Journal of Statistical Planning and Inference, Volume 34, Issue 1, January 1993, Pages 75-87.
508. David Damanik, Local symmetries in the period-doubling sequence, Discrete Applied Mathematics, Volume 100, Issues 1-2, 15 March 2000, Pages 115-121.
509. H. M. Damm, Prüfziffernsysteme über Quasigruppen, Diplomarbeit Univ. Marburg, 1998.
510. Damm, Michael, Check digit systems over groups and anti-symmetric mappings. Arch. Math. (Basel) 75 (2000), no. 6, 413-421.
511. Thierry Dana-Picard:, Explicit closed forms for parametric integrals, Int. J. Math. Ed. Sci. Tech. 35 (3) (2004), 456-467.
512. Thierry Dana-Picard:, Parametric integrals and Catalan numbers, Int. J. Math. Ed. Sci. Tech. 36 (4), 410-414.
513. Thierry Dana-Picard, "Sequences of Definite Integrals, Factorials and Double Factorials", J. Integer Sequences, Volume 8, 2005, Article 05.4.6.
514. Lars Eirik Danielsen, On Self-Dual Quantum Codes, Graphs and Boolean Functions (2005), http://arxiv.org/abs/quant-ph/0503236.
515. Danielsen, Lars Eirik; Gulliver, T. Aaron; Parker, Matthew G. Aperiodic propagation criteria for Boolean functions. Inform. and Comput. 204 (2006), no. 5, 741-770.
516. Lars Eirik Danielsen and Matthew G. Parker, Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform (2005), http://arxiv.org/abs/cs/0504102. In Sequences and Their Applications-SETA 2004, Lecture Notes in Computer Science, Volume 3486/2005, Springer-Verlag.
517. Danielsen, Lars Eirik; Parker, Matthew G. On the classification of all self-dual additive codes over GF(4) of length up to 12. J. Combin. Theory Ser. A 113 (2006), no. 7, 1351-1367.
518. Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes (2007), http://arxiv.org/abs/0710.2243.
519. Lars Eirik Danielsen, Matthew G. Parker, Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes (2008); http://arxiv.org/abs/0804.2576
520. Lars Eirik Danielsen and Matthew G. Parker, Directed Graph Representation of Half-Rate Additive Codes over GF(4) (2009) http://arxiv.org/abs/0902.3883
521. A. Darte, D. Chavarria-Miranda, R. Fowler and J. Mellor-Crummey, Latin hyper-rectangles for efficient parallelization of line-sweep computations, Submitted to the Annals of Operations Research, December 2001.
522. A. Darte, D. Chavarria-Miranda, R. Fowler and J. Mellor-Crummey, Generalized Multipartitioning, in Informal Proceedings of LACSI (Los Alamos Computer Science Institute) 2001 Symposium, Santa Fe, New Mexico, October 2001. [ps.gz, pdf]
523. A. Darte, D. Chavarria-Miranda, R. Fowler and J. Mellor-Crummey, "Generalized Multipartitioning for Multi-Dimensional Arrays", in Proceedings of International Parallel and Distributed Processing Symposium, Fort Lauderdale, FL, April 2002. Selected as Best Paper (gzipped Postscript, PDF)
524. Alain Darte, John Mellor-Crummey, Robert Fowler, Daniel Chavarria-Miranda, Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations, Journal of Parallel and Distributed Computing, Volume 63, Issue 9, September 2003, Pages 887-911.
525. Cecile Dartyge, Florian Luca and Pantelimon Stnic, On digit sums of multiples of an integer, Journal of Number Theory, 129 (2009), 2820-2830.
526. R. J. M. Dawson, Tilings of the sphere with isosceles triangles, Discrete Comput. Geom. 30 (2003), 467--487.
527. D. E. Daykin, D. J. Kleitman, D. B. West, The number of meets between two subsets of a lattice, Journal of Combinatorial Theory, Series A, Volume 26, Issue 2, March 1979, Pages 135-156.
528. Jean-Marie De Koninck and Nicolas Doyon, "Large and Small Gaps Between Consecutive Niven Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.2.5.
529. de Luca, Aldo; De Luca, Alessandro, Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362 (2006), no. 1-3, 282-300.
530. Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Cryptographic key assignment schemes for any access control policy, Information Processing Letters, Volume 92, Issue 4, 30 November 2004, Pages 199-205.
531. S. De Smedt, On Sloane's Sequence 1484, Saitama Math. J. 15 (1997), 9-13.
532. Stefan De Wannemacker, Thomas Laffey, Robert Osburn, On a conjecture of Wilf, Journal of Combinatorial Theory, Series A, Volume 114, Issue 7, October 2007, Pages 1332-1349.
533. Del Lungo, A.; Duchi, E.; Frosini, A.; Rinaldi, S. On the generation and enumeration of some classes of convex polyominoes. Electron. J. Combin. 11 (2004), no. 1, Research Paper 57, 45 pp.
534. A. Del Lungo, M. Mirolli, R. Pinzani, S. Rinaldi, A bijection for directed convex polyominoes, Discrete Mathematics and Theoretical Computer Science, Discrete Models: Combinatorics, Computation, Geometry, ISSN 1365-8050 (2001) 133-144.
535. Del Lungo, Alberto; Nivat, Maurice; Pinzani, Renzo; Rinaldi, Simone, A bijection for the total area of parallelogram polyominoes. Discrete Appl. Math. 144 (2004), no. 3, 291-302.
536. J.-P. Delahaye, Inventiones à suivre, Pour la Science, No. 353, March 2007.
537. J.-P. Delahaye, L'arithmetique geometrique, Pour la Science, No. 360, October 2007.
538. M. Delest, Polyominoes and animals : some recent results, J. of Math. Chem., 8 (1991), 3-18.
539. M. Delest, Enumeration of polyominoes using Macsyma, Theoretical Computer Science, Volume 79, Issue 1, 21 February 1991, Pages 209-226.
540. M. Delest, Combinatorics, information vizualisation and algebraic languages, Invited talk, EWM'99.
541. M. P. Delest, J. M. Fedou, Enumeration of skew Ferrers diagrams, Discrete Mathematics, Volume 112, Issues 1-3, 25 March 1993, Pages 65-79.
542. O. Delgado-Friedrichs and M. O'Keeffe, Edge-transitive lattice nets, Acta Cryst. A, A65 (2009), 360-363.
543. Giacomo Della Riccia, "Converting Between Generalized Bell, Lah, Stirling and Tanh Numbers", J. Integer Sequences, Volume 9, 2006, Article 06.3.5.
544. Eva Y.P. Deng, Toufik Mansour, Three Hoppy path problems and ternary paths, Discrete Applied Mathematics, Volume 156, Issue 5, 1 March 2008, Pages 770-779.
545. Eva Y.P. Deng, Wei-Jun Yan, Some identities on the Catalan, Motzkin and Schroder numbers, Discrete Applied Mathematics, Volume 156, Issue 14, 28 July 2008, Pages 2781-2789.
546. A. Denise and R. Simion, Two combinatorial statistics on Dyck paths, Discrete Math. 137 (1995), 155-176.
547. A. Denise, M. Vasconcellos and D. J. A. Welsh, The random planar graph, Congressus Numerantium 113 (1996) 61-79.
548. S. C. Dent and J. Siemons, On a conjecture of Foulkes. J. Algebra 226 (2000), no. 1, 236-249.
549. Nachum Dershowitz, Mitchell A. Harris and Guan-Shieng Huang, Enumeration Problems Related to Ground Horn Theories (2006), http://arxiv.org/abs/cs/0610054.
550. Nachum Dershowitz, Shmuel Zaks, Enumerations of ordered trees, Discrete Mathematics, Volume 31, Issue 1, 1980, Pages 9-28.
551. E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999), 167-202.
552. E. Deutsch, Enumerating symmetric directed convex polyominoes, Discrete Math., 280 (2004), 225-231.
553. E. Deutsch, Ordered trees with prescribed root degrees, node degrees and branch lengths. Discrete Math. 282 (2004), no. 1-3, 89-94.
554. E. Deutsch, S. Feretic and M. Noy, Diagonally convex directed polyominoes and even trees: a bijection and related issues, Discrete Mathematics, 256 (2002), 645-654.
555. Deutsch, Emeric; Ferrari, Luca; Rinaldi, Simone, Production matrices. Adv. in Appl. Math. 34 (2005), no. 1, 101-122.
556. E. Deutsch and H. Prodinger, A bijection between directed column-convex polyominoes and ordered trees of height at most four, GASCom 2001, Siena, pp. 18-20, Nov. 2001.
557. Deutsch, Emeric; Prodinger, Helmut, A bijection between directed column-convex polyominoes and ordered trees of height at most three. Random generation of combinatorial objects and bijective combinatorics. Theoret. Comput. Sci. 307 (2003), no. 2, 319-325.
558. E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory, 117 (2006), 191-215.
559. E. Deutsch and L. Shapiro, A survey of the Fine numbers, Discrete Math., 241 (2001), 241-265. "The connection between these two appearances would probably not have occurred without Sloane's Handbook of Integer Sequences ..."
560. E. Deutsch and L. Shapiro, A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Math., 256 (2002), 655-670.
561. Jean Dezert, Florentin Smarandache, On the Generation of Hyper-powersets for the DSmT (2003), http://arxiv.org/abs/math/0309431.
562. P. Di Francesco, O. Golinelli, E. Guitter, Meanders: a direct enumeration approach, Nuclear Physics B, Volume 482, Issue 3, 30 December 1996, Pages 497-535.
563. P. Di Francesco, O. Golinelli and E. Guitter, Meander, folding and arch statistics.; Mathematical and Computer Modelling, Volume 26, Issues 8-10, October-November 1997, Pages 97-147.
564. Di Francesco, Philippe; Zinn-Justin, Paul; Zuber, Jean-Bernard, Determinant formulae for some tiling problems and application to fully packed loops. Ann. Inst. Fourier (Grenoble) 55 (2005), no. 6, 2025-2050.
565. S. N. Diggavi, N. J. A. Sloane and V. A. Vaishampayan, Asymmetric Multiple Description Lattice Vector Quantizers, IEEE Trans. on Information Theory, vol 48, no 1, pp 174-191, January 2002.
566. Ayhan Dil, Veli Kurt and Mehmet Cenkci, "Algorithms for Bernoulli and Related Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.4.
567. Karl Dilcher, "Congruences for a Class of Alternating Lacunary Sums of Binomial Coefficients", J. Integer Sequences, Volume 10, 2007, Article 07.10.1.
568. Filippo Disanto, Luca Ferrari, Renzo Pinzani et al., Catalan numbers and relations (2009) http://arxiv.org/abs/0901.3509
569. Disanto, Filippo; Frosini, Andrea; Pinzani, Renzo; Rinaldi, Simone, A closed formula for the number of convex permutominoes. Electron. J. Combin. 14 (2007), no. 1, Research Paper 57, 17 pp.
570. Andreas Distler and Tom Kelsey, The Monoids of Order Eight and Nine, in Intelligent Computer Mathematics, Lecture Notes in Computer Science, Volume 5144/2008, Springer-Verlag.
571. Dragomir Z. Djokovic, Poincare series of some pure and mixed trace algebras of two generic matrices, arXiv math.AC/0609262, J. Algebra 309 (2007), no. 2, 654-671.
572. Dragomir Z. Djokovic and Benjamin H. Smith, Quaternionic matrices: Unitary similarity, simultaneous triangularization and some trace identities (2007), http://arxiv.org/abs/0709.0513.
573. R. Dobrow and J. A. Fill, On the Markov chain for the move-to-root rule for binary search trees , Annals of Applied Probability, 5, 1-19 (1995).
574. Jean-Paul Doignon and Anthony Labarre, "On Hultman Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.6.2.
575. Tomislav Doli, "Maximum Product Over Partitions Into Distinct Parts", J. Integer Sequences, Volume 8, 2005, Article 05.5.8.
576. Michael Domaratzki, "Combinatorial Interpretations of a Generalization of the Genocchi Numbers", J. Integer Sequences, Volume 7, 2004, Article 04.3.6.
577. Michael Domaratzki, Trajectory-based codes, Acta Informatica, Volume 40, Numbers 6-7 / May, 2004.
578. Robert Donaghey, Alternating permutations and binary increasing trees, Journal of Combinatorial Theory, Series A, Volume 18, Issue 2, March 1975, Pages 141-148.
579. Robert Donaghey, Binomial self-inverse sequences and tangent coefficients, Journal of Combinatorial Theory, Series A, Volume 21, Issue 2, September 1976, Pages 155-163.
580. Robert Donaghey, Automorphisms on Catalan trees and bracketings, Journal of Combinatorial Theory, Series B, Volume 29, Issue 1, August 1980, Pages 75-90.
581. Robert Donaghey, Restricted plane tree representations of four Motzkin-Catalan equations, Journal of Combinatorial Theory, Series B, Volume 22, Issue 2, April 1977, Pages 114-121.
582. Robert Donaghey, Louis W. Shapiro, Motzkin numbers, Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, November 1977, Pages 291-301.
583. Doust, Ian; Hirschhorn, Michael D.; Ho, Jocelyn, Trigonometric identities, linear algebra and computer algebra. Amer. Math. Monthly 112 (2005), no. 2, 155-164.
584. Brian Drake, Limits of areas under lattice paths, Discrete Mathematics, Volume 309, Issue 12, 28 June 2009, Pages 3936-3953.
585. Brian Drake, Ira M. Gessel and Guoce Xin, "Three Proofs and a Generalization of the Goulden-Litsyn-Shevelev Conjecture on a Sequence Arising in Algebraic Geometry", J. Integer Sequences, Volume 10, 2007, Article 07.3.7.
586. Dan Drake, The combinatorics of associated Hermite polynomials (2007), http://arxiv.org/abs/0709.0987; European Journal of Combinatorics, Volume 30, Issue 4, May 2009, Pages 1005-1021.
587. Dan Drake and Jang Soo Kim, k -distant crossings and nestings of matchings and partitions (2008) http://arxiv.org/abs/0812.2725
588. Gregory P. Dresden, "Three transcendental numbers from the last non-zero digits of n^n, F_n and n!", 'Mathematics Magazine', pp. 96-105, vol. 81, April 2008.
589. G. P. B. Dresden, A simplified Binet Formula for k-Generalized Fibonacci Numbers, arxiv:0905.0304 [math.NT], 2009
590. A. W. M. Dress, B. Morgenstern and J. Stoye (1998) The Number of Standard and of Effective Multiple Alignments Appl. Math. Lett. 11(4), 43-49. (Preprint)
591. B.-S. Du, Congruence identities arising from dynamical systems, Appl. Math. Letters, 12 (1999), 115-119.
592. Artras Dubickas, On a sequence related to that of ThueMorse and its applications, Discrete Mathematics, Volume 307, Issues 9-10, 6 May 2007, Pages 1082-1093.
593. Harvey Dubner, "Carmichael Numbers of the Form (6m+1)(12m+1)(18m+1)", J. Integer Sequences, Volume 5, 2002, Article 02.2.1.
594. Harvey Dubner, "Twin Prime Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.4.2.
595. Harvey Dubner and Tony Forbes, "Prime Pythagorean Triangles", J. Integer Sequences, Volume 4, 2001, Article 01.2.3.
596. Harvey Dubner and Torbjörn Granlund, "Primes of the Form (b^n+1)/(b+1)", J. Integer Sequences, Volume 3, 2000, Article 00.2.7.
597. Gerard H. E. Duchamp, Florent Hivert, Jean-Christophe Novelli et al., Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited (2008); http://arxiv.org/abs/0809.4479
598. Gerard Henry Edmond Duchamp, Jean-Gabriel Luque, Jean-Christophe Novelli et al., Hopf algebras of diagrams (2007), http://arxiv.org/abs/0710.5661.
599. Duchi, Enrica; Fedou, Jean-Marc; Rinaldi, Simone, From object grammars to ECO systems. Theoret. Comput. Sci. 314 (2004), no. 1-2, 57-95.
600. Enrica Duchi, Andrea Frosini, Renzo Pinzani and Simone Rinaldi, "A Note on Rational Succession Rules", J. Integer Sequences, Volume 6, 2003, Article 03.1.7.
601. Enrica Duchi, Simone Rinaldi, Gilles Schaeffer, The number of Z-convex polyominoes (2006), http://arxiv.org/abs/math/0602124.
602. Duchi, E.; Sulanke, R. A., The 2^{n-1} factor for multi-dimensional lattice paths with diagonal steps. Sém. Lothar. Combin. 51 (2004/05), Art. B51c, 16 pp.
603. P. Duchon, Q-grammaires: un outil pour l'énumération, PHD thesis, Université Bordeaux 1 (1998).
604. Philippe Duchon, On the link pattern distribution of quarter-turn symmetric FPL configurations (2007), http://arxiv.org/abs/0711.2871.
605. P. Duchon, P. Flajolet, G. Louchard and G. Schaeffer, Random Sampling from Boltzmann Principles, Proc. ICALP'2002, Lecture Notes in Computer Science, July 2002.
606. P. Duchon, P. Flajolet, G. Louchard and G. Schaeffer, Boltzmann Samplers for the Random Generation of Combinatorial Structures, Combin. Probab. Comput. 13 (2004), no. 4-5, 577-625.
607. S. Dugowson, Representation of finite connective spaces (2007), http://arxiv.org/abs/0707.2542.
608. W. Duke, Stephen J. Greenfield and Eugene R. Speer, "Properties of a Quadratic Fibonacci Recurrence", J. Integer Sequences, Volume 1, 1998, Article 98.1.8.
609. W. M. B. Dukes, On a Unimodality Conjecture in Matroid Theory, Discrete Math. Theor. Comput. Sci., Volume 5 n° 1 (2002), pp. 181-190.
610. P. Dumas, Algebraic aspects of B-regular series. In Lingas A., Karlsson R. and Carlsson S. (editors), Automata, Languages and Programming. EATCS, Lecture Notes in Computer Science, pages 457-468. - Springer Verlag, 1993. Proceedings of the 20th International Colloquium ICALP 93, Lund, Sweden. ( Another version; Citeseer.)
611. E. Duran, S. L. Jordan, J. E. Lewis, C. E. Tiedemann, Using Mathematics on the Web and Other Computer Technology to Facilitate Learning, ITL Conference 2002.
612. Bergfinnur Durhuus and Soren Eilers, Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length (2009) http://arxiv.org/abs/0902.2274
613. M. Dziemianczuk, Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients (2009) http://arxiv.org/abs/0901.1337
614. J. Earls, A note on the Smarandache divisors of divisors sequence and two similar sequences, Smarand. Notions J. 14 (1) (2004) 274--275.
615. E. Early, Chain Lengths in the Dominance Lattice, 2002. Presented at FPSAC '03.
616. Kurusch Ebrahimi-Fard and Dominique Manchon, Dendriform Equations (2008); http://arxiv.org/abs/0805.0762
617. Edel, Yves; Elsholtz, Christian; Geroldinger, Alfred; Kubertin, Silke; Rackham, Laurence, Zero-sum problems in finite abelian groups and affine caps. Q. J. Math. 58 (2007), no. 2, 159-186.
618. K. Edwards, A Pascal-like triangle related to the tribonacci numbers, Fib. Q., 46/47 (2008/2009), 18-25.
619. A. L. Efros and E. V. Tsiper, An unusual metallic phase in a chain of strongly interacting particles, J. Phys.: Cond. Matt. (Letter) 9, L561-L567 (1997).
620. Eric S. Egge, Restricted colored permutations and Chebyshev polynomials, Discrete Mathematics, Volume 307, Issue 14, 28 June 2007, Pages 1792-1800.
621. Egorychev, Georgy P.; Zima, Eugene V. Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type. Acta Appl. Math. 85 (2005), no. 1-3, 93-109.
622. Georgy P. Egorychev, Eugene V. Zima, Integral Representation and Algorithms for Closed Form Summation, Handbook of Algebra, Volume 5, 2008, Pages 459-529.
623. Tohru Eguchi, Kazuhiro Hikami, Superconformal Algebras and Mock Theta Functions (2008) http://arxiv.org/abs/0812.1151
624. Remi Eismann, Decompostion of natural numbers into weight * level + jump and application to a new classification of prime numbers (2007), http://arxiv.org/abs/0711.0865.
625. S. B. Ekhad and D. Zeilberger, Proof of Conway's Lost Cosmological Theorem, Electronic Research Announcements of the Amer. Math. Soc. 3 (1997) 78-82.
626. Shalosh B. Ekhad and Doron Zeilberger, "There are More Than 2n/17 n-Letter Ternary Square-Free Words", J. Integer Sequences, Volume 1, 1998, Article 98.1.9.
627. Sergi Elizalde, Generating trees for permutations avoiding generalized patterns (2007), http://arxiv.org/abs/0707.4633; Annals of Combinatorics, Volume 11, Numbers 3-4 / December, 2007.
628. Sergi Elizalde and Toufik Mansour, Restricted Motzkin permutations, Motzkin paths, continued fractions and Chebyshev polynomials (2006), http://arxiv.org/abs/math/0610237.
629. Seymour B. Elk, Enumeration of the set of saturated compounds that, in theory, could be formed by the linear fusion of regular pentagonal modules, including the logical extrapolation to helicanes, Journal of Molecular Structure: THEOCHEM, Volume 201, November 1989, Pages 75-86.
630. Elkies, Noam D. New directions in enumerative chess problems. Electron. J. Combin. 11 (2004/06), no. 2, Article 4, 14 pp.
631. N. D. Elkies and R. P. Stanley, The mathematical knight, Math. Intelligencer, 25 (No. 1, 2003), 22-34. (PostScript, Pdf)
632. G. Ellis and F. Lehmann, Exploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval, ICCS 1994, 293-310.
633. Nathaniel D. Emerson, "A Family of Meta-Fibonacci Sequences Defined by Variable-Order Recursions", J. Integer Sequences, Volume 9, 2006, Article 06.1.8.
634. N. Eriksen, Expected number of inversions after a sequence of random adjacent transpositions - an exact expression , Discr. Math., 298 (2005), 155-168.
635. T. Etzion, On the stopping redundancy of Reed-Muller codes, arXiv:cs.IT/0511056, IEEE Trans. Inform. Theory 52 (2006), no. 11, 4867-4879.
636. Eu, Sen-Peng; Fu, Tung-Shan, A simple proof of the Aztec diamond theorem. Electron. J. Combin. 12 (2005), Research Paper 18, 8 pp.
637. Sen-Peng Eu, Tung-Shan Fu, Lattice paths and generalized cluster complexes, Journal of Combinatorial Theory, Series A, Volume 115, Issue 7, October 2008, Pages 1183-1210.
638. Eu, Sen-Peng; Liu, Shu-Chung; Yeh, Yeong-Nan, Dyck paths with peaks avoiding or restricted to a given set. Stud. Appl. Math. 111 (2003), no. 4, 453-465.
639. Eu, Sen-Peng; Liu, Shu-Chung; Yeh, Yeong-Nan, Odd or even on plane trees. Discrete Math. 281 (2004), no. 1-3, 189-196.
640. Eu, Sen-Peng; Liu, Shu-Chung; Yeh, Yeong-Nan, On the congruences of some combinatorial numbers. Stud. Appl. Math. 116 (2006), no. 2, 135-144.
641. Reinhardt Euler, "The Fibonacci Number of a Grid Graph and a New Class of Integer Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.2.6.
642. G. Everest, Zsigmondy's Theorem for Elliptic Curves, 2002.
643. G. Everest, A. J. van der Poorten, Y. Puri and T. Ward, "Integer Sequences and Periodic Points", J. Integer Sequences, Volume 5, 2002, Article 02.2.3.
644. G. Everest, A. van der Poorten, I. Shparlinski and T. Ward , Recurrence Sequences, Amer. Math. Soc., 2003.
645. C. J. Everett, P. R. Stein, The combinatorics of random walk with absorbing barriers, Discrete Mathematics, Volume 17, Issue 1, 1977, Pages 27-45.
646. V. Fack, S. Lievens and J. Van der Jeugt, On rotation distance between binary coupling trees and applications for 3nj-coefficients, Comput. Phys. Commun., 119 (1999) 99-114.
647. V. Fack, S. Lievens and J. Van der Jeugt, On the diameter of the rotation graph of binary coupling trees. Discrete Mathematics 245 (2002) 1-18.
648. Sergio Falcon, Angel Plaza, On k-Fibonacci numbers of arithmetic indexes, Applied Mathematics and Computation, Volume 208, Issue 1, 1 February 2009, Pages 180-185.
649. Sergio Falcon, Angel Plaza, On k-Fibonacci sequences and polynomials and their derivatives, Chaos, Solitons & Fractals, Volume 39, Issue 3, 15 February 2009, Pages 1005-1019.
650. Sergio Falcon, Angel Plaza, The metallic ratios as limits of complex valued transformations, Chaos, Solitons & Fractals, Volume 41, Issue 1, 15 July 2009, Pages 1-13.
651. Sergio Falcon, Angel Plaza, k-Fibonacci sequences modulo m, Chaos, Solitons & Fractals, Volume 41, Issue 1, 15 July 2009, Pages 497-504.
652. M. Farrokhi D. G., "Some Remarks On the Equation Fn = kFm In Fibonacci Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.5.7.
653. J. M. Fedou, Enumeration of skew Ferrers diagrams and basic Bessel functions, Journal of Statistical Planning and Inference, Volume 34, Issue 1, January 1993, Pages 107-123.
654. Greg Fee, Simon Plouffe, An efficient algorithm for the computation of Bernoulli numbers (2007), http://arxiv.org/abs/math/0702300.
655. Ad Feelders, Linda C. van der Gaag, Learning Bayesian network parameters under order constraints, International Journal of Approximate Reasoning, Volume 42, Issues 1-2, May 2006, Pages 37-53.
656. Andrew Feist, Fun with the (n) function.
657. Leonid G. Fel, On Summatory Totient Functions (2008); http://arxiv.org/abs/0802.0619
658. D. P. Feldman and J. P. Crutchfield, Synchronizing to Periodicity: The Transient Information and Synchronization Time of Periodic Sequences, Submitted to Physical Review E. Santa Fe Institute Working Paper 02-08-043. arXiv/nlin.AO/0208040. 2002.
659. Stefan Felsner, \'Eric Fusy, Marc Noy et al., Bijections for Baxter Families and Related Objects (2008); http://arxiv.org/abs/0803.1546
660. Felsner, Stefan; Trotter, William T., Posets and planar graphs. J. Graph Theory 49 (2005), no. 4, 273-284.
661. Jo Fenstad, Deciphering the hidden Pascal code of Guggenheim's quasichemical model. Overcoming computational limitations by use of Pascal's triangle, Journal of Mathematical Chemistry, Volume 42, Number 4 / November, 2007.
662. Emmanuel Ferrand, "Deformations of the Taylor Formula", J. Integer Sequences, Volume 10, 2007, Article 07.1.7.
663. Luca Ferrari, Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations (2008); http://arxiv.org/abs/0806.0973
664. Ferrari, L.; Grazzini, E.; Pergola, E.; Rinaldi, S. Some bijective results about the area of Schroeder paths. Random generation of combinatorial objects and bijective combinatorics. Theoret. Comput. Sci. 307 (2003), no. 2, 327-335.
665. L. Ferrari, E. Pergola, R. Pinzani, S. Rinaldi et al. An algebraic characterization of the set of succession rules, Selected papers in honour of Maurice Nivat. Theoret. Comput. Sci. 281 (2002), no. 1-2, 351-367.
666. L. Ferrari, E. Pergola, R. Pinzani and S. Rinaldi, Jumping succession rules and their generating functions, Discrete Math., 271 (2003), 29-50.
667. S. R. Finch, Mathematical Constants, Cambridge University Press (to appear), 2003. (Sample Essays and Supplementary Materials)
668. S. R. Finch, Idempotents and Nilpotents Modulo n (arXiv: math.NT/0605019)
669. Steven Finch, Powers of Euler's q-Series, (arXiv: math.NT/0701251).
670. Steven Finch and Pascal Sebah, Squares and Cubes Modulo n, (arXiv: math.NT/0604465).
671. S. Finch, P. Sebah and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle (arXiv:0802.2654)
672. H. Finner and K. Strassburger, (2001). Increasing sample sizes do not always increase the power of UMPU-tests for 2x2-tables. Metrika, 54, 77-91.
673. P. M. Fishbane and P. Kaus, Neutrino Oscillations in Matter of Varying Density, J. Phys. G: Nucl. Part. Phys., 2001, v.27, N.12, p. 2405-14.
674. Fishburn, Peter C.; Reeds, James A. Counting split semiorders. Order 18 (2001), no. 2, 119-128.
675. Peter C. Fishburn, Fred S. Roberts, Elementary sequences, sub-Fibonacci sequences, Discrete Applied Mathematics, Volume 44, Issues 1-3, 19 July 1993, Pages 261-281.
676. P. Flajolet, A Problem in Statistical Classification Theory, Studies in Automatic Combinatorics, Volume I (1996).
677. P. Flajolet, Enumerating alcohols and other classes of chemical moleculs, an example of Polya's theory , Studies in Automatic Combinatorics, Volume I (1996).
678. P. Flajolet, Balls and Urns, Etc., Studies in Automatic Combinatorics, Volume I (1996).
679. Philippe Flajolet, Eric Fusy, Xavier Gourdon, Daniel Panario and Nicolas Pouyanne, A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics, Electron. J. Combin. 13 (2006), no. 1, Research Paper 103, 35 pp.
680. Flajolet, Philippe; Gerhold, Stefan; Salvy, Bruno, On the non-holonomic character of logarithms, powers and the nth prime function. Electron. J. Combin. 11 (2004/06), no. 2, Article 2, 16 pp.
681. P. Flajolet, K. Hatzis, S. Nikoletseas and P. Spirakis, On the Robustness of Interconnections in Random Graphs: A Symbolic Approach, Algorithms (Prague, 1999). Theoret. Comput. Sci. 287 (2002), no. 2, 515-534.
682. P. Flajolet and M. Noy, Analytic Combinatorics of Noncrossing Configurations, Discrete Math. 204 (1999), 203-229 (Selected papers in honor of Henry W. Gould). The version available here is a preliminary version: INRIA RR3196, June 1997, 22 pages [ ps]. (Only the printed version mentions the On-Line Encyclopedia of Integer Sequences.)
683. P. Flajolet, P. Poblete and A. Viola, On the Analysis of Linear Probing Hashing, (INRIA, RR3265), September 1997. 22 pages. In Algorithmica 22, (December 1998), pp. 490-515. (Special Issue on Analysis of Algorithms.)
684. Philippe Flajolet, Helmut Prodinger, Level number sequences for trees, Discrete Mathematics, Volume 65, Issue 2, June 1987, Pages 149-156.
685. P. Flajolet and B. Salvy, Computer algebra libraries for combinatorial structures. Journal of Symbolic Computation, vol. 20, no. 5-6, 1995, pages 653-671.
686. P. Flajolet, B. Salvy and P. Zimmermann, Automatic average-case analysis of algorithms. Theoretical Computer Science, Series A, vol. 79, no. 1, February 1991, pages 37-109.
687. P. Flajolet and R. Sedgewick, Analytic Combinatorics--Symbolic Combinatorics, 186p.+viii, May 2002.
688. Anthony Flatters, Primitive Divisors of some Lehmer-Pierce Sequences (2007), http://arxiv.org/abs/0708.2190; Journal of Number Theory, Volume 129, Issue 1, January 2009, Pages 209-219.
689. Anthony Flatters, Power Values of Certain Quadratic Polynomials (2009) http://arxiv.org/abs/0901.3461
690. A. Flaxman, A. W. Harrow and G. B. Sorkin, Strings with maximally many distinct subsequences and substrings (Citeseer), Electron. J. Combin. 11 (2004), no. 1, Research Paper 8, 10 pp.
691. Pierre Flener, Justin Pearson, Solving necklace constraint problems, Journal of Algorithms, Volume 64, Issues 2-3, April-July 2009, Pages 61-73.
692. Peter Floodstrand Blanchard, Pseudo-arithmetic sets and Ramsey theory, Journal of Combinatorial Theory, Series A, Volume 106, Issue 1, April 2004, Pages 49-57.
693. Dominique Foata and Guo-Niu Han, Dimers and new q-tangent numbers, Preprint, Oct. 2008.
694. Dominique Foata and Guo-Niu Han, The dimer polynomial triangle, Preprint, Oct. 2008.
695. D. Foata, G.-N. Han and B. Lass, Les nombres hyperharmoniques et la fratrie du collectionneur de vignettes, Sémin. Lothar. Comb. 47, B47a, 20 p., electronic only (2001).
696. Foata, D. and Krattenthaler, C., Graphical Major Indices, II, Seminaire Lotharingien de Combinatoire, B34k, 16 pp., 1995.
697. D. Foata and D. Zeilberger, The graphical major index, J. Comput. Applied Math (special issue on q-series) 68 (1996) 79-101.
698. D. Foata and D. Zeilberger, A classic proof of a recurrence for a very classical sequence, J. Combin. Theory Ser. A 80 (1997), no. 2, 380-384. (Note: the on-line version of this paper does not mention the Encyclopedia)
699. Foissy, L., Finite-dimensional comodules over the Hopf algebra of rooted trees. J. Algebra 255 (2002), no. 1, 89-120.
700. Fomin, Sergey; Reading, Nathan, Generalized cluster complexes and Coxeter combinatorics. Int. Math. Res. Not. 2005, no. 44, 2709-2757.
701. Stefan Forcey, Convex Hull Realizations of the Multiplihedra (2007), http://arxiv.org/abs/0706.3226; Topology and its Applications, Volume 156, Issue 2, 1 December 2008, Pages 326-347.
702. A. S. Fraenkel, Heap games, numeration systems and sequences
703. A. S. Fraenkel, Arrays, numeration systems and Frankenstein games, FUN with algorithms (Elba, 1998). Theoret. Comput. Sci. 282 (2002), no. 2, 271-284.
704. A. S. Fraenkel, Mathematical Chats Between Two Physicists, in Puzzlers' Tribute: A Feast for the Mind, honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.), A. K. Peters, 2002, pp. 315-325.
705. A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.
706. F. Franek, S. Gao, W. Lu, P. J. Ryan, W. F. Smyth, Yu Sun and L. Yang, Verifying a border array in linear time, J. Combinatorial Math. and Combinatorial Computing 42 (2002) to appear.
707. Ghislain R. Franssens, "On a Number Pyramid Related to the Binomial, Deleham, Eulerian, MacMahon and Stirling number triangles", J. Integer Sequences, Volume 9, 2006, Article 06.4.1.
708. J. Freeman, MetaMix: Between Unity and Collaboration.
709. W. Freeman, A method for the compact and efficient encoding of ordinal primes, YCS technical report, 2003.
710. Darrin D. Frey and James A. Sellers, "Jacobsthal Numbers and Alternating Sign Matrices", J. Integer Sequences, Volume 3, 2000, Article 00.2.3.
711. Darrin D. Frey and James A. Sellers, "On Powers of 2 Dividing the Values of Certain Plane Partition Functions", J. Integer Sequences, Volume 4, 2001, Article 01.1.8.
712. Peter J. Freyd, Core algebra revisited, Theoretical Computer Science, 375 (2007), Issues 1-3, 193-200.
713. Erich Friedman and Mike Keith, "Magic Carpets", J. Integer Sequences, Volume 3, 2000, Article 00.2.5.
714. A. Frosini and S. Rinaldi, "On the Sequence A079500 and Its Combinatorial Interpretations", J. Integer Sequences, Volume 9, 2006, Article 06.3.1.
715. Fusy, Éric, Counting d-polytopes with d+3 vertices. Electron. J. Combin. 13 (2006), no. 1, Research Paper 23, 25 pp.
716. Bernd Gaertner, Walter D. Jr. Morris and Leo Ruest, Unique Sink Orientations of Grids, Algorithmica, Volume 51, Number 2 / June, 2008.
717. Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh, Structure and enumeration of two-connected graphs with prescribed three-connected components, Advances in Applied Mathematics, Volume 43, Issue 1, July 2009, Pages 46-74.
718. Jozsef Garai, Analytical Solution Describing the Periodicity of the Elements in the Periodic System (2007), http://arxiv.org/abs/physics/0703231.
719. Mariano Garcia, "A Million New Amicable Pairs", J. Integer Sequences, Volume 4, 2001, Article 01.2.6.
720. M. R. Garey, On enumerating tournaments that admit exactly one Hamiltonian circuit, J. Combin. Theory, B 13 (1972), 266-269. [R. J. Douglas had enumerated such tournaments. In collecting sequences for the 1973 book I noticed that these numbers were a bisection of the Fibonacci numbers and Mike Garey found a proof of this.]
721. Skip Garibaldi, "Somewhat more than governors need to know about trigonometry", Mathematics Magazine, vol. 81, No. 3, (2008) pp. 191-200.
722. David Garth and Adam Gouge, "Affinely Self-Generating Sets and Morphisms", J. Integer Sequences, Volume 10, 2007, Article 07.1.5.
723. David Garth, Donald Mills and Patrick Mitchell, "Polynomials Generated by the Fibonacci Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.6.8.
724. Daniel L. Geisler, Combinatorics of Iterated Functions
725. Ferenc Gerlits, The Euler characteristic of graph complexes via Feynman diagrams (2004), http://arxiv.org/abs/math/0412094.
726. I. M. Gessel, Applications of The Classical Umbral Calculus, Dedicated to the memory of Gian-Carlo Rota, (dvi file, pdf file), Algebra Universalis 49 (2003), no. 4, 397-434.
727. Ira M. Gessel and Guoce Xin, "A Combinatorial Interpretation of the Numbers 6(2n)!/n!(n+2)!", J. Integer Sequences, Volume 8, 2005, Article 05.2.3.
728. S. Getu, L. Shapiro, W. -J. Woan, Product-weighted lead codes revisited, Journal of Combinatorial Theory, Series A, Volume 33, Issue 1, July 1982, Pages 112-116.
729. Daniele A. Gewurz and Francesca Merola, "Sequences Realized as Parker Vectors of Oligomorphic Permutation Groups", J. Integer Sequences, Volume 6, 2003, Article 03.1.6.
730. Gewurz, Daniele A.; Merola, Francesca, Cycle action on treelike structures. J. Algebraic Combin. 22 (2005), no. 1, 105-114.
731. Alessandro Ghigi and J\'anos Koll\'ar, Kaehler-Einstein metrics on orbifolds and Einstein metrics on spheres (2005), http://arxiv.org/abs/math/0507289.
732. Alexandru Gica and Laurentiu Panaitopol, "On Obláth's Problem", J. Integer Sequences, Volume 6, 2003, Article 03.3.5.
733. Jan de Gier and Bernard Nienhuis, Brauer loops and the commuting variety (2004), http://arxiv.org/abs/math/0410392.
734. Dion Gijswijt and Pieter Moree, On a set-theoretic invariant (2003), http://arxiv.org/abs/math/0309318.
735. Juan B. Gil, Michael D. Weiner and Catalin Zara, "Complete Padovan sequences in finite fields", The Fibonacci Quarterly, vol. 45 (Feb 2007 issue), pp. 64 - 75.
736. J. D. Gilbey, Permutation Group Algebras.
737. J. D. Gilbey, Permutation Group Algebras and Parking Functions, PHD thesis, 2002.
738. Gimbel, John; Zhang, Ping, Degree-continuous graphs. Czechoslovak Math. J. 51(126) (2001), no. 1, 163-171.
739. James Gleick, Faster, Vintage Books, NY, 2000 (see p. 309).
740. David G. Glynn, Rings of geometries II, Journal of Combinatorial Theory, Series A, Volume 49, Issue 1, September 1988, Pages 26-66.
741. Goddard, Wayne; Kanakadandi, Kiran, Orientation distance graphs revisited. Discuss. Math. Graph Theory 27 (2007), no. 1, 125-136.
742. M. Göbel, On the number of special permutation-invariant orbits and terms, in Applicable Algebra in Engin., Comm. and Comp. (AAECC 8), Lect. Notes in Comp. Sci., to appear 1997.
743. M. Göbel, Rewriting techniques and degree bounds for higher order symmetric polynomials, Appl. Algebra Engrg. Comm. Comput. 9 (1999), no. 6, 559-573.
744. M. Göbel and H. Kredel, Reduction of permutation-invariant polynomials: A noncommutative case study, Inform. and Comput. 175 (2002), 158-170.
745. W. M. Y. Goh and P. Hitczenko, Average number of distinct part sizes in a random Carlitz composition, European J. Combin. 23 (2002), no. 6, 647-657.
746. O. Golinelli, Asymptotic behavior of two-terminal series-parallel networks, Submitted to J. Phys. A.
747. I. J. Good, T. N. Tideman, Stirling numbers and a geometric ,structure from voting theory, Journal of Combinatorial Theory, Series A, Volume 23, Issue 1, July 1977, Pages 34-45.
748. I. P. Goulden, S. Litsyn and V. Shevelev, "On a Sequence Arising in Algebraic Geometry", J. Integer Sequences, Volume 8, 2005, Article 05.4.7.
749. Alain Goupil and Cedric Chauve, Combinatorial operators for Kronecker powers of representations of S_n (2005), http://arxiv.org/abs/math/0503307; Sém. Lothar. Combin. 54 (2005/06), Art. B54j, 13 pp.
750. X. Gourdon and B. Salvy, Effective asymptotics of linear recurrences with rational coefficients. Discrete Mathematics, vol. 153, no. 1-3, 1996, pages 145-163.
751. Gouyou-Beauchamps, Dominique; Leroux, Pierre, Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice. Theoret. Comput. Sci. 346 (2005), no. 2-3, 307-334.
752. D. Gouyou-Beauchamps, G. Viennot, Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem, Advances in Applied Mathematics, Volume 9, Issue 3, September 1988, Pages 334-357.
753. Grabner, Peter J.; Knopfmacher, Arnold, Analysis of some new partition statistics. Ramanujan J. 12 (2006), no. 3, 439-454.
754. Gracia-Saz, Alfonso, The symbol of a function of a pseudo-differential operator. Ann. Inst. Fourier (Grenoble) 55 (2005), no. 7, 2257-2284.
755. R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994.
756. R. L. Graham, J. C. Lagarias, C. L. Mallows, A. R. Wilks and C. H. Yan, Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions
757. R. L. Graham, J. C. Lagarias, C. L. Mallows, A. R. Wilks and C. H. Yan, Apollonian Circle Packings: Number Theory
758. R. L. Graham and D. H. Lehmer, On the permanent of Schur's matrix. J. Austral. Math. Soc. Ser. A 21 (1976), no. 4, 487-497.
759. Ron Graham, Nan Zang, Enumerating split-pair arrangements, Journal of Combinatorial Theory, Series A, Volume 115, Issue 2, February 2008, Pages 293-303.
760. W. S. Gray and Y. Li, Generating Series for Interconnected Analytic Nonlinear Systems, SIAM J. Control Optim. 44 (2005), no. 2, 646-672 .
761. Elisabetta Grazzini , Elisa Pergola , Maddalena Poneti, On the exhaustive generation of convex permutominoes (2008); http://arxiv.org/abs/0810.2883
762. R. M. Green, Homology representations arising from the half cube (2008); http://arxiv.org/abs/0806.1503; Advances in Mathematics, Volume 222, Issue 1, 10 September 2009, Pages 216-239.
763. Lawrence E. Greenfield and Stephen J. Greenfield, "Some Problems of Combinatorial Number Theory Related to Bertrand's Postulate", J. Integer Sequences, Volume 1, 1998, Article 98.1.2.
764. John Grefenstette, Sohyoung Kim, Stuart Kauffman, An analysis of the class of gene regulatory functions implied by a biochemical model, Biosystems, Volume 84, Issue 2, May 2006, Pages 81-90.
765. R. Grimaldi and S. Heubach, Binary Strings without Odd Runs of Zeros, to appear in Ars Combinatoria.
766. Uwe Grimm, "Improved Bounds on the Number of Ternary Square-Free Words", J. Integer Sequences, Volume 4, 2001, Article 01.2.7.
767. R. E. Griswold, Drafting with Sequences, Documents on Weaving, Textiles and Related Topics Created for On-Line Publication, July 1999.
768. R. E. Griswold, Patterns from Term-Replication Sequences, Documents on Weaving, Textiles and Related Topics Created for On-Line Publication, March 2002.
769. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), Recurrence Relations, The Icon Analyst 59, April 2000.
770. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), Variations on Versum Sequences, The Icon Analyst 57, December 1999.
771. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), The Encyclopedia of Integer Sequences, The Icon Analyst, No. 56, October 1999, see p, 8.
772. Karlheinz Groechenig, Benedikt M. Poetscher, Holger Rauhut, Learning Trigonometric Polynomials from Random Samples and Exponential Inequalities for Eigenvalues of Random Matrices (2007), http://arxiv.org/abs/math/0701781.
773. C. W. Groetsch and K. R. Meyer, Book Reviews, SIAM Review 38 (2) (1996) 333-337
774. C. Gross, Beginning C# 2008, Springer-Verlag.
775. R. W. Grosse-Kunstleve, Zeolites, Frameworks, Coordination Sequences and Encyclopedia of Integer Sequences
776. R. W. Grosse-Kunstleve, G. O. Brunner and N. J. A. Sloane, Algebraic Description of Coordination Sequences and Exact Topological Densities for Zeolites, Acta Cryst., A52 (1996), pp. 879-889.
777. K. Grudzinski and B. G. Wybourne, Symplectic models of n-particle systems, Rept. Math. Phys. 38, 251-266 (1996).
778. H. G. Grundman and E. A. Teeple, "Sequences of Generalized Happy Numbers with Small Bases", J. Integer Sequences, Volume 10, 2007, Article 07.1.8.
779. J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.
780. Jarosaw Grytczuk, Nonrepetitive Graph Coloring, in Graph Theory in Paris, Springer-Verlag.
781. N. S. S. Gu, N. Y. Li and T. Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221.
782. Nancy S.S. Gu, Helmut Prodinger, Bijections for 2-plane trees and ternary trees, European Journal of Combinatorics, Volume 30, Issue 4, May 2009, Pages 969-985.
783. Mathieu Guay-Paquet, Jeffrey Shallit, Avoiding Squares and Overlaps Over the Natural Numbers (2009) http://arxiv.org/abs/0901.1397
784. O. Guibert, Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, PHD thesis, Université Bordeaux 1 (1995).
785. O. Guibert and T. Mansour, Restricted 132-involutions, Séminaire Lothaningien de Combinatorica 48 (2002), Article B48a.
786. Olivier Guibert and Sylvain Pelat-Alloin, Extending Fine sequences: a link with forbidden patterns (2005), http://arxiv.org/abs/math/0507408.
787. Guibert, O.; Pergola, E. Enumeration of vexillary involutions which are equal to their mirror/complement. Discrete Math. 224 (2000), no. 1-3, 281-287.
788. Guillera, J., A class of conjectured series representations for 1/pi. Experiment. Math. 15 (2006), no. 4, 409-414.
789. T. A. Gulliver, Sequences from squares of integers, Int. Math. J. 1 (2002), no. 4, 323-332.
790. T. A. Gulliver, Sequences from cubes of integers, Int. Math. J. 4 (2003), 439-445.
791. Robert M. Guralnick and Martin Lorenz, Orders of Finite Groups of Matrices (2005), http://arxiv.org/abs/math/0511191.
792. R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
793. R. K. Guy, Reviews, Am. Math. Monthly 104 (2) (1997) 180-184.
794. Richard K. Guy, "Catwalks, Sandsteps and Pascal Pyramids", J. Integer Sequences, Volume 3, 2000, Article 00.1.6.
795. Guy R. K., Problems sessions 92-05-29 and 92-05-31, Computers & Mathematics with Applications, Volume 39, Issue 11, June 2000, Pages 169-171.
796. R. K. Guy, C. Krattenthaler and B. E. Sagan, Lattice paths, reflections and dimension-changing bijections, Ars Combin. 34 (1992), 3-15.
797. R. K. Guy and W. O. J. Moser, Numbers of subsequences without isolated odd members. Fibonacci Quarterly, 34, No.2, 152-155 (1996).
798. M. Gysin and J. Seberry, On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function, AJC 23 (2001) 197-209.
799. J. Haack, "The Mathematics of Steve Reich's Clapping Music," in Bridges: Mathematical Connections in Art, Music and Science: Conference Proceedings, 1998, Reza Sarhangi (ed.), 87-92.
800. Haase, Christian; Melnikov, Ilarion V. The reflexive dimension of a lattice polytope. Ann. Comb. 10 (2006), no. 2, 211-217.
801. Jan Hagberg, Centrality Testing and the Distribution of the Degree Variance in Bernoulli Graphs, International Sunbelt Social Network Conference, April 2001.
802. Claude W. Haigh, John W. Kennedy, Louis V. Quintas, Counting and coding identity trees with fixed diameter and bounded degree, Discrete Applied Mathematics, Volume 7, Issue 2, February 1984, Pages 141-160.
803. Halbeisen, Lorenz, Fans and bundles in the graph of pairwise sums and products. Electron. J. Combin. 11 (2004), no. 1, Research Paper 6, 11 pp.
804. L. Halbeisen and N. Hungerbuehler, Number theoretic aspects of a combinatorial function, Notes on Number Theory and Discrete Mathematics 5 (1999) 138-150. (ps, pdf)
805. L. Halbeisen and N. Hungerbuehler, Dual form of combinatorial problems and Laplace techniques, The Fibonacci Quarterly 38 (2000) 395-407. (ps, pdf)
806. Lorenz Halbeisen and Saharon Shelah, Consequences of arithmetic for set theory, The Journal of Symbolic Logic, vol. 59 (1994), pp. 30-40. (ps, pdf )
807. R. W. Hall and P. Klingsberg, Asymmetric rhythms and tiling canons, Amer. Math. Monthly, 113 (2006), 887-896.
808. Guo-Niu Han, An explicit expansion formula for the powers of the Euler Product in terms of partition hook lengths (2008); http://arxiv.org/abs/0804.1849
809. Guo-Niu Han, Discovering hook length formulas by expansion technique (2008); http://arxiv.org/abs/0805.2464
810. Guo-Niu Han, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications (2008); http://arxiv.org/abs/0805.1398
811. Julia Handl and Joshua Knowles, An Investigation of Representations and Operators for Evolutionary Data Clustering with a Variable Number of Clusters, in Parallel Problem Solving from Nature-PPSN IX, Lecture Notes in Computer Science, Volume 4193/2006, Springer-Verlag.
812. P. Hansen, How Far Should, Is And Could Be Conjecture-Making Automated in Graph Theory?, Les Cahiers du GERAD, August 2002. (ps, pdf)
813. P. Hansen, M. Aouchiche, G. Caporossi and D. Stevanovic, What Forms Do Interesting Conjectures Have in Graph Theory?, Les Cahiers du GERAD, August 2002. (ps, pdf)
814. C. R. H. Hanusa, A Generalized Binet's Formula for kth Order Linear Recurrences. A Markov Chain Approach, Math Senior Thesis, April 2001.
815. Hanusa, Christopher R. H., A Gessel-Viennot-type method for cycle systems in a directed graph. Electron. J. Combin. 13 (2006), no. 1, Research Paper 37, 28 pp.
816. B. Hao, Fractals from genomes: exact solutions of a biology-inspired problem, Physica A282 (2000) 225-246.
817. B. Hao, H. Xie, Z. Yu and G. Chen, Avoided strings in bacterial complete genomes and a related combinatorial problem, Ann. Comb. 4, No. 3-4, 247-255 (2000).
818. B. Hao, H. Xie, Z. Yu and G. Chen, Factorisable language: From dynamics to complete genomes, Physica A288 (2000) 10-20.
819. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.
820. Frank Harary, Edgar M. Palmer, Ronald C. Read, On the cell-growth problem for arbitrary polygons, Discrete Mathematics, Volume 11, Issue 3, 1975, Pages 371-389.
821. F. Harary, E. M. Palmer and R. W. Robinson, Counting free binary trees admitting a given height, J. Combin. Inform. System Sci. 17 (1992), 175-181. (ps, pdf)
822. M. Harborth, Strukturuntersuchungen für Shop-Scheduling-Probleme: Anzahlprobleme, potentielle Optimalität und neue Enumerationsalgorithmen, PhD Thesis, Otto-von-Guericke-Universität Magdeburg, 1999.
823. K. Hare, Multisectioning, Rational Poly-Exponential Functions and Parallel Computation, M.Sc. Thesis, February 2001. (PostScript , Pdf)
824. Kevin G. Hare and Soroosh Yazdani, "Further Results on Derived Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.2.7.
825. T. Harju and D. Nowotka, Counting bordered and primitive words with a fixed weight, Theoret. Comput. Sci. 340 (2005), no. 2, 273-279.
826. P. de la Harpe, Topics in geometric group theory - mise a jour, preprints de la Section de mathematiques de l'Universite de Geneve, 2001. (PostScript, Pdf)
827. M. Harris and N. Dershowitz, Ordered Construction Of Combinatorial Objects, preprint.
828. William F. Harris, Ralph O. Erickson, Tubular arrays of spheres: Geometry, continuous and discontinuous contraction, and the role of moving dislocations, Journal of Theoretical Biology, Volume 83, Issue 2, 21 March 1980, Pages 215-246.
829. J. Harrison, Isolating critical cases for reciprocals using integer factorization, ARITH-16, June 2003. (ps, pdf)
830. Gus L. W. Hart and Rodney W. Forcade, Generating derivative structures: Algorithm and applications (2008); http://arxiv.org/abs/0804.3544
831. Rebecca Hartman-Baker, The Diffusion Equation Method for Global Optimization and Its Application to Magnetotelluric Geoprospecting
832. Mehdi Hassani, "Derangements and Applications", J. Integer Sequences, Volume 6, 2003, Article 03.1.2.
833. Mehdi Hassani, Approximation of the Multiplication Table Function (2006), http://arxiv.org/abs/math/0603644.
834. B. Hayes, A Question of Numbers, in American Scientist.
835. B. Hayes, Calculemus!, American Scientist, 96 (Sep-Oct 2008), 362-366
836. Tian-Xiao He, Renzo Sprugnoli, Sequence characterization of Riordan arrays, Discrete Mathematics, Volume 309, Issue 12, 28 June 2009, Pages 3962-3974.
837. A. Healy and S. Toub, Efficient Mesh Licensing, Computer Science 276r, Harvard University, May 2001.
838. Hannes Heikinheimo, Heikki Mannila and Jouni K. Seppanen, Finding Trees from Unordered 01 Data, in Knowledge Discovery in Databases: PKDD 2006, Lecture Notes in Computer Science, Volume 4213/2006, Springer-Verlag.
839. Geir T. Helleloid, Fernando Rodriguez-Villegas, Counting quiver representations over finite fields via graph enumeration, Journal of Algebra, In Press, Corrected Proof, Available online 13 May 2009.
840. Helmke, Uwe; Rosenthal, Joachim; Wang, Xiaochang Alex, Output feedback pole assignment for transfer functions with symmetries. SIAM J. Control Optim. 45 (2006), no. 5, 1898-1914 .
841. Gottfried Helms, Bell Numbers, 2008.
842. J. A. Hendrickson, Jr., On the enumeration of rectangular (0,1)-matrices, Journal of Statistical Computation and Simulation, 51 (1995), 291-313.
843. A. Hendriks, Computations in Propositional Logic, PHD thesis, 1996.
844. Nadia Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of n-th Roots of Generating Functions, Jnl. Combinatorial Theory, A 113 (2006), no. 8, 1732-1745. arXiv:math.NT/0509316.
845. Sven Herrmann, Genocchi Numbers and f-Vectors of Simplicial Balls (2007), http://arxiv.org/abs/math/0702172; European Journal of Combinatorics, Volume 29, Issue 5, July 2008, Pages 1087-1091.
846. Hetyei, Gábor, Central Delannoy numbers and balanced Cohen-Macaulay complexes. Ann. Comb. 10 (2006), no. 4, 443-462.
847. Gabor Hetyei, Tchebyshev triangulations of stable simplicial complexes, Journal of Combinatorial Theory, Series A, Volume 115, Issue 4, May 2008, Pages 569-592.
848. Gabor Hetyei, Enumeration by kernel positions, Advances in Applied Mathematics, Volume 42, Issue 4, May 2009, Pages 445-470.
849. S. Heubach, Tiling an n-by-m Area with Squares of Size up to k-by-k (m <= 5), Congressus Numerantium 140 (1999), pp. 43-64.
850. S. Heubach, N. Y. Li and T. Mansour, Staircase tilings and k-Catalan structures, Discrete Math., 308 (2008), 5954-5964.
851. Heubach, Silvia; Mansour, Toufik, Avoiding patterns of length three in compositions and multiset permutations. Adv. in Appl. Math. 36 (2006), no. 2, 156-174.
852. Heuberger, Clemens; Prodinger, Helmut, On alpha-greedy expansions of numbers. Adv. in Appl. Math. 38 (2007), no. 4, 505-525.
853. Dean Hickerson, "Counting Horizontally Convex Polyominoes", J. Integer Sequences, Volume 2, 1999, Article 99.1.8.
854. Dean Hickerson and Michael Kleber, "Reducing a Set by Subtracting Squares", J. Integer Sequences, Volume 2, 1999, Article 99.1.4.
855. Hikami, Kazuhiro, Volume conjecture and asymptotic expansion of q-series. Experiment. Math. 12 (2003), no. 3, 319-337.
856. Hindman, Neil; Jordan, Henry, Measures of sum-free intersecting families. New York J. Math. 13 (2007), 97-106 .
857. Hinz, Andreas M.; Klavzar, Sandi; Milutinovic, Uros; Parisse, Daniele; Petr, Ciril, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. European J. Combin. 26 (2005), no. 5, 693-708.
858. Florent Hivert, Jean-Christophe Novelli, Lenny Tevlin et al., Permutation statistics related to a class of noncommutative symmetric functions and generalizations of the Genocchi numbers (2007), http://arxiv.org/abs/0710.0447.
859. F. Hivert, J.-C. Novelli and J.-Y. Thibon, Sur quelques propriétés de l'algèbre des arbres binaires. C. R. Math. Acad. Sci. Paris 337 (2003), no. 9, 565-568.
860. F. Hivert, J.-C. Novelli and J.-Y. Thibon, The Algebra of Binary Search Trees, Theoretical Computer Science, 339 (2005), 129-165.
861. F. Hivert, J.-C. Novelli and J.-Y. Thibon, Commutative combinatorial Hopf algebras; Journal of Algebraic Combinatorics, Volume 28, Number 1 / August, 2008.
862. Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon, Trees, functional equations and combinatorial Hopf algebras (2007), http://arxiv.org/abs/math/0701539; European Journal of Combinatorics, Volume 29, Issue 7, October 2008, Pages 1682-1695.
863. Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon, Inversion of some series of free quasi-symmetric functions (2008); http://arxiv.org/abs/0809.4480
864. Florent Hivert and Nicolas M. Thi\'ery, Representation theories of some towers of algebras related to the symmetric groups and their Hecke algebras (2006), http://arxiv.org/abs/math/0607391.
865. Florent Hivert and Nicolas M. Thi\'ery, The Hecke group algebra of a Coxeter group and its representation theory (2007), http://arxiv.org/abs/0711.1561; Journal of Algebra, Volume 321, Issue 8, 15 April 2009, Pages 2230-2258.
866. Hivert, Florent; Thiéry, Nicolas M. MuPAD-Combinat, an open-source package for research in algebraic combinatorics. Sém. Lothar. Combin. 51 (2004/05), Art. B51z, 70 pp.
867. M. F. Hobart and J. D. H. Smith, Vector lattices and rooted trees, Alg. Univ. 34 (1995), 110-117.
868. M. E. Hoffman, Combinatorics of rooted trees and Hopf algebras, Trans. AMS 355 (2003), 3795-3811.
869. T. Hogg, Single-Step Quantum Search Using Problem Structure.
870. Ralf Holtkamp, On Hopf algebra structures over operads (2004), http://arxiv.org/abs/math/0407074.
871. Holtkamp, Ralf, On Hopf algebra structures over free operads. Adv. Math. 207 (2006), no. 2, 544-565.
872. A. N. W. Hone, Sigma function solution of the initial value problem for Somos 5 sequences, Trans. Amer. Math. Soc. 359 (2007), no. 10, 5019-5034.
873. Hone, A. N. W. Elliptic curves and quadratic recurrence sequences. Bull. London Math. Soc. 37 (2005), no. 2, 161-171.
874. A. N. W. Hone, Diophantine non-integrability of a third order recurrence with the Laurent property.
875. Andrew N. W. Hone, Laurent Polynomials and Superintegrable Maps (2007), http://arxiv.org/abs/math/0702280.
876. A. N. W. Hone, Algebraic curves, integer sequences and a discrete Painleve transcendent (2008); http://arxiv.org/abs/0807.2538
877. I. Honkala, T. Laihonen and S. Ranto, On Strongly Identifying Codes, Discrete Math. 254 (2002), no. 1-3, 191-205.
878. Hopkins, Brian; Jones, Michael A. Shift-induced dynamical systems on partitions and compositions. Electron. J. Combin. 13 (2006), no. 1, Research Paper 80, 19 pp.
879. A. F. Horadam, Applications of Modified Pell Numbers to Representations, Ulam Quaterly - Volume 3, Number 1, 1994.
880. Boris Horvat, Ga\v{s}per Jakli\v{c} and Toma\v{z} Pisanski, On the Number of Hamiltonian Groups (2005), http://arxiv.org/abs/math/0503183.
881. A. Horzela, P. Blasiak, G.H.E. Duchamp et al., A product formula and combinatorial field theory (2004), http://arxiv.org/abs/quant-ph/0409152.
882. Qing-Hu Hou, Toufik Mansour and Simone Severini, Partial transpose of permutation matrices (2007), http://arxiv.org/abs/0709.3547.
883. Benjamin Howard, John Millson, Andrew Snowden and Ravi Vakil, The moduli space of n points on the line is cut out by simple quadrics when n is not six (2006), http://arxiv.org/abs/math/0607372.
884. Peter Hoyer, Troy Lee and Robert Spalek, Negative weights make adversaries stronger (2006), http://arxiv.org/abs/quant-ph/0611054.
885. J. Hsiang, D. F. Hsu and Y. P. Shieh, On the hardness of counting problems of complete mappings, Discrete Math., 277 (2004), 87-100.
886. Cheng-Xing Huang, Shou-Li Peng, Fractals of forbidden words and approximating their box dimensions, Physica A: Statistical Mechanics and its Applications, Volume 387, Issues 2-3, 15 January 2008, Pages 703-716.
887. Christian Huck, A Note on Affinely Regular Polygons (2008); http://arxiv.org/abs/0801.3218; European Journal of Combinatorics, Volume 30, Issue 2, February 2009, Pages 387-395.
888. Shi Huang, Modeling the creative process of the mind by prime numbers and a simple proof of the Riemann Hypothesis (2008); http://arxiv.org/abs/0810.0095
889. Christian Huck, On the existence of U-polygons of class c4 in planar point sets, Discrete Mathematics, In Press, Corrected Proof, Available online 3 April 2009.
890. Axel Hultman and Kathrin Vorwerk, Pattern avoidance and the Bruhat order on involutions (2007), http://arxiv.org/abs/0711.2223.
891. S. P. Humphries, "Cogrowth groups and the Dedekind-Frobenius group determinant", Mathematical Proceedings of the Cambridge Philosophical Society, volume 121, Part 2, pages 193-217 (1997).
892. Stephen P. Humphries, Zane Kun Li, Counting powers of words in monoids, European Journal of Combinatorics, Volume 30, Issue 5, July 2009, Pages 1297-1308.
893. Werner Hurlimann, Benford's law from 1881 to 2006 (2006), http://arxiv.org/abs/math.ST/0607168.
894. F. Hurtado, M. Noy, Ears of triangulations and Catalan numbers, Discrete Mathematics, Volume 149, Issues 1-3, 22 February 1996, Pages 319-324.
895. Douglas E. Iannucci, "The Kaprekar Numbers", J. Integer Sequences, Volume 3, 2000, Article 00.1.2.
896. Douglas E. Iannucci and Bertrum Foster, "Kaprekar Triples", J. Integer Sequences, Volume 8, 2005, Article 05.4.8.
897. Douglas E. Iannucci and Donna Mills-Taylor, "On Generalizing the Connell Sequence", J. Integer Sequences, Volume 2, 1999, Article 99.1.7.
898. Douglas E. Iannucci, Deng Moujie and Graeme L. Cohen, "On Perfect Totient Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.4.5.
899. L. Ilie and V. Mitrana, Binary Self-Adding Sequences and Languages, TUCS Technical Reports No. 18, May 1996.
900. Yoshinari Inaba, "Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix", J. Integer Sequences, Volume 8, 2005, Article 05.2.7.
901. Eugen J. Ionascu, "A Parametrization of Equilateral Triangles Having Integer Coordinates", J. Integer Sequences, Volume 10, 2007, Article 07.6.7.
902. Eugen J. Ionascu, A characterization of regular tetrahedra in Z^3 (2007); http://arxiv.org/abs/0712.3951; Journal of Number Theory, Volume 129, Issue 5, May 2009, Pages 1066-1074.
903. Eugen J. Ionascu, Counting all equilateral triangles in {0,1,2,...,n}^3 (2007), http://arxiv.org/abs/math/0701111.
904. Genta Ito, Least change in the Determinant or Permanent of a matrix under perturbation of a single element: continuous and discrete cases (2008); http://arxiv.org/abs/0805.2081
905. Genta Ito, Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element (2008); http://arxiv.org/abs/0805.2083
906. Jablan S. and Sazdanovic R., LinKnot: Knot Theory by Computer, World Scientific Press, 2007. See e.g. p. 71.
907. Brad Jackson and Frank Ruskey, Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages. [Frank told njas: "Without the OEIS this paper would not exist".]
908. Terence Jackson and Keith Matthews, "On Shanks' Algorithm for Computing the Continued Fraction of logb a", J. Integer Sequences, Volume 5, 2002, Article 02.2.7.
909. Jesper Lykke Jacobsen, Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions (2007), http://arxiv.org/abs/0709.2322.
910. Jesper Lykke Jacobsen, Jesus Salas and Alan D. Sokal, Spanning Forests and the q-State Potts Model in the Limit q -> 0, Journal of Statistical Physics, Volume 119, Numbers 5-6 / June, 2005.
911. J. L. Jacobsen and P. Zinn-Justin, A transfer matrix approach to the enumeration of colored links, J. Knot Theor. Ramif., v. 10 (2001), 1233-1267.
912. S. Jaidee, S. Stevens and T. Ward, Mertens' theorem for toral automorphisms (2008); http://arxiv.org/abs/0801.2082
913. Lalit Jain and Pavlos Tzermias, "Beukers' integrals and Apéry's recurrences", J. Integer Sequences, Volume 8, 2005, Article 05.1.1.
914. Milan Janjic, Some integer sequences based on derangements (2007), http://arxiv.org/abs/0704.3058.
915. Milan Janjic, On a Class of Polynomials with Integer Coefficients (2008); http://arxiv.org/abs/0804.2018
916. Milan Janjic, An Enumerative Function (2008); http://arxiv.org/abs/0801.1976
917. Milan Janjic, On Non-central Stirling Numbers of the First Kind (2009) http://arxiv.org/abs/0901.2655
918. Jelínek, Vít, Dyck paths and pattern-avoiding matchings. European J. Combin. 28 (2007), no. 1, 202-213.
919. Vit Jelinek and T. Mansour, On pattern-avoiding partitions, Elec. J. Combinat. 15 (2008) #R39.
920. I. Jensen, Enumerations of plane meanders, Talk presented at StatPhys-Taipei 1999.
921. I. Jensen, A transfer matrix approach to the enumeration of plane meanders, J. Phys. A 33, 5953-5963 (2000).
922. Robert Johansson and Svante Linusson, Pattern Avoidance in Alternating Sign Matrices, Annals of Combinatorics, Volume 11, Numbers 3-4 / December, 2007.
923. Jakob Jonsson, Exact sequences for the homology of the matching complex, Journal of Combinatorial Theory, Series A, Volume 115, Issue 8, November 2008, Pages 1504-1526.
924. Marc Joye, Pascal Paillier and Berry Schoenmakers, On Second-Order Differential Power Analysis, in Cryptographic Hardware and Embedded Systems-CHES 2005, editors: Josyula R. Rao and Berk Sunar, Lecture Notes in Computer Science 3659 (2005) 293-308, Springer-Verlag.
925. Raphael M. Jungers, Vladimir Y. Protasov, Vincent D. Blondel, Overlap-free words and spectra of matrices (2007), http://arxiv.org/abs/0709.1794; Theoretical Computer Science, In Press, Corrected Proof, Available online 9 May 2009.
926. Raphael M. Jungers, Vladimir Yu. Protasov and Vincent D. Blondel, Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices, in LATIN 2008: Theoretical Informatics, Lecture Notes in Computer Science, Volume 4957/2008, Springer-Verlag.
927. T. Kaiser and M. Klazar, On growth rates of hereditary permutation classes, Electr. J. Combinatorics 9 (2) (2003), R10, 20 pages.
928. Kallós, Gábor, A generalization of Pascal's triangle using powers of base numbers. Ann. Math. Blaise Pascal 13 (2006), no. 1, 1-15.
929. E. Kalvelagen, Tiling Squares.
930. Kamioka, Shuhei, A combinatorial representation with Schroeder paths of biorthogonality of Laurent biorthogonal polynomials. Electron. J. Combin. 14 (2007), no. 1, Research Paper 37, 22 pp.
931. Masanobu Kaneko, "The Akiyama-Tanigawa algorithm for Bernoulli numbers", J. Integer Sequences, Volume 3, 2000, Article 00.2.9.
932. H. Kaplan, R. Shamir and R. E. Tarjan, Tractability of parameterized completion problems on chordal, strongly chordal and proper interval graphs, SIAM Journal of Computing 28(5) 1906-1922 (1999).
933. J. Karhumaki and Y. Lifshits, Tiling periodicity
934. Juhani Karhumaki, Yury Lifshits and Wojciech Rytter, Tiling Periodicity, in Combinatorial Pattern Matching, Lecture Notes in Computer Science, Volume 4580/2007, Springer-Verlag.
935. A. Karttunen, On Pascal's Triangle Modulo 2 in Fibonacci Representation, The Fibonacci Quarterly, Vol. 42, 1 (February 2004) pp. 38-46.
936. A. Karttunen, "Tuhansien lukujonojen aarreaitta" [A treasure-trove of thousands of integer sequences], Helsingin Sanomat, Science and Nature Section, page D1, November 9 2004.
937. Kashyap, Navin; Siegel, Paul H.; Vardy, Alexander, An application of Ramsey theory to coding for the optical channel. SIAM J. Discrete Math. 19 (2005), no. 4, 921-937 .
938. Kauers, Manuel, SumCracker: a package for manipulating symbolic sums and related objects. J. Symbolic Comput. 41 (2006), no. 9, 1039-1057.
939. Manuel Kauers, Christoph Koutschan, Doron Zeilberger, Proof of Ira Gessel's Lattice Path Conjecture (2008); http://arxiv.org/abs/0806.4300
940. Manuel Kauers, Burkhard Zimmermann, Computing the algebraic relations of C-finite sequences and multisequences, Journal of Symbolic Computation, Volume 43, Issue 11, November 2008, Pages 787-803.
941. Steven M. Kautz, James I. Lathrop, Self-assembly of the discrete Sierpinski carpet and related fractals (2009) http://arxiv.org/abs/0901.3189
942. Kiran S. Kedlaya and Andrew V. Sutherland, Computing L-series of hyperelliptic curves (2008); http://arxiv.org/abs/0801.2778; in Algorithmic Number Theory, Lecture Notes in Computer Science, Volume 5011/2008, Springer-Verlag.
943. Mike Keith, "On Repdigit Polygonal Numbers", J. Integer Sequences, Volume 1, 1998, Article 98.1.6.
944. Bernd C. Kellner, A conjecture about numerators of Bernoulli numbers related to Integer Sequence A092291 (2004), http://arxiv.org/abs/math/0410297.
945. Christopher A. Kennedy, Mark H. Carpenter, Additive RungeKutta schemes for convectiondiffusionreaction equations, Applied Numerical Mathematics, Volume 44, Issues 1-2, January 2003, Pages 139-181.
946. Kennedy, A. Joseph, Class partition algebras as centralizer algebras of wreath products. Comm. Algebra 35 (2007), no. 1, 145-170. 16S20
947. Adalbert Kerber, A matrix of combinatorial numbers related to the symmetric groups, Discrete Mathematics, Volume 21, Issue 3, 1978, Pages 319-321.
948. Gerzson Kéri and Patric R. J. Østergard, "The Number of Inequivalent (2R+3,7)R Optimal Covering Codes", J. Integer Sequences, Volume 9, 2006, Article 06.4.7.
949. M. Kern, Solution to the SIAM «Hundred-dollar, Hundred-digit Challenge», INRIA report RR 4472, 2002.
950. Florian Kerschbaum and Orestis Terzidis, Filtering for Private Collaborative Benchmarking, in Emerging Trends in Information and Communication Security, Lecture Notes in Computer Science, Volume 3995/2006,
951. Andrey Khalyavin, "The Minimal Density of a Letter in an Infinite Ternary Square-Free Word is 883/3215", J. Integer Sequences, Volume 10, 2007, Article 07.6.5.
952. Tanya Khovanova, How to Create a New Integer Sequence, arXiv:0712.2244.
953. Tanya Khovanova, 9 Divides no Odd Fibonacci (2007); http://arxiv.org/abs/0712.3509
954. Tanya Khovanova, Autobiographical Numbers arXiv:0803.0270 [math.CO]
955. T. Khovanova, Number gossip, arXiv:0804.2277 [math.CO]
956. Tanya Khovanova, Clifford Algebras and Graphs (2008); http://arxiv.org/abs/0810.3322
957. S. Khurshid, D. Marinov, I. Shlyakhter, D. Jackson. A Case for Efficient Solution Enumeration. Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure - Portofino (Italy), May 2003.
958. J. Kieffer and E.-H. Yang, Structured Grammar-Based Codes for Universal Lossless data Compression, Communications in Information and Systems, Vol. 2, No. 1, June 2002, pp. 29-52.
959. Kilibarda, Goran, Enumeration of unlabelled mating graphs. Graphs Combin. 23 (2007), no. 2, 183-199.
960. Goran Kilibarda and Vladeta Jovovic, "Antichains of Multisets", J. Integer Sequences, Volume 7, 2004, Article 04.1.5.
961. Jang Soo Kim, A bijection between two variations of noncrossing partitions (2008) http://arxiv.org/abs/0812.4091
962. C. Kimberling, Fractal Sequences and Interspersions, Ars Combinatoria, vol 45 pp. 157-168, 1997. (See also Interspersions.)
963. Clark Kimberling, "A Self-Generating Set and the Golden Mean", J. Integer Sequences, Volume 3, 2000, Article 00.2.8.
964. Clark Kimberling, "Matrix Transformations of Integer Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.3.3.
965. C. Kimberling, Affinely recursive sets and orderings of languages, Discrete Math., 274 (2004), 147-160.
966. C. Kimberling, Orderings of Products of Fibonacci Numbers, Fibonacci Quarterly, Vol. 42,1 (February 2004) pp. 28-35.
967. Clark Kimberling, "Complementary Equations", J. Integer Sequences, Volume 10, 2007, Article 07.1.4.
968. Clark Kimberling, "The Equation (j+k+1)2-4k = Qn2 and Related Dispersions", J. Integer Sequences, Volume 10, 2007, Article 07.2.7.
969. Clark Kimberling, "Interspersions and Fractal Sequences Associated with Fractions cj/dk", J. Integer Sequences, Volume 10, 2007, Article 07.5.1.
970. Clark Kimberling and John E. Brown, "Partial Complements and Transposable Dispersions", J. Integer Sequences, Volume 7, 2004, Article 04.1.6.
971. A. King , Transposition Gray Codes for Indecomposable Permutations, B.Sc. honours thesis, UVic., 2000. (ps, pdf)
972. J. L. King, A change-of-coordinates from Geometry to Algebra, applied to Brick Tilings, Proceedings of the First International Conference on Semigroups & Algebraic Engineering, held in Aizu-Wakamatsu City, Japan, in March 1997.
973. J. Kingston and D. MacHale, Dissecting squares, Math. Gaz., 85 (2001), 403-430.
974. S. Kitaev, Partially Ordered Generalized Patterns, FPSAC'02.
975. S. Kitaev, Generalized Pattern Avoidance with Additional Restrictions, Seminaire Lotharingien de Combinatoire, B48e (2003), 19 pp.
976. S. Kitaev, Generalized patterns in words and permutations, PHD thesis, Chalmers University of Technology and Göteborg University, 2003.
977. Sergey Kitaev, "Independent Sets on Path-Schemes", J. Integer Sequences, Volume 9, 2006, Article 06.2.2.
978. Kitaev, Sergey, Introduction to partially ordered patterns. Discrete Appl. Math. 155 (2007), no. 8, 929-944.
979. S. Kitaev and T. Mansour, The problem of the pawns, Annals of Combinatorics 8 (2004) 81-91.
980. S. Kitaev and T. Mansour, Simultaneous avoidance of generalized patterns, Ars Combin. 75 (2005), 267-288.
981. S. Kitaev and T. Mansour, On multi-avoidance of generalized patterns, Ars Combin. 76 (2005), 321-350.
982. Adrian R. Kitson, The prime analog of the Kepler-Bouwkamp constant (2006), http://arxiv.org/abs/math/0608186.
983. Adrian R. Kitson, The regularized product of the Fibonacci numbers (2006), http://arxiv.org/abs/math/0608187.
984. Sandi Klavzar, Uro Milutinovi, Ciril Petr, Hanoi graphs and some classical numbers, Expositiones Mathematicae, Volume 23, Issue 4, 1 December 2005, Pages 371-378.
985. Sandi Klavzar, Uro Milutinovi, Ciril Petr, Stern polynomials, Advances in Applied Mathematics, Volume 39, Issue 1, July 2007, Pages 86-95.
986. M. Klazar, On abab-free and abba-free set partitions, Europ. J. Combinatorics 17 (1996), 53-68. (ps, pdf)
987. M. Klazar, Twelve countings with rooted plane trees, Europ. J. Combinatorics 18 (1997), 195-210. (ps, pdf)
988. M. Klazar, On numbers of Davenport-Schinzel sequences, Discrete Math. 185 (1998), 77-87. (ps, pdf)
989. M. Klazar, Kombinatorické pocítání 1999, KAM-DIMATIA Series preprint no. 451 (1999), lecture notes in Czech.
990. M. Klazar, Extremal problems (and a bit of enumeration) for hypergraphs with linearly ordered vertex sets, ITI Series preprint no. 021 (2001).
991. M. Klazar, Counting even and odd partitions, Amer. Math. Monthly 110,6 (2003), 527-532.
992. M. Klazar, Bell numbers, their relatives and algebraic differential equations, J. Combin. Theory, A 102 (2003), 63-87.
993. Klazar, Martin, Extremal problems for ordered hypergraphs: small patterns and some enumeration. Discrete Appl. Math. 143 (2004), no. 1-3, 144-154.
994. Klazar, Martin, Counting set systems by weight. Electron. J. Combin. 12 (2005), Research Paper 11, 8 pp.
995. Klazar, Martin, On identities concerning the numbers of crossings and nestings of two edges in matchings. SIAM J. Discrete Math. 20 (2006), no. 4, 960-976 .
996. Martin Klazar and Florian Luca, On integrality and periodicity of the Motzkin numbers, Aequationes Mathematicae, Volume 69, Numbers 1-2 / March, 2005.
997. Klazar, Martin; Luca, Florian, On the maximal order of numbers in the "factorisatio numerorum" problem. J. Number Theory 124 (2007), no. 2, 470-490.
998. Martin Klazar and Florian Luca, "Counting Keith Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.2.2.
999. M. Klazar and J. Nemecek, A bijection between nonnegative words and sparse abba-free partitions, Discrete Math. 265 (2003), 411-416. (ps, pdf)
1000. M. Klazar and V. Novak, A set partition identity via trees. KAM series ; 96,326.
1001. W. F. Klostermeyer, M. E. Mays, L. Soltes and G. Trapp, A Pascal rhombus, Fibonacci Quarterly, 35 (1997), 318-328.
1002. A. Knopfmacher and M. E. Mays, Compositions with m distinct parts, Ars Combinatorica (1999), 111-128.
1003. A. Knopfmacher and H. Prodinger, On Carlitz compositions, European J. of Combinatorics (1998), 579-589.
1004. A. Knopfmacher and N. Robbins, Identities for the total number of parts in partitions of integers, to appear in Utilitas Mathematica.
1005. D. E. Knuth, Mathematical Vanity Plates, Preprint, 2009.
1006. K. H. Knuth, What is a question?, In: C. Williams (ed.), Bayesian Inference and Maximum Entropy Methods in Science and Engineering, Moscow ID 2002, AIP Conference Proceedings, Vol. 659, American Institute of Physics, Melville NY, pp. 227-242.
1007. Matthias Koch and Sascha Kurz, Enumeration of generalized polyominoes (2006), http://arxiv.org/abs/math/0605144.
1008. L. M. Koganov, V. A. Liskovets and T. R. S. Walsh, Total vertex enumeration in rooted planar maps, Ars Combin., v. 54 (2000), 149-160.
1009. Janos Kollar, Which powers of holomorphic functions are integrable? (2008); http://arxiv.org/abs/0805.0756
1010. Messaoud Kolli, "Direct and Elementary Approach to Enumerate Topologies on a Finite Set", J. Integer Sequences, Volume 10, 2007, Article 07.3.1.
1011. Roman Kolpakov, "Efficient Lower Bounds on the Number of Repetition-free Words", J. Integer Sequences, Volume 10, 2007, Article 07.3.2.
1012. U. Kortenkamp, The Future of Mathematical Software, In: C. Williams (ed.), Proceedings of MTCM 2000, Springer-Verlag, 2001.
1013. Alexandre Kosyak, Irreducibility criterion for the set of two matrices (2008); http://arxiv.org/abs/0807.4696
1014. Christoph Koutschan, Regular languages and their generating functions: The inverse problem, Theoretical Computer Science, Volume 391, Issues 1-2, 4 February 2008, Pages 65-74.
1015. C. Krattenthaler, Advanced Determinant Calculus, Seminaire Lotharingien Combin. 42 ("The Andrews Festschrift") (1999), Article B42q, 67 pp.
1016. C. Krattenthaler, Advanced Determinant Calculus: A Complement, Linear Algebra Appl. 411 (2005), 68-166.
1017. Christian Krattenthaler and Tanguy Rivoal, On the integrality of the Taylor coefficients of mirror maps (2007), http://arxiv.org/abs/0709.1432.
1018. C. Krattenthaler and Paul Slater, Asymptotic Redundancies for Universal Quantum Coding, IEEE Trans. Information Theory 46 (2000), 801-819.
1019. D. Kreimer, On the Hopf algebra structure of perturbative quantum field theories, Adv. Theor. Math. Phys. 2 (1998) 303-334.
1020. Dirk Kreimer, Karen Yeats, An Etude in non-linear DysonSchwinger Equations, Nuclear Physics B - Proceedings Supplements, Volume 160, October 2006, Pages 116-121.
1021. Dirk Kreimer and Karen Yeats, Recursion and growth estimates in renormalizable quantum field theory (2006), http://arxiv.org/abs/hep-th/0612179; Communications in Mathematical Physics, Volume 279, Number 2 / April, 2008.
1022. Rick Kreminski, "Pi to thousands of digits from Vieta's formula", Mathematics Magazine, vol. 81, No. 3, (2008) pp. 201-207.
1023. G. Kreweras, Sur les extensions lineaires d'une famille particuliere d'ordres partiels, Discrete Mathematics, Volume 27, Issue 3, December 1979, Pages 279-295.
1024. Krikun, Maxim, Explicit enumeration of triangulations with multiple boundaries. Electron. J. Combin. 14 (2007), no. 1, Research Paper 61, 14 pp.
1025. M. Krizek, A. Solcova and L. Somer, Construction of Sindel sequences, Comment. Math. Univ. Carolin., 48 (2007), 373-388.

1026. Markus Kuba, A note on naturally embedded ternary trees (2009) http://arxiv.org/abs/0902.2646
1027. Nate Kube and Frank Ruskey, "Sequences That Satisfy a(n-a(n))=0", J. Integer Sequences, Volume 8, 2005, Article 05.5.5.
1028. Joseph P.S. Kung, Anna de Mier, Xinyu Sun and Catherine H. Yan, Lattice and Schroder paths with periodic boundaries (2007), http://arxiv.org/abs/0709.1717; Journal of Statistical Planning and Inference, Volume 139, Issue 6, 1 June 2009, Pages 2014-2027.
1029. J. P. S. Kung and C. H. Yan, Goncarov Polynomials and Parking Functions, J. Combin. Theory Ser. A 102 (2003), no. 1, 16-37.
1030. S. Kurtz, Persistence in different bases. Persistence of a number.
1031. Sascha Kurz, "Enumeration of Integral Tetrahedra", J. Integer Sequences, Volume 10, 2007, Article 07.9.3. Also arXiv 0804:1310, math.CO.
1032. Sascha Kurz, Convex hulls of polyominoes (2007), http://arxiv.org/abs/math/0702786.
1033. J. Kuzmanovich and A. Pavlichenkov, Finite groups of matrices whose entries are integers, Amer. Math. Monthly 109 (2002), no. 2, 173-186.
1034. Patrick Labarque, Blueprint for a Classic Proof of the Four Colour Theorem (2008); http://arxiv.org/abs/0802.1535
1035. Gilbert Labelle, On combinatorial differential equations, Journal of Mathematical Analysis and Applications, Volume 113, Issue 2, 1 February 1986, Pages 344-381.
1036. Gilbert Labelle, Counting asymmetric enriched trees, Journal of Symbolic Computation, Volume 14, Issues 2-3, August-September 1992, Pages 211-242.
1037. G. Labelle, Counting enriched multigraphs according to the number of their edges (or arcs), Discrete Mathematics 217, numbers 1-3 (2000), 237-248.
1038. G. Labelle, C. Lamathe and P. Leroux, Molecular expansion of the species of plane and planar 2-trees, Accepted for publication in Theoretical Computer Science (26 pages). (PostScript, Pdf)
1039. G. Labelle, C. Lamathe and P. Leroux, Enumeration des 2-arbres k-gonaux, communication acceptee au colloque MathInfo 2002 (15 pages). (PostScript, Pdf)
1040. G. Labelle, C. Lamathe and P. Leroux, A classification of plane and planar 2-trees, Theoretical Computer Science, 307 (2003), no. 2, 337-363.
1041. G. Labelle, C. Lamathe and P. Leroux, Labelled and unlabelled enumeration of k-gonal 2-trees, (ps, pdf), J. Combin. Theory Ser. A 106 (2004), no. 2, 193-219.
1042. G. Labelle and P. Leroux, An extension of the exponential formula in enumerative combinatorics, Electronic Journal of Combinatorics, Volume 3(2), 1996, article #R12.
1043. G. Labelle, P. Leroux, E. Pergola and R. Pinzani, Stirling numbers interpolation using permutations with forbidden subsequences, Discrete Mathematics, 246 (2002), 177-195.
1044. J. Labelle, Self-avoiding walks and polyominoes in strips, Bull. ICA, 23 (1998), 88-98.
1045. J. C. Lagarias, Wild and Wooley numbers, Amer. Math. Monthly, 113 (No. 2, 2006), 97-108.
1046. J. C. Lagarias, E. M. Rains and N. J. A. Sloane, The EKG sequence, Experimental Math. 11 (2003), 437-446.
1047. J. C. Lagarias and N. J. A. Sloane, Approximate Squaring, Experimental Math., 13 (2004), 113-128.
1048. Joshua D. Laison and Michelle Schick, "Seeing Dots: Visibility of Lattice Points", Mathematics Magazine, Vol. 80, #4, pp. 274 - 282 (2007).
1049. Thomas Lam, Lauren Williams, Total positivity for cominuscule Grassmannians (2007), http://arxiv.org/abs/0710.2932.
1050. Cédric Lamathe, "The Number of Labelled k-Arch Graphs", J. Integer Sequences, Volume 7, 2004, Article 04.3.1.
1051. W. Lang, On Polynomials Related to Powers and Derivatives of the Generating Function of Catalan's Numbers , KA-TP-4-1998, April.
1052. Wolfdieter Lang, "On Generalizations of the Stirling Number Triangles", J. Integer Sequences, Volume 3, 2000, Article 00.2.4.
1053. W. Lang, On Polynomials Related to Powers of the Generating Function of Catalan's Numbers, The Fibonacci Quarterly, Vol.38,5 (2000) pp 408-419.
1054. W. Lang, Riccati meets Fibonacci, KA-TP-11-2001, Jun. The Fibonacci Quarterly.
1055. W. Lang, On Polynomials Related to Derivatives of the Generating Function of Catalan Numbers, The Fibonacci Quarterly, Vol.40,4 (2002) pp 299-313.
1056. A. Laradji and A. Umar, "Combinatorial Results for Semigroups of Order-Decreasing Partial Transformations", J. Integer Sequences, Volume 7, 2004, Article 04.3.8.
1057. Laradji, A.; Umar, A. Combinatorial results for semigroups of order-preserving partial transformations. J. Algebra 278 (2004), no. 1, 342-359.
1058. Laradji, A.; Umar, A. Combinatorial results for semigroups of order-preserving full transformations. Semigroup Forum 72 (2006), no. 1, 51-62.
1059. A. Laradji and A. Umar, Combinatorial Results for the Symmetric Inverse Semigroup, Semigroup Forum, Volume 75, Number 1 / September, 2007.
1060. J. F. J. Laros, Numeration-automatic sequences (2006), http://arxiv.org/abs/cs/0605076.
1061. M. E. Larsen, The eternal triangle - a history of a counting problem, College Math. J., 20 (1989), 370-392.
1062. Morten Larsen, Petar Popovski and Soren Andersen, Cooperative Communication with Multiple Description Coding, in Cooperation in Wireless Networks: Principles and Applications, Springer-Verlag.
1063. M. Latapy, Partitions of an Integer into Powers, Discrete Mathematics and Theoretical Computer Science special issue, Proceedings of Discrete Models - Combinatorics, Computation and Geometry 2001 (DM-CCG'01). (ps.gz, pdf )
1064. John W. Layman, "Some Properties of a Certain Nonaveraging Sequence", J. Integer Sequences, Volume 2, 1999, Article 99.1.3.
1065. John W. Layman, "The Hankel Transform and Some of its Properties", J. Integer Sequences, Volume 4, 2001, Article 01.1.5.
1066. Jiri Lebl and Daniel Lichtblau, Uniqueness of certain polynomials constant on a hyperplane (2008); http://arxiv.org/abs/0808.0284
1067. M. Lehn, Chern classes of tautological sheaves on Hilbert schemes of points on surfaces. Invent. Math. 136 (1999), no. 1, 157-207.
1068. Siegfried Lehr, Jeffrey Shallit, John Tromp, On the vector space of the automatic reals, Theoretical Computer Science, Volume 163, Issues 1-2, 30 August 1996, Pages 193-210.
1069. Tamás Lengyel, "Asymptotics for Lacunary Sums of Binomial Coefficients and a Card Problem with Ranks", J. Integer Sequences, Volume 10, 2007, Article 07.7.2.
1070. C. Lenormand, Compléments d'informatique fondamentale, mathématiques, combinatoires, linguistiques (Livre I/Livre II/Livre III), Département Informatique Université Paris 8, 2002 (see Préface ).
1071. Philippe Leroux, An equivalence of categories motivated by weighted directed graphs, arXiv:math-ph/0709.3453.
1072. Philippe Leroux, "A Simple Symmetry Generating Operads Related to Rooted Planar m-ary Trees and Polygonal Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.4.7.
1073. Thierry Levy, Schur-Weyl duality and the heat kernel measure on the unitary group, Advances in Mathematics, Volume 218, Issue 2, 1 June 2008, Pages 537-575.
1074. B. Lewis, Partitioning a set, Math. Gaz., 86 (2002), 51-58.
1075. Richard P. Lewis, Simon P. Norton, On a problem raised by P.J. Cameron, Discrete Mathematics, Volume 138, Issues 1-3, 6 March 1995, Pages 315-318.
1076. Huaien Li and David C. Torney. A complete system of orthogonal step functions. Proc. Amer. Math. Soc. 132 (2004) 3491-3502.
1077. Nelson Y. Li, Toufik Mansour, An identity involving Narayana numbers, European Journal of Combinatorics, Volume 29, Issue 3, April 2008, Pages 672-675.
1078. Lievens, S.; Stoilova, N. I.; Van der Jeugt, J. Harmonic oscillators coupled by springs: discrete solutions as a Wigner quantum system. J. Math. Phys. 47 (2006), no. 11, 113504, 23 pp.
1079. S. Linusson, The number of M-sequences and f-vectors, Combinatorica, 19 (2), (1999), 255-266.
1080. Liskiewicz, Maciej; Ogihara, Mitsunori; Toda, Seinosuke, The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theoret. Comput. Sci. 304 (2003), no. 1-3, 129-156.
1081. Valery A. Liskovets, "Some Easily Derivable Integer Sequences", J. Integer Sequences, Volume 3, 2000, Article 00.2.2.
1082. Valery A. Liskovets, "A Note on the Total Number of Double Eulerian Circuits in Multigraphs", J. Integer Sequences, Volume 5, 2002, Article 02.2.5.
1083. V. A. Liskovets, Some identities for enumerators of circulant graphs, J. of Algebr. Combin., v. 18:3 (2003), 189-209.
1084. V. A. Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Appl. Math., 154, No.3 (2006), 537-551.
1085. V. A. Liskovets and T. R. Walsh, Counting unrooted maps on the plane, Advances in Applied Math. 36, No.4 (2006), 364-387.
1086. Lisonek, Petr, Combinatorial families enumerated by quasi-polynomials. J. Combin. Theory Ser. A 114 (2007), no. 4, 619-630.
1087. Li Liu and Yi Wang, On the log-convexity of combinatorial sequences (2006), http://arxiv.org/abs/math/0602672; Advances in Applied Mathematics, Volume 39, Issue 4, October 2007, Pages 453-476.
1088. Minglei Liu, Ce Zhu, Index assignment for 3-description lattice vector quantization based on A2 lattice, Signal Processing, Volume 88, Issue 11, November 2008, Pages 2754-2763.
1089. Sh-Chung Liu, Jun Ma and Yeong-Nan Yeh, Dyck Paths with Peak- and Valley-Avoiding Sets, Studies in Appl. Math. 121 (2008) 263-289
1090. E. Keith Lloyd, The standard deviation of 1, 2, ..., n - Pell's equation and rational triangles, Math. Gaz., July 1997, 231-243.
1091. Loday, Jean-Louis, Inversion of integral series enumerating planar trees. Sém. Lothar. Combin. 53 (2004/06), Art. B53d, 16 pp.
1092. Jean-Louis Loday, On the algebra of quasi-shuffles (2005), http://arxiv.org/abs/math/0506498.
1093. D. E. Loeb, The World of Generating Functions and Umbral Calculus, in Gian-Carlo Rota on Combinatorics: Introductory Papers and Commentaries, Volume 1, editor: Joseph P. S. Kung, Birkhauser (1995) 201-216.
1094. S. Loktev, Weight Multiplicity Polynomials of multi-variable Weyl Modules (2008); http://arxiv.org/abs/0806.0170
1095. P. A. Loomis, An Introduction to Digit Product Sequences, to appear in the Journal of Recreational Mathematics in 2004.
1096. Paul Loomis, Michael Plytage and John Polhill, Summing up the Euler 'phi' function, The College Mathematics Journal, vol. 39 (#1), pp. 34-42.
1097. Pavel Loskot and Norman C. Beaulieu, On monotonicity of the hypersphere volume and area, Journal of Geometry, Volume 87, Numbers 1-2 / November, 2007.
1098. J. Loughry, J. I. van Hemert and L. Schoofs. Efficiently Enumerating the Subsets of a Set, preprint.
1099. Luca, Florian, Prime factors of Motzkin numbers. Ars Combin. 80 (2006), 87-96.
1100. F. Luca, On the sum of the first n primes being a square, Lithuanian Mathematical Journal, Volume 47, Number 3 / July, 2007.
1101. Florian Luca, Juan Luis Varona, Multiperfect numbers on lines of the Pascal triangle, Journal of Number Theory, Volume 129, Issue 5, May 2009, Pages 1136-1148.
1102. David Luebke, Martin Reddy, Jonathan D. Cohen, Amitabh Varshney, Benjamin Watson, Robert Huebner, References, Level of Detail for 3D Graphics, 2003, Pages 349-369.
1103. M. A. Lujan Moreno, Object Oriented Linear Algebra, M. Phil. Thesis, Dept. Computer Science, University Of Manchester, 1999.
1104. M. A. Lujan Moreno, OoLaLa -- From Numerical Linear Algebra to Compiler Technology for Design Patterns, PhD thesis, Department of Computer Science, University of Manchester, 2002.
1105. S. Lundin, Young-Tablåer och mönsterundvikande, Masters thesis.
1106. P. H. Lundow, Enumeration of matchings in polygraphs, 1998.
1107. G. A. Lunter, Bifurcations in Hamiltonian systems [Online Resource] : computing singularities by Gröbner bases, 1999 (see stellingen).
1108. J.-G. Luque and J.-Y. Thibon, Noncommutative Symmetric Functions Associated with a Code, Lazard Elimination and Witt Vectors, Discrete Math. Theor. Comput. Sci. 9 (2007), no. 2, 59-72.
1109. N. Lygeros, M. Mizony and P. Zimmermann, New ECM record, Perfection (Journal of the Pi Society), volume 1 number 202/2000.
1110. David W. Lyons and Scott N. Walck, Multiparty quantum states stabilized by the diagonal subgroup of the local unitary group (2008); http://arxiv.org/abs/0808.2989
1111. M. G. Maaß, Scheduling Independent and Identically Distributed Tasks with In-Tree Constraints on three Machines in Parallel, Diplomarbeit, Lehrstuhl für Effiziente Algorithmen, Institut für Informatik, TU München, sep 2001.
1112. Matthew Macauley, Jon McCammond, and Henning S. Mortveit, Dynamics Groups of Asynchronous Cellular Automata (2008); http://arxiv.org/abs/0808.1238
1113. Priya Mahadevan, Dmitri Krioukov, Kevin Fall et al., Systematic Topology Analysis and Generation Using Degree Correlations (2006), http://arxiv.org/abs/cs/0605007.
1114. Maier, Robert S., Algebraic hypergeometric transformations of modular origin. Trans. Amer. Math. Soc. 359 (2007), no. 8, 3859-3885 .
1115. Branko J. Maleevi and Ivana V. Jovovi, "The Compositions of Differential Operations and the Gateaux Directional Derivative", J. Integer Sequences, Volume 10, 2007, Article 07.8.2.
1116. Branko J. Malesevic, Some combinatorial aspects of composition of a set of functions (2004), http://arxiv.org/abs/math/0409287.
1117. Branko J. Malesevic, Some considerations in connection with Kurepa's function (2004), http://arxiv.org/abs/math/0406235.
1118. Branko J. Malesevic, Some considerations in connection with alternating Kurepa's function (2004), http://arxiv.org/abs/math/0406236.
1119. Branko Malesevic, Some inequalities for Kurepa's function (2005), http://arxiv.org/abs/math/0506205.
1120. Branko Malesevic, Some inequalities for alternating Kurepa's function (2005), http://arxiv.org/abs/math/0506207.
1121. Branko J. Malesevic and Ivana V. Jovovic, The Compositions of the Differential Operations and Gateaux Directional Derivative (2007), http://arxiv.org/abs/0706.0249.
1122. Colin L. Mallows and Lou Shapiro, "Balls on the Lawn", J. Integer Sequences, Volume 2, 1999, Article 99.1.5.
1123. C. L. Mallows and N. J. A. Sloane, Two-graphs, switching classes and Euler graphs are equal in number, SIAM J. Appl. Math., 28 (1975), 876-880.
1124. Manolescu, Ciprian, Link homology theories from symplectic geometry. Adv. Math. 211 (2007), no. 1, 363-416.
1125. Toufik Mansour, "Counting Peaks at Height k in a Dyck Path", J. Integer Sequences, Volume 5, 2002, Article 02.1.1.
1126. T. Mansour, Restricted 132-Dumont permutations, http://arxiv.org/abs/math/0209379; Australasian Journal of Combinatorics, 2003.
1127. Mansour, Toufik, Restricted 132-alternating permutations and Chebyshev polynomials. Ann. Comb. 7 (2003), no. 2, 201-227.
1128. Mansour, Toufik, Combinatorial methods and recurrence relations with two indices. J. Difference Equ. Appl. 12 (2006), no. 6, 555-563.
1129. Mansour, Toufik, The enumeration of permutations whose posets have a maximum element. Adv. in Appl. Math. 37 (2006), no. 4, 434-442.
1130. Toufik Mansour, "Statistics on Dyck Paths", J. Integer Sequences, Volume 9, 2006, Article 06.1.5.
1131. Mansour, Toufik, Recurrence relations with two indices and even trees. J. Difference Equ. Appl. 13 (2007), no. 1, 47-61.
1132. Toufik Mansour, Matthias Schork, Simone Severini, A generalization of boson normal ordering, Physics Letters A, Volume 364, Issues 3-4, 30 April 2007, Pages 214-220.
1133. Toufik Mansour, Matthias Schork and Simone Severini, Noncrossing normal ordering for functions of boson operators (2006), http://arxiv.org/abs/quant-ph/0607074; International Journal of Theoretical Physics, Volume 47, Number 3 / March, 2008.
1134. Toufik Mansour, Matthias Schork and Yidong Sun, "Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression", J. Integer Sequences, Volume 10, 2007, Article 07.7.4.
1135. Toufik Mansour and Simone Severini, Enumeration of $(k,2)$-noncrossing partitions (2008); http://arxiv.org/abs/0808.1157; Discrete Math., 308 (2008), 4570-4577.
1136. Toufik Mansour and Yidong Sun, Identities involving Narayana polynomials and Catalan numbers (2008); http://arxiv.org/abs/0805.1274; Discrete Mathematics, Volume 309, Issue 12, 28 June 2009, Pages 4079-4088.
1137. T. Marchant, Cooperative phenomena in crystals and the probability of tied Borda count elections, Discrete Applied Mathematics, 119, pp. 265-271 (2002).
1138. Jean-Francois Marckert and Gregory Miermont, The CRT is the scaling limit of unordered binary trees (2009) http://arxiv.org/abs/0902.4570
1139. Barbara H. Margolius, "Permutations with Inversions", J. Integer Sequences, Volume 4, 2001, Article 01.2.4.
1140. B. H. Margolius, Transient and periodic solution to the time-inhomogeneous quasi-birth death process, Queueing Systems, Volume 56, Numbers 3-4 / August, 2007.
1141. B.H. Margolius, Periodic solution to the time-inhomogeneous multi-server Poisson queue, Operations Research Letters, Volume 35, Issue 1, January 2007, Pages 125-138.
1142. D. Marinov and R. Radoicic, Counting 1324-avoiding Permutations, Electronic Journal of Combinatorics, Volume 9(2), 2002-2003, article #R13.
1143. G. Martin, Farmer Ted goes natural, Math. Mag. 72 (1999), no. 4, 259-276.
1144. Martin, Jeremy L. The slopes determined by n points in the plane. Duke Math. J. 131 (2006), no. 1, 119-165.
1145. Martin, Jeremy L.; Savitt, David; Singer, Ted, Harmonic algebraic curves and noncrossing partitions. Discrete Comput. Geom. 37 (2007), no. 2, 267-286.
1146. Jeremy Marzuola and Andy Miller, Counting numerical sets with no small atoms (2008); http://arxiv.org/abs/0805.3493
1147. Annalisa Marzuoli, Mario Rasetti, Computing spin networks, Annals of Physics, Volume 318, Issue 2, August 2005, Pages 345-407.
1148. Krzysztof Maslanka, Effective method of computing Li's coefficients and their properties (2004), http://arxiv.org/abs/math/0402168.
1149. R. J. Mathar, Numerical Representation of the Incomplete Gamma Function of Complex-Valued Argument, Num. Algorithms 36 (2004), pp 247-264.
1150. R. J. Mathar, A Table of Third and Fourth Order Feynman Diagrams of the Interacting Fermion Green's Function, arXiv:physics/0512022
1151. Richard J. Mathar, Table of Feynman diagrams of the interacting Fermion Green's Function, Int. J. Quant. Chem., vol. 107, issue 10 (2007) 1975-1984.
1152. Richard J. Mathar, Series of reciprocal powers of k-almost primes, arXiv:0803.0900 [math.NA]
1153. Richard J. Mathar, Finite Square Lattice Vertex Cover by a Baseline Set Defined With a Minimum Sublattice (2008) http://arxiv.org/abs/0811.2434
1154. Richard J. Mathar, Twenty Digits of Some Integrals of the Prime Zeta Function (2008) http://arxiv.org/abs/0811.4739
1155. Richard J. Mathar, Hardy-Littlewood Constants Embedded into Infinite Products over All Positive Integers, http://arxiv.org/abs/0903.2514.
1156. R. J. Mathar, Corrigenda to "Interesting series involving the central binomial coefficient"..., arxiv:0905.0215 [math.CA], 2009
1157. Andrey O. Matveev, Neighboring Fractions in Farey Subsequences (2008); http://arxiv.org/abs/0801.1981
1158. Andrey O. Matveev, A Note on Boolean Lattices and Farey Sequences II (2008); http://arxiv.org/abs/0801.4966
1159. R. Mayans, The future of mathematical text: A proposal for a new internet hypertext for Mathematics, J. Digital Information 5 (1) (2004) 234.
1160. D. Mayhew and G. F. Royle, Matroids with nine elements, arXiv:0702.316 [math.CO]
1161. C. Mazza and D. Piau, Products of correlated symmetric matrices and q-Catalan numbers, Probab. Theory Related Fields 124 (2002), 574-594.
1162. Judson S. McCranie, "A Study of Hyperperfect Numbers", J. Integer Sequences, Volume 3, 2000, Article 00.1.3.
1163. Brendan D. McKay, Frederique E. Oggier, N. J. A. Sloane, Gordon F. Royle, Ian M. Wanless and Herbert S. Wilf, Acyclic Digraphs and Eigenvalues of (0,1)-Matrices, Journal of Integer Sequences, 7 (2004), #04.3.3.
1164. B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.
1165. B. D. McKay and I. M. Wanless, A census of small latin hypercubes, SIAM J. Discrete Math., 22 (2008) 719-736.
1166. R. I. McLachlan and B. N. Ryland, The algebraic entropy of classical mechanics, J. Math. Phys. 44 (2003), no. 7, 3071-3087.
1167. A. McLeod and W. O. J. Moser, Counting cyclic binary strings, Math. Mag., 80 (No. 1, 2007), 29-37.
1168. Peter R. W. McNamara and Bruce E. Sagan, Infinite log-concavity: developments and conjectures (2008); http://arxiv.org/abs/0808.1065; Advances in Applied Mathematics, In Press, Corrected Proof, Available online 17 April 2009.
1169. J. P. McSorley, Counting structures in the Moebius ladder, Discrete Math., 184 (1998), 137-164.
1170. Mednykh, Alexander; Nedela, Roman, Enumeration of unrooted maps of a given genus. J. Combin. Theory Ser. B 96 (2006), no. 5, 706-729.
1171. N. Meenakshisundaram and Arul Lakshminarayan, The Fourier transform of the Hadamard transform: Multifractals, Sequences and Quantum Chaos (2005), http://arxiv.org/abs/nlin/0510009.
1172. Melfi, Giuseppe, On simultaneous binary expansions of n and n^2. J. Number Theory 111 (2005), no. 2, 248-256.
1173. E. Mendelsohn, Races with ties, Math. Mag. 55 (1982), 170-175.
1174. H. Mercier, Réconciliation et complexité de la communication des données corrélées, M.Sc. Thesis, Université de Montréal, 2003.
1175. Donatella Merlini, Proper generating trees and their internal path length, Discrete Applied Mathematics, Volume 156, Issue 5, 1 March 2008, Pages 627-646.
1176. Donatella Merlini and Renzo Sprugnoli, "Playing with Some Identities of Andrews", J. Integer Sequences, Volume 10, 2007, Article 07.9.5.
1177. Istvan Mezo, On powers of Stirling matrices (2008) http://arxiv.org/abs/0812.4047
1178. Martin A. Michels and Ulrich Knauer, The congruence classes of paths and cycles, Discrete Mathematics, 309 (2009), 5352-5359.
1179. Jean-Francis Michon, Pierre Valarcher and Jean-Baptiste Yunès, "Mahler's Expansion and Boolean Functions", J. Integer Sequences, Volume 10, 2007, Article 07.3.4.
1180. J. Millar, N. J. A. Sloane and N. E. Young, A new operation on sequences: the Boustrophedonon transform, J. Combin. Theory, 17A 44-54 1996.
1181. M. Miller, J. Gimbert, F. Ruskey and J. Ryan, Iterations of eccentric digraphs, Bulletin of the Institute of Combinatorics and its Applications, 45 (2005) 41-50.
1182. Robert L. Miller, Necklaces, symmetries and self-reciprocal polynomials, Discrete Mathematics, Volume 22, Issue 1, 1978, Pages 25-33.
1183. Steven J. Miller, Lower order terms in the 1-level density for families of holomorphic cuspidal newforms (2007), http://arxiv.org/abs/0704.0924.
1184. Steven J. Miller, An identity for sums of polylogarithm functions (2008); http://arxiv.org/abs/0804.3611
1185. S. C. Milne, Hankel determinants of Eisenstein series, Developments in Mathematics vol. 4, Kluwer Academic Pub., Dordrecht, 2001, pp. 171--188.
1186. R. Miner and P. Topping, Math on the Web: A Status Report, Design Science, January 2001.
1187. Angelo B. Mingarelli, Abstract factorials of arbitrary sets of integers, 29 May 2007.
1188. Marni Julie Mishna, A Holonomic Systems Approach to Algebraic Combinatorics, Ph. D. Dissertation, Univ. Québec à Montrèal, Nov. 2003.
1189. Marni Mishna, "Automatic Enumeration of Regular Objects", J. Integer Sequences, Volume 10, 2007, Article 07.5.5.
1190. M. Mohammed, Counting Hexagonal Lattice Animals, submitted.
1191. J. W. Moon, Lattice paths in regions with the catalan property, Journal of Combinatorial Theory, Series A, Volume 28, Issue 1, January 1980, Pages 98-102.
1192. D. Moore, W. F. Smyth and D. Miller, Counting distinct strings, Algorithmica 23 -1 (1999) 1-13.
1193. M. Mor, A. S. Fraenkel, Cayley permutations, Discrete Mathematics, Volume 48, Issue 1, January 1984, Pages 101-112.
1194. de la Mora, Carlos; Wojciechowski, Piotr J. Multiplicative bases in matrix algebras. Linear Algebra Appl. 419 (2006), no. 2-3, 287-298.
1195. Jack Morava, On the visual appearance of relativistic objects (2008); http://arxiv.org/abs/0804.4160
1196. P. Moree, Convoluted convolved Fibonacci numbers J. Integer Sequences, Volume 7, 2004, Article 04.2.2.
1197. Nelma Moreira and Rogério Reis, "On the Density of Languages Representing Finite Set Partitions", J. Integer Sequences, Volume 8, 2005, Article 05.2.8.
1198. Kent E. Morrison, "Integer Sequences and Matrices Over Finite Fields", J. Integer Sequences, Volume 9, 2006, Article 06.2.1.
1199. T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Refers to the manuscript of the 1973 Handbook of Integer Sequences.]
1200. Tom Müller, A negative answer to two questions about the smallest prime numbers having given digit sums, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 5, Paper A10, 2005.
1201. Tom Müller, "Prime and Composite Terms in Sloane's Sequence A056542", J. Integer Sequences, Volume 8, 2005, Article 05.3.3.
1202. Müller, Tom, Searching for large elite primes. Experiment. Math. 15 (2006), no. 2, 183-186.
1203. Tom Müller, "On Anti-Elite Prime Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.9.4.
1204. Augustine O. Munagi, Extended set partitions with successions, European Journal of Combinatorics, Volume 29, Issue 5, July 2008, Pages 1298-1308.
1205. Munarini, Emanuele, Enumeration of order ideals of a garland. Ars Combin. 76 (2005), 185-192.
1206. Munarini, Emanuele, Combinatorial properties of the antichains of a garland. Integers, 9 (2009), 353-374.
1207. Munarini, Emanuele; Torri, Damiano, Cayley continuants. Theoret. Comput. Sci. 347 (2005), no. 1-2, 353-369.
1208. Munarini, Emanuele; Zagaglia Salvi, Norma, Binary strings without zigzags. Sém. Lothar. Combin. 49 (2002/04), Art. B49h, 15 pp.
1209. H. Z. Munthe-Kaas and S. Krogstad, On enumeration problems in Lie-Butcher theory, Future Generation Computer Systems, Volume 19, Issue 7, October 2003, Pages 1197-1205.
1210. H. Z. Munthe-Kaas and W. M. Wright, On the Hopf Algebraic Structure of Lie Group Integrators (2006), http://arxiv.org/abs/math/0603023; Foundations of Computational Mathematics, Volume 8, Number 2 / April, 2008.
1211. V. Murali, Combinatorics of counting finite fuzzy subsets, Fuzzy Sets and Systems, Volume 157, Issue 17, 1 September 2006, Pages 2403-2411.
1212. Fionn Murtagh, The Haar Wavelet Transform of a Dendrogram: Additional Notes (2007), http://arxiv.org/abs/cs/0702067.
1213. Fionn Murtagh, Symmetry in Data Mining and Analysis: A Unifying View based on Hierarchy (2008); http://arxiv.org/abs/0805.2744
1214. G. Musiker, Cluster algebras, Somos sequences and exchange graphs, thesis, 2002(a).
1215. A. N. Myers, Counting permutations by their rigid patterns, J. Combin. Theory, A 99 (2002), 345-357.
1216. Gerry Myerson, Trifectas in Geometric Progression, Australian Mathematical Society Gazette, 2008, to appear.
1217. Melvyn B. Nathanson, Primitive sets and an Euler phi function for subsets of {1,2,...,n} (2006), http://arxiv.org/abs/math/0608150.
1218. Nebe, G., Kneser-Hecke-operators in coding theory. Abh. Math. Sem. Univ. Hamburg 76 (2006), 79-90.
1219. G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
1220. Z. Nedev and S. Muthukrishnan, The Nagger-Mover Game, DIMACS Tech. Report 2005-22.
1221. Z. Nedev, S. Muthukrishnan, The Magnus-Derek game, Theoretical Computer Science, Volume 393, Issues 1-3, 20 March 2008, Pages 124-132.
1222. Robert M. Nemba and Alphonse Emadak, "Direct Enumeration of Chiral and Achiral Graphs of a Polyheterosubstituted Monocyclic Cycloalkane", J. Integer Sequences, Volume 5, 2002, Article 02.1.6.
1223. Nemecek, Jan; Klazar, Martin, A bijection between nonnegative words and sparse abba-free partitions. Discrete Math. 265 (2003), no. 1-3, 411-416.
1224. Rafael I. Nepomechie and Francesco Ravanini, Completeness of the Bethe Ansatz solution of the open XXZ chain with nondiagonal boundary terms (2003), http://arxiv.org/abs/hep-th/0307095.
1225. Neudauer, Nancy Ann; Stevens, Brett, Enumeration of the bases of the bicircular matroid on a complete bipartite graph. Ars Combin. 66 (2003), 165-178.
1226. E. Neuwirth, Computing Tournament Sequence Numbers Efficiently With Matrix Techniques, Séminaire Lotharingien de Combinatoire, B47h (2002), 12 pp.
1227. Lee Aaron Newberg, The number of clone orderings, Discrete Applied Mathematics, Volume 69, Issue 3, 27 August 1996, Pages 233-245.
1228. L. A. Newberg, Finding, Evaluating, and Counting DNA Physical Maps (2002), Doctoral Thesis, University of California at Berkeley, 1993.
1229. H. Niederhausen, Catalan Traffic at the Beach, Electronic Journal of Combinatorics, Volume 9(1), 2002, article #R33.
1230. Heinrich Niederhausen, Random walks in octants and related structures, J. Stat. Planning Inf. 135 (2005), no 1, 165-196.
1231. Heinrich Niederhausen, "A Note on the Enumeration of Diffusion Walks in the First Octant by Their Number of Contacts with the Diagonal", J. Integer Sequences, Volume 8, 2005, Article 05.4.3.
1232. Nill, Benjamin, Volume and lattice points of reflexive simplices. Discrete Comput. Geom. 37 (2007), no. 2, 301-320.
1233. A. Nkwanta, Lattice paths and RNA secondary structures, in African Americans in Mathematics, ed. N. Dean, Amer. Math. Soc., 1997, pp. 137-147.
1234. Tony D. Noe, "On the Divisibility of Generalized Central Trinomial Coefficients", J. Integer Sequences, Volume 9, 2006, Article 06.2.7.
1235. Tony D. Noe and Jonathan Vos Post, "Primes in Fibonacci n-step and Lucas n-step Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.4.4.
1236. J. Noonan, The number of permutations containing exactly one increasing subsequence of length three. Discrete Math. 152 (1996), no. 1-3, 307-313.
1237. J. Noonan and D. Zeilberger, The Goulden-Jackson Cluster Method: Extensions, Applications and Implementations, J. Difference Eq. Appl. 5 (1999), 355-377.
1238. J.-C. Novelli and J.-Y. Thibon, Polynomial realizations of some trialgebras, Proc. Formal Power Series and Algebraic Combinatorics 2006 (San-Diego, June 2006)
1239. J.-C. Novelli and J.-Y. Thibon, Noncommutative Symmetric Functions and Lagrange Inversion; Advances in Applied Mathematics, Volume 40, Issue 1, January 2008, Pages 8-35.
1240. J.-C. Novelli and J.-Y. Thibon, Hopf algebras and dendriform structures arising from parking functions, Fund. Math. 193 (2007), no. 3, 189-241.
1241. J.-C. Novelli and J.-Y. Thibon, Free quasi-symmetric functions of arbitrary level
1242. Jean-Christophe Novelli and Jean-Yves Thibon, A one-parameter family of dendriform identities (2007), http://arxiv.org/abs/0709.3235.
1243. Jean-Christophe Novelli and Jean-Yves Thibon, Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions (2008); http://arxiv.org/abs/0806.3682
1244. Jean-Christophe Novelli and Jean-Yves Thibon, Superization and (q,t)-specialization in combinatorial Hopf algebras (2008); http://arxiv.org/abs/0803.1816
1245. J.-C. Novelli, J.-Y. Thibon and N. M. Thiéry, Algèbres de Hopf de graphes, C.R. Acad. Sci. Paris (Comptes Rendus Mathematique), 339 (2004), 607-610.
1246. Jean-Christophe Novelli , Jean-Yves Thibon , Nicolas M. Thi\'ery et al., Hopf Algebras of Graphs (2008) http://arxiv.org/abs/0812.3407
1247. Marc Noy, Juanjo Rue, Counting polygon dissections in the projective plane, Advances in Applied Mathematics, Volume 41, Issue 4, October 2008, Pages 599-619.
1248. J.-P. Nzali, K. T. Porguy, H. Tapamo, Algorithme de Calcul du degré de retournement d'un graphe planaire topologique, Arima, Volume 1 - 2002.
1249. M. J. O'Brien, De Bruijn Graphs and The Ehrenfeucht-Mycielski Sequence, Master's Thesis, Carnegie Mellon University, April 26, 2001.
1250. Colm O'Dunlaing, In-order traversal of splay trees, Electronic Notes in Theoretical Computer Science, Volume 74, October 2003, Pages 134-157.
1251. Edwin O'Shea, M-partitions: Optimal partitions of weight for one scale pan (2003), http://arxiv.org/abs/math/0311230.
1252. A. M. Odlyzko, Asymptotic enumeration methods, in Handbook of Combinatorics, vol. 2, R. L. Graham, M. Groetschel and L. Lovasz, eds., Elsevier, 1995, pp. 1063-1229. (ps, pdf).
1253. A. Odlyzko, The rapid evolution of scholarly communication, Learned Publishing, Volume 15 no. 1, pp. 7-19.
1254. Gloria Olive, Catalan numbers revisited, Journal of Mathematical Analysis and Applications, Volume 111, Issue 1, October 1985, Pages 201-235.
1255. R. L. Ollerton and A. G. Shannon, Extensions of generalized binomial coefficients, QM&MS Research Reports (2001).
1256. J. B. Olsson, Side 9-sætningen: En sætning om partitioner, Famøs Fagblad for Aktuar, Matematik, Økonomi og Statistik, 16. årgang, nr. 2, dec. 2002.
1257. Mihai Oltean, Solving the Hamiltonian path problem with a light-based computer (2007), http://arxiv.org/abs/0708.1512; Natural Computing, Volume 7, Number 1 / March, 2008.
1258. Mihai Oltean and Oana Muntean, Exact Cover with light (2007), http://arxiv.org/abs/0708.1962; New Generation Computing, Volume 26, Number 4 / August, 2008.
1259. Omey, Edward; Van Gulck, Stefan, On the number of orderings of n items. Bull. Belg. Math. Soc. Simon Stevin 14 (2007), no. 2, 229-237.
1260. Onofri, E.; Veneziano, G.; Wosiek, J. Supersymmetry and combinatorics. Comm. Math. Phys. 274 (2007), no. 2, 343-355.
1261. E. Ordentlich and R. M. Roth, The Asymptotic Capacity of Multi-Dimensional Runlength-Limited Constraints and Independent Sets in Hypergraphs, HP Labs 2002 Technical Report.
1262. Ordentlich, Erik; Roth, Ron M., Independent sets in regular hypergraphs and multidimensional runlength-limited constraints. SIAM J. Discrete Math. 17 (2004), no. 4, 615-623 .
1263. Orellana, Rosa C. On partition algebras for complex reflection groups. J. Algebra 313 (2007), no. 2, 590-616.
1264. Orlitsky, Alon; Santhanam, Narayana P. Speaking of infinity. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2215-2230.
1265. Orlitsky, Alon; Santhanam, Narayana P.; Zhang, Junan, Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inform. Theory 50 (2004), no. 7, 1469-1481.
1266. R. Osburn, Research Statement.
1267. J. A. Oteo and J. Ros, "A Fractal Set from the Binary Reflected Gray Code", J. Phys. A: Math Gen. 38 (2005) 8935-8949
1268. Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira and Ling Cheng, Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes, Designs, Codes and Cryptography, Volume 48, Number 2 / August, 2008.
1269. Sergei Ovchinnikov, Discrete piecewise linear functions (2008); http://arxiv.org/abs/0807.3364
1270. Don N. Page, Religious and Scientific Faith in Simplicity (2008); http://arxiv.org/abs/0811.0630
1271. David Pagni, Building buildings with triangular numbers, AMATYC Review (vol. 27 no. 2 spring 2006, pp. 56-65).
1272. I. Pak, Partition Identities and Geometric Bijections, Proc. Amer. Math. Soc. 132 (2004), 3457-3462.
1273. Apisit Pakapongpun, Thomas Ward, Functorial orbit counting (2009) http://arxiv.org/abs/0901.2646
1274. J. M. Pallo, On the listing and random generation of hybrid binary trees, International Journal of Computer Mathematics, 50, 1994, 135-145.
1275. Jean Pallo, An efficient upper bound of the rotation distance of binary trees, Information Processing Letters, Volume 73, Issues 3-4, 29 February 2000, Pages 87-92.
1276. Jean Marcel Pallo, Weak associativity and restricted rotation, Information Processing Letters, Volume 109, Issue 10, 30 April 2009, Pages 514-517.
1277. A. Panayotopoulos and P. Tsikouras, "Meanders and Motzkin Words", J. Integer Sequences, Volume 7, 2004, Article 04.1.2.
1278. D. Parisse, The Tower of Hanoi and the Stern-Brocot Array, Thesis, Ludwig-Maximilians-Universitaet Munich, August 1997.
1279. So Ryoung Park, Jinsoo Bae, Hyun Gu Kang, Iickho Song, On the polynomial representation for the number of partitions with fixed lengths, Math. Comp. vol. 77, no. 262 (2008) 1135-1151.
1280. D. S. Parker and P. Ram, The construction of Huffman codes is a submodular ("convex") optimization problem over a lattice of binary trees. SIAM J. Comput. 28 (1999), no. 5, 1875-1905 (electronic).
1281. M. G. Parker, Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels, LNCS 1719, Presented in part at 13th International Symposium, AAECC-13, Honolulu, Hawaii, pp 420-429, 14-19 Nov, 1999. (postscript, pdf)
1282. M. G. Parker, Spectrally Bounded Sequences, Codes and States: Graph Constructions and Entanglement, Invited Talk at Eighth IMA International Conference on Cryptography and Coding, Cirencester, UK, 17-19 December, 2001, LNCS 2260, pp. 339ff. (2001). (PostScript, Pdf)
1283. M. G. Parker and C. Tellambura, A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio, Reports in Informatics, University of Bergen, Report No 242, ISSN 0333-3590, February 2003. (ps, pdf)
1284. Robert Parviainen, "Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13", J. Integer Sequences, Volume 9, 2006, Article 06.3.2.
1285. Robert Parviainen, "Parametric Production Matrices and Weighted Succession Rules: a Dyck Path Example", J. Integer Sequences, Volume 10, 2007, Article 07.6.1.
1286. Robert Parviainen, Some bijections on set partitions (2007), http://arxiv.org/abs/0710.1132.
1287. N. Patson, Pisano period and permutations of n X n matrices, Australian Math. Soc. Gazette, 2007.
1288. G. Paun and A. Salomaa, Self-reading sequences. Amer. Math. Monthly 103 (1996), no. 2, 166-168.
1289. Pavlyukh, Y.; Hübner, W. Analytic solution of Hedin's equations in zero dimensions. J. Math. Phys. 48 (2007), no. 5, 9 pp.
1290. J. L. Pe, Ana's Golden Fractal.
1291. J. L. Pe, On a Generalization of Perfect Numbers, To appear in The Journal of Recreational Mathematics 31(3).
1292. J. L. Pe, Fractal dimension, primes and the persistence of memory, Adv. Compl. Systems 6(2) (2003) 241-249
1293. Joseph L. Pe, The 3x+1 fractal, Computers & Graphics, Volume 28, Issue 3, June 2004, Pages 431-435.
1294. Paul Peart and Wen-Jin Woan, "Generating Functions via Hankel and Stieltjes Matrices", J. Integer Sequences, Volume 3, 2000, Article 00.2.1.
1295. Paul Peart and Wen-Jin Woan, "Dyck Paths With No Peaks At Height k", J. Integer Sequences, Volume 4, 2001, Article 01.1.3.
1296. E. T. Pegg Jr., A Complete List of Fair Dice, Master's Thesis, University of Colorado at Colorado Springs, 1997.
1297. Ed Pegg, Jr., Polyform puzzles, in Tribute to a Mathemagicain, Peters, 2005, pp. 119-125.
1298. R. E. Peile, H. Taylor, Sets of points with pairwise distinct slopes, Computers & Mathematics with Applications, Volume 39, Issue 11, June 2000, Pages 109-115.
1299. A. Pekec, Meaningful and Meaningless Solutions for Cooperative N-person Games, European Journal of Operational Research, Volume 133, Issue 3, 16 September 2001, Pages 608-623.
1300. John A. Pelesko, "Generalizing the Conway-Hofstadter $10,000 Sequence", J. Integer Sequences, Volume 7, 2004, Article 04.3.5.
1301. J.-G. Penaud and O. Roquesm, Génération efficace d'un langage de Fibonacci, Colloque LaCIM 2000.
1302. K. A. Penson, Coherent States from Combinatorial Sequences, Conference 'Quantum Theory and Symmetries 2', Krakow, Poland, July 2001.
1303. K. A. Penson, P. Blasiak, G. Dattoli et al., Monomiality principle, Sheffer-type polynomials and the normal ordering problem (2005), http://arxiv.org/abs/quant-ph/0510079.
1304. K. A. Penson, P. Blasiak, G. Duchamp, A. Horzela and A. I. Solomon, Hierarchical Dobinski-type relations via substitution and the moment problem [J. Phys. A 37 (2004), 3475-3487 ]
1305. K. A. Penson, P. Blasiak, A. Horzela, G. H. E. Duchamp and A. I. Solomon, Laguerre-type derivatives: Dobinski relations and combinatorial identities, J. Math. Phys. vol. 50, 083512 (2009)
1306. K. A. Penson and J.-M. Sixdeniers, "Integral Representations of Catalan and Related Numbers", J. Integer Sequences, Volume 4, 2001, Article 01.2.5.
1307. Karol A. Penson, Allan I Solomon, Coherent States from Combinatorial Sequences (2001), http://arxiv.org/abs/quant-ph/0111151.
1308. Ian Percival, Franco Vivaldi, Critical dynamics and trees, Physica D: Nonlinear Phenomena, Volume 33, Issues 1-3, October-November 1988, Pages 304-313.
1309. E. Pergola, Two bijections for the area of Dyck paths, Discrete Math., 241 (2001), 435-447.
1310. E. Pergola, G. Labelle, P. Leroux and R. Pinzani, Bell permutations and Stirling numbers interpolation, Proceedings FPSAC'99, Barcelona, 450-461.
1311. E. Pergola and R. Pinzani, A Combinatorial Interpretation of the Area of Schr=F6der Paths, Electronic Journal of Combinatorics, Volume 6(1), 1999, article #R40.
1312. Elisa Pergola and Robert A. Sulanke, ""Schröder Triangles, Paths and Parallelogram Polyominoes", J. Integer Sequences, Volume 1, 1998, Article 98.1.7.
1313. Ivars Peterson, Fibonacci's Missing Flowers.
1314. M. Petkovsek and T. Pisanski, Counting Trees, 1994. (PostScript , dvi version)
1315. M. Petkovsek and T. Pisanski, Counting disconnected structures: chemical trees, fullerenes, I-graphs and others, Croatica Chem. Acta, 78 (2005), 563-567.
1316. Aleksandar Petojevic, "The Function _v M_m(s;a;z) and Some Well-Known Sequences", J. Integer Sequences, Volume 5, 2002, Article 02.1.7.
1317. Petojevic, Aleksandar, The {K_i(z)}^\infty_{i=1} functions. Rocky Mountain J. Math. 36 (2006), no. 5, 1637-1650.
1318. Aleksandar Petojevic, H.M. Srivastava, Computation of Euler type sums of the products of Bernoulli numbers, Applied Mathematics Letters, Volume 22, Issue 5, May 2009, Pages 796-801.
1319. George Petrides and Johannes Mykkeltveit, On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes, in Sequences and Their Applications SETA 2006, Lecture Notes in Computer Science, Volume 4086/2006, Springer-Verlag.
1320. J. L. Pfaltz, Partitions of 2^n, Congressus Numerantium 109:3-12, 1995.
1321. J. L. Pfaltz, Partition Coefficients of Acyclic Graphs, 21st International Workshop on Graph Theoretic Concepts in Computer Science, Aachen, June 1995 (Springer Verlag, LNCS #1017) 313-332.
1322. Götz Pfeiffer, "Counting Transitive Relations", J. Integer Sequences, Volume 7, 2004, Article 04.3.2.
1323. Goetz Pfeiffer, A Quiver Presentation for Solomon's Descent Algebra (2007), http://arxiv.org/abs/0709.3914; Advances in Mathematics, Volume 220, Issue 5, 20 March 2009, Pages 1428-1465.
1324. Leroux Philippe, An equivalence of categories motivated by weighted directed graphs (2007), http://arxiv.org/abs/0709.3453.
1325. Picantin, Matthieu, Finite transducers for divisibility monoids. Theoret. Comput. Sci. 362 (2006), no. 1-3, 207-221.
1326. Khodabakhsh Hessami Pilehrood and Tatiana Hessami Pilehrood, Vacca-type series for values of the generalized-Euler-constant function and its derivative (2008); http://arxiv.org/abs/0808.0410
1327. S. Pion, De la géométrie algorithmique au calcul géométrique, Ph.D thesis, Université de Nice Sophia-Antipolis, 1999. (ps, pdf)
1328. T. Pisanski, D. Schattschneider and B. Servatius, Applying Burnside's Lemma to a One-Dimensional Escher Problem, Mathematics Magazine, vol. 79, #3, 167-180.
1329. S. Plouffe, Approximations de séries génératrices et quelques conjectures, Master's Thesis, Univ. du Québec à Montréal, August, 1992. There is a separate page for the associated formulae.
1330. S. Plouffe, Un methode pour obtenir la fonction generatrice algebrique d'une serie, FPSAC, Florence, June 1993.
1331. Simon Plouffe, "The Computation of Certain Numbers Using a Ruler and Compass", J. Integer Sequences, Volume 1, 1998, Article 98.1.3.
1332. B. Poonen and M. Rubinstein, Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics, Vol. 11, pp. 135-156 (ps, pdf). (Although the Encyclopedia is not mentioned in the final version, this paper was born when I wrote the beginning of sequence A007678 on the blackboard in the Commons Room at AT&T Bell Labs and appealed to people to extend it.)
1333. Oleg Posnansky, Ruiwang Huang, N. Jon Shah, The truncated Levy-flight process: Application to the random spin phase change in non-linear magnetic fields, Physica A: Statistical Mechanics and its Applications, Volume 370, Issue 2, 15 October 2006, Pages 553-564.
1334. A. Postnikov and R. P. Stanley, Deformations of Coxeter hyperplane arrangements, Journal of Combinatorial Theory, Series A 91 (2000), no. 1-2, 544-597. (Special issue dedicated to G.-C. Rota.)
1335. Maurice Pouzet, The Profile of relations (2007), http://arxiv.org/abs/math/0703211.
1336. S. C. Power, Approximately finitely acting operator algebras. J. Funct. Anal. 189 (2002), no. 2, 409-468.
1337. J. S. Pratt, Universality in the entanglement structure of ferromagnets (2004), http://arxiv.org/abs/quant-ph/0411125.
1338. V. R. Pratt, Chu Spaces: Complementarity and Uncertainty in Rational Mechanics, Course notes, TEMPUS summer school, Budapest, July 1994.
1339. Emmanuel Preissmann, "A Self-Indexed Sequence", J. Integer Sequences, Volume 8, 2005, Article 05.3.5.
1340. U. Priss, Lattice-based Information Retrieval, Knowledge Organization, Vol. 27, 3, 2000, p. 132-142.
1341. Robert A. Proctor, Let's Expand Rota's Twelvefold Way For Counting Partitions! (2006), http://arxiv.org/abs/math.CO/0606404.
1342. H. Prodinger and T. A. Tshifhumulo, On q-Olivier functions, Annals of Combinatorics, 6 (2002), no. 2, 181-194.
1343. J. Propp, Integrability, Exact Solvability and Algebraic Combinatorics: A Three-Way Bridge?, presented in the Workshop on Combinatorics and Integrable Models, Canberra, 2002.
1344. J. Propp and D. Ullman, On the Cookie Game, International Journal of Game Theory, volume 20 (1992), pages 313-324.
1345. Mihai Prunescu, Self-similar carpets over finite fields (2007), http://arxiv.org/abs/0708.0899.
1346. Lara Pudwell, Digit Reversal Without Apology (2005), http://arxiv.org/abs/math/0511366.
1347. Yash Puri and Thomas Ward, "Arithmetic and Growth of Periodic Orbits", J. Integer Sequences, Volume 4, 2001, Article 01.2.1.
1348. Jozef H. Przytycki, History of Knot Theory (2007), http://arxiv.org/abs/math/0703096.
1349. Jocelyn Quaintance, Letter Representations of m x n x p Proper Arrays (2004), http://arxiv.org/abs/math/0412244.
1350. Jocelyn Quaintance, Word Representations of m x n x p Proper Arrays (2004), http://arxiv.org/abs/math/0412280; Discrete Mathematics, Volume 309, Issue 6, 6 April 2009, Pages 1199-1212.
1351. Quaintance, Jocelyn, Combinatoric enumeration of two-dimensional proper arrays. Discrete Math. 307 (2007), no. 15, 1844-1864; Discrete Mathematics, Volume 307, Issue 15, 6 July 2007, Pages 1844-1864.
1352. Paul Raff, Spanning Trees in Grid Graphs
1353. Kari Ragnarsson and Bridget Eileen Tenner, Obtainable Sizes of Topologies on Finite Sets (2008); http://arxiv.org/abs/0802.2550; Journal of Combinatorial Theory, Series A, In Press, Corrected Proof, Available online 30 May 2009.
1354. Kari Ragnarsson and Bridget Eileen Tenner, Homotopy Type of the Boolean Complex of a Coxeter System (2008); http://arxiv.org/abs/0806.0906; Advances in Mathematics, In Press, Corrected Proof, Available online 23 May 2009.
1355. E. M. Rains and N. J. A. Sloane, "On Cayley's Enumeration of Alkanes (or 4-Valent Trees)", J. Integer Sequences, Volume 2, 1999, Article 99.1.1.
1356. E. M. Rains, N. J. A. Sloane and J. Stufken, The Lattice of N-Run Orthogonal Arrays, J. Statist. Planning Inference, 102 (2002), 477-500.
1357. Rajkovic, Predrag M.; Petkovic, Marko D.; Barry, Paul, The Hankel transform of the sum of consecutive generalized Catalan numbers. Integral Transforms Spec. Funct. 18 (2007), no. 3-4, 285-296.
1358. Jaime Rangel-Mondragon, Polyominoes and Related Families, The Mathematica Journal, 9:3 (2005), 609-640.
1359. Rankin, Stuart; Flint, Ortho; Schermann, John, Enumerating the prime alternating knots. II. J. Knot Theory Ramifications 13 (2004), no. 1, 101-149.
1360. B. S. Rao, Heptagonal numbers in the Pell sequence and diophantine equations 2x^2 = y^2(5y-3)^2 +- 2, Fib. Quarterly, 43 (2005), 194-201.
1361. B. S. Rao, Heptagonal numbers in the associated Pell sequence ..., Fib. Quarterly, 43 (2005), 302-306.
1362. Rauhut, Holger, Random sampling of sparse trigonometric polynomials. Appl. Comput. Harmon. Anal. 22 (2007), no. 1, 16-42.
1363. Vlady Ravelomanana, the Projet PAI Amadeus Collaboration, The Average Size of Giant Components Between the Double-Jump (2006), http://arxiv.org/abs/cs/0607057.
1364. R. C. Read, On general dissections of a polygon, Aequat. Math. 18 (1978), 370-388.
1365. Reading, Nathan, Lattice congruences of the weak order. Order 21 (2004), no. 4, 315-344 (2005).
1366. Reading, Nathan, Lattice congruences, fans and Hopf algebras. J. Combin. Theory Ser. A 110 (2005), no. 2, 237-273.
1367. Reeds, James A.; Fishburn, Peter C. Counting split interval orders. Order 18 (2001), no. 2, 129-135.
1368. A. Regev, Young tableaux and 1/e, preprint.
1369. Daniel Reidenbach, Johannes C. Schneider, Morphically primitive words, Theoretical Computer Science, Volume 410, Issues 21-23, 17 May 2009, Pages 2148-2161.
1370. Markus Reineke, The use of geometric and quantum group techniques for wild quivers (2003), http://arxiv.org/abs/math/0304193.
1371. P. Repetowicz, U. Grimm and M. Schreiber, High-temperature expansion for Ising models on quasiperiodic tilings, J. Phys. A: Math. Gen. 32 (1999) 4397-4418.
1372. Guillermo Restrepo and Leonardo A. Pachon, Mathematical Aspects of the Periodic Law (2006), http://arxiv.org/abs/math.GR/0611410.
1373. C. Richard and U. Grimm, On the Entropy and Letter Frequencies of Ternary Square-Free Words, math.CO/0302302, Electron. J. Combin. 11 (2004), no. 1, Research Paper 14, 19 pp.
1374. D. Richards, Coordination and Shared Mental Models, American Journal of Political Science, 45 (2001), 259-76.
1375. S. L. Richardson Jr, Enumeration of the generalized Catalan numbers, MSc Thesis, West Virginia Univ, 2005
1376. L. B. Richmond and J. Shallit, Counting Abelian Squares (2008); http://arxiv.org/abs/0807.5028
1377. Riera, Constanza; Parker, Matthew G. Generalized bent criteria for Boolean functions. I. IEEE Trans. Inform. Theory 52 (2006), no. 9, 4142-4159.
1378. Michel Rigo, Syntactical and automatic properties of sets of polynomials over finite fields, Finite Fields and Their Applications, Volume 14, Issue 1, January 2008, Pages 258-276.
1379. S. Rinaldi, Succession rules: the whole story, Phd thesis, Università di Firenze, 2002.
1380. John Riordan, Enumeration of plane trees by branches and endpoints, Journal of Combinatorial Theory, Series A, Volume 19, Issue 2, September 1975, Pages 214-222.
1381. J. Riordan, The blossoming of Schroeder's fourth problem, Acta Math., 137 (1976), 1-16.
1382. J. Riordan, A budget of rhyme scheme counts, pp. 455 - 465 of Second International Conference on Combinatorial Mathematics, New York, April 4-7, 1978. Edited by Allan Gewirtz and Louis V. Quintas. Annals New York Academy of Sciences, 319, 1979.
1383. Adrian Riskin, A note on heterogeneous decompositions into spanning trees (2006), http://arxiv.org/abs/math/0605398.
1384. B. Rittaud, "On the Average Growth of Random Fibonacci Sequences", J. Integer Sequences, Volume 10, 2007, Article 07.2.4.
1385. Benoit Rittaud, Elise Janvresse, Emmanuel Lesigne and Jean-Christophe Novelli, Quand les maths se font discretes, Le Pommier, 2008 (ISBN 978-2-7465-0370-0).
1386. Robbins, Jakayla R., Enumerating orientations of the free spikes. European J. Combin. 28 (2007), no. 3, 868-875.
1387. Jakayla R. Robbins, Representable orientations of the free spikes, Discrete Mathematics, Volume 308, Issue 22, 28 November 2008, Pages 5174-5183.
1388. Neville Robbins, "On Partition Functions and Divisor Sums", J. Integer Sequences, Volume 5, 2002, Article 02.1.4.
1389. David P. Roberts, "Wild Partitions and Number Theory", J. Integer Sequences, Volume 10, 2007, Article 07.6.6.
1390. G. O. Roberts and J. S. Rosenthal, Small and pseudo-small sets for Markov chains, Stochastic Models 17: 121-145, 2001.
1391. A. Robertson, D. Saracino and D. Zeilberger, Refined Restricted Permutations, In memory of Rodica Simion, Ann. Comb. 6 (2002), no. 3-4, 427-444.
1392. R. W. Robinson, Counting Feynman Diagrams.
1393. Ø. J. Rødseth, Enumeration of M-partitions, Discrete Math., 306 (2006), 694-698.
1394. Ø. J. Rødseth, Sloane's box stacking problem, Discrete Math., 306 (2006), 2005-2009.
1395. Ø. J. Rødseth, "Minimal r-Complete Partitions", J. Integer Sequences, Volume 10, 2007, Article 07.8.3.
1396. Ø. J. Rødseth and James A. Sellers, "On a Restricted m-Non-Squashing Partition Function", J. Integer Sequences, Volume 8, 2005, Article 05.5.4.
1397. Ø. J. Rødseth, J. A. Sellers and K. M. Courtright, Arithmetic properties of non-squashing partitions into distinct parts, Ann. Comb. 8 (2004), no. 3, 347-353.
1398. D. G. Rogers, Similarity relations on finite ordered sets, Journal of Combinatorial Theory, Series A, Volume 23, Issue 1, July 1977, Pages 88-98.
1399. D. G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math., 22 (1978), 301-310.
1400. D. G. Rogers, Rhyming schemes: Crossings and coverings, Discrete Mathematics, Volume 33, Issue 1, 1981, Pages 67-77.
1401. D. G. Rogers and L. W. Shapiro, Some correspondences involving the Schroeder numbers and relations, in Lect. Notes Math., Vol. 686 (1978), pp. 267-276.
1402. D. G. Rogers and L. W. Shapiro, Deques, trees and lattice paths, in Combinatorial Mathematics, VIII (Geelong, 1980), pp. 293-303, Lecture Notes in Math., 884, Springer, Berlin-New York, 1981.
1403. Dan Romik, "Some Formulas for the Central Trinomial and Motzkin Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.2.4.
1404. Dan Romik, The dynamics of Pythagorean triples (2004), http://arxiv.org/abs/math/0406512.
1405. Roney-Dougal, Colva M.; Unger, William R. The affine primitive permutation groups of degree less than 1000. J. Symbolic Comput. 35 (2003), no. 4, 421-439.
1406. Jay Rosen, The number of product-weighted lead codes for ballots and its relation to the ursell functions of the linear ising model, Journal of Combinatorial Theory, Series A, Volume 20, Issue 3, May 1976, Pages 377-384.
1407. K. A. Ross, Conjunctive Selection Conditions in Main Memory, Proceedings of the 2002 PODS Conference, June 2002.
1408. K. A. Ross and D. E. Knuth, A Programming and Problem Solving Seminar. Trivia Hunt (Appendix A), Stanford University Technical Report STAN-CS-89-1269, July 1989.
1409. Eric S. Rowland, A simple prime-generating recurrence (2007), http://arxiv.org/abs/0710.3217.
1410. Gordon F. Royle, "Counting Set Covers and Split Graphs", J. Integer Sequences, Volume 3, 2000, Article 00.2.6.
1411. Martin Rubey, Extended Rate, more GFUN (2007), http://arxiv.org/abs/math/0702086.
1412. Martin Rubey, Nestings of Matchings and Permutations and North Steps in PDSAWs (2007); http://arxiv.org/abs/0712.2804
1413. Frank Ruskey and Chris Deugau, The combinatorics of certain k-ary meta-Fibonacci sequences, Preprint, Nov 2008
1414. F. Ruskey, C. R. Miers and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math., 14 (2001) 240-245.
1415. Frank Ruskey and Aaron Williams, An explicit universal cycle for the (n-1)-permutations of an n-set (2007), http://arxiv.org/abs/0710.1842.
1416. John S. Rutherford, Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type, Acta Cryst. (2009). A65, 156163.
1417. Bruce E. Sagan, Congruences via abelian groups, Journal of Number Theory, Volume 20, Issue 2, April 1985, Pages 210-237.
1418. Bruce Sagan, Proper partitions of a polygon and k-Catalan numbers (2004), http://arxiv.org/abs/math/0407280.
1419. Hanno Sahlmann, Entropy calculation for a toy black hole (2007), http://arxiv.org/abs/0709.0076.
1420. J. Salas and A. D. Sokal, Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models I. General Theory and Square-Lattice Chromatic Polynomial, J.Statist.Phys. 104 (2001) 609-699.
1421. D. Salomon, Variable-length Codes for Data Compression, Springer-Verlag.
1422. Paolo Salvatore and Roberto Tauraso, The operad Lie is free (2008); http://arxiv.org/abs/0802.3010; Journal of Pure and Applied Algebra, Volume 213, Issue 2, February 2009, Pages 224-230.
1423. B. Salvy, Automatic Asymptotics and Generating Functions, Algorithms seminar, 1992-1993, INRIA Research Report #2130, 47-50. (Ps, Pdf)
1424. B. Salvy, Découverte de récurrences
1425. B. Salvy and S. Yu. Slavyanov, A Combinatorial Problem in the Classification of Second-Order Linear ODE's, Research Report no. 2600, Institut National de Recherche en Informatique et en Automatique, 1995. 7 pages.
1426. B. Salvy and P. Zimmermann, Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Transactions on Mathematical Software, vol. 20, no. 2, 1994, pages 163-177.
1427. Selene Sanchez-Flores, The Lie module structure on the Hochschild cohomology groups of monomial algebras with radical square zero (2007), http://arxiv.org/abs/0711.2810; Journal of Algebra, Volume 320, Issue 12, 15 December 2008, Pages 4249-4269.
1428. David Sankoff and Lani Haque, Power Boosts for Cluster Tests, in Comparative Genomics, Lecture Notes in Computer Science, Volume 3678/2005, Springer-Verlag.
1429. Joseph M. Santmyer, A stirling like sequence of rational numbers, Discrete Mathematics, Volume 171, Issues 1-3, 20 June 1997, Pages 229-235.
1430. Raman Sanyal, Axel Werner, G\"unter M. Ziegler, On Kalai's conjectures concerning centrally symmetric polytopes (2007), http://arxiv.org/abs/0708.3661.
1431. Sapounakis, A.; Tasoulas, I.; Tsikouras, P. Ordered trees and the inorder traversal. Discrete Math. 306 (2006), no. 15, 1732-1741.
1432. A. Sapounakis, I. Tasoulas and P. Tsikouras, "On the Dominance Partial Ordering of Dyck Paths", J. Integer Sequences, Volume 9, 2006, Article 06.2.5.
1433. A. Sapounakis, I. Tasoulas and P. Tsikouras, Counting strings in Dyck paths, Discrete Math., 307 (2007), 2909-2924.
1434. A. Sapounakis, I. Tasoulas, P. Tsikouras, Enumeration of strings in Dyck paths: A bijective approach, Discrete Mathematics, Volume 309, Issue 10, 28 May 2009, Pages 3032-3039.
1435. A. Sapounakis and P. Tsikouras, "On k-colored Motzkin words", J. Integer Sequences, Volume 7, 2004, Article 04.2.5.
1436. Sapounakis, A.; Tsikouras, P. Counting peaks and valleys in k-colored Motzkin paths. Electron. J. Combin. 12 (2005), Research Paper 16, 20 pp.
1437. J. Sauerberg and L. Shu, The long and the short on counting sequences, Amer. Math. Monthly 104 (1997), no. 4, 306-317.
1438. Carla D. Savage and Herbert S. Wilf, Pattern avoidance in compositions and multiset permutations (2005), http://arxiv.org/abs/math/0504310.
1439. Sawada, J., A simple Gray code to list all minimal signed binary representations. SIAM J. Discrete Math. 21 (2007), no. 1, 16-25 .
1440. Nitin Saxena, Simone Severini, Igor Shparlinski, Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics (2007), http://arxiv.org/abs/quant-ph/0703236.
1441. J. vom Scheidt, H.-J. Starkloff and R. Wunderlich, Stationary solutions of random differential equations with polynomial nonlinearities, Stochastic Analysis and Applications, 6(19):1059-1075, 2001.
1442. F. Schilder, Robust Text Analysis via Underspecification, in the Proceedings of the Workshop on Robust Methods in Analysis of Natutal Language Data (ROMAND 2000), A. Balim, V. Pallotta and H. Ghorbel (eds.), Lausanne, Switzerland, pages 105-120.
1443. Ernesto Schirmacher, Log-Concavity and the Exponential Formula, Journal of Combinatorial Theory, Series A, Volume 85, Issue 2, February 1999, Pages 127-134.
1444. Heinz Schmitz and Sebastian Niemann, A Bicriteria Traveling Salesman Problem with Sequence Priorities, in Metaheuristics in the Service Industry, Lecture Notes in Economics and Mathematical Systems, Volume 624,
1445. B. Schoenmakers, A tight lower bound for top-down skew heaps, Information Processing Letters, 61(5): 279-284, 14 March 1997.
1446. Joachim Schröder, "Generalized Schröder Numbers and the Rotation Principle", J. Integer Sequences, Volume 10, 2007, Article 07.7.7.
1447. Schwartz, Moshe; Etzion, Tuvi, Two-dimensional cluster-correcting codes. IEEE Trans. Inform. Theory 51 (2005), no. 6, 2121-2132.
1448. Sylviane R. Schwer, Temporal Reasoning without Transitive Tables (2007), http://arxiv.org/abs/0706.1290.
1449. Jaroslav Seibert and Pavel Trojovsky, "On Multiple Sums of Products of Lucas Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.4.5.
1450. J. A. Sellers, Beyond Mere Convergence, PRIMUS (Problems, Resources and Issues in Mathematics Undergraduate Studies), XII, no. 2 (2002), 157-164.
1451. James A. Sellers, "Domino Tilings and Products of Fibonacci and Pell Numbers", J. Integer Sequences, Volume 5, 2002, Article 02.1.2.
1452. James A. Sellers, "Partitions Excluding Specific Polygonal Numbers As Parts", J. Integer Sequences, Volume 7, 2004, Article 04.2.4.
1453. Seroussi, Gadiel, On universal types. IEEE Trans. Inform. Theory 52 (2006), no. 1, 171-189.
1454. Simone Severini, Universal quantum computation with unlabeled qubits (2006), http://arxiv.org/abs/quant-ph/0601078.
1455. Simone Severini, Nondiscriminatory Propagation on Trees (2008); http://arxiv.org/abs/0805.0181
1456. Simone Severini and Ferenc Sz\"oll\H{o}si, A further look into combinatorial orthogonality (2007), http://arxiv.org/abs/0709.3651.
1457. J. Shallit, An interesting continued fraction, Math. Mag. 48 (1975), no. 4, 207-211.
1458. J. Shallit, Rational Numbers with Non-Terminating, Non-Periodic Modified Engel-Type Expansions, Fibonacci Quarterly 31 (1993), 37-40.
1459. J. Shallit, Number theory and formal languages, in D. A. Hejhal, J. Friedman, M. C. Gutzwiller, and A. M. Odlyzko, eds., Emerging Applications of Number Theory, IMA Volumes in Mathematics and Its Applications, V. 109, Springer-Verlag, 1999, pp. 547-570.
1460. J. Shallit, Remarks on inferring integer sequences.
1461. Lou Shapiro, Some Open Questions about Random Walks, Involutions, Limiting Distributions, and Generating Functions, Advances in Applied Mathematics, Volume 27, Issues 2-3, August 2001, Pages 585-596.
1462. Lou Shapiro, Some open questions about random walks, involutions, limiting distributions and generating functions. Special issue in honor of Dominique Foata's 65th birthday (Philadelphia, PA, 2000). Adv. in Appl. Math. 27 (2001), no. 2-3, 585-596.
1463. Shapiro, Louis W., Bijections and the Riordan group. Random generation of combinatorial objects and bijective combinatorics. Theoret. Comput. Sci. 307 (2003), no. 2, 403-413.
1464. Mark Shattuck, "Bijective Proofs of Parity Theorems for Partition Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.1.5.
1465. Mark A. Shattuck, Tiling proofs of some formulas for the Pell numbers of odd index, Integers, 9 (2009), 53-64.
1466. Mark A. Shattuck and Carl G. Wagner, "Parity Theorems for Statistics on Lattice Paths and Laguerre Configurations", J. Integer Sequences, Volume 8, 2005, Article 05.5.1.
1467. Mark A. Shattuck and Carl G. Wagner, "Periodicity and Parity Theorems for a Statistic on r-Mino Arrangements", J. Integer Sequences, Volume 9, 2006, Article 06.3.6.
1468. Mark A. Shattuck and Carl G. Wagner, "Some Generalized Fibonacci Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.3.
1469. Kennan Shelton and Michael Siler, Variations of a Coin-Removal Problem (2004), http://arxiv.org/abs/math/0411052.
1470. Zhizhang Shen, Ke Qiu and Eddie Cheng, On the surface area of the (n,k)-star graph, Theoretical Computer Science, 2009.
1471. Vladimir Shevelev, A Conjecture on Primes and a Step towards Justification (2007), http://arxiv.org/abs/0706.0786.
1472. Vladimir Shevelev, On the Basis Polynomials in the Theory of Permutations with Prescribed Up-Down Structure, arXiv: math.CO/0801.0072
1473. Vladimir Shevelev, On Connection between the Numbers of Permutations and Full Cycles with Some Restrictions on Positions and Up-Down Structure arXiv: math.CO/0803.2396
1474. Vladimir Shevelev, On Unique Additive Representations of Positive Integers and Some Close Problems (2008); http://arxiv.org/abs/0811.0290
1475. Vladimir Shevelev, Process of "Primoverization" of Numbers of the Form a^n-1 (2008); http://arxiv.org/abs/0807.2332
1476. Vladimir Shevelev, An Upper Estimate for the Overpseudoprime Counting Function (2008); http://arxiv.org/abs/0807.1975
1477. Vladimir Shevelev, Overpseudoprimes, Mersenne Numbers and Wieferich primes (2008); http://arxiv.org/abs/0806.3412
1478. Vladimir Shevelev, Binary Additive Problems: Theorems of Landau and Hardy-Littlwood Type (2009) http://arxiv.org/abs/0902.1046
1479. Vladimir Shevelev, Binary Additive Problems: Recursions for Numbers of Representations (2009) http://arxiv.org/abs/0901.3102
1480. Ilya Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Electronic Notes in Discrete Mathematics, Volume 9, June 2001, Pages 19-35.
1481. I. Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Discrete Appl. Math. 155 (2007), no. 12, 1539-1548.
1482. Igor E. Shparlinski, "On the Sum of Iterations of the Euler Function", J. Integer Sequences, Volume 9, 2006, Article 06.1.6.
1483. Walter Shur, "Two Game-Set Inequalities", J. Integer Sequences, Volume 6, 2003, Article 03.4.1.
1484. SIAM News, Recognitions ["The numbers that came out were 4, 28, 232, 2092, 19864, . . . and we couldn't see a pattern. In desperation, we sent them to superseeker@research.att.com (a miracle program created by Neil Sloane). ..."]
1485. Aaron N. Siegel, Mis\`ere canonical forms of partizan games (2007), http://arxiv.org/abs/math/0703565.
1486. J. R. Silvester, Factorial Factors, Maths. Gazette (to appear).
1487. R. Simion, Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations, The Electronic Journal of Combinatorics, Volume 7(1), 2000, R#9.
1488. T. Simpson, Permutations with unique fixed and reflected points. Ars Combin. 39 (1995), 97-108.
1489. John R. Singler, Transition to turbulence, small disturbances, and sensitivity analysis II: The NavierStokes equations, Journal of Mathematical Analysis and Applications, Volume 337, Issue 2, 15 January 2008, Pages 1442-1456.
1490. D. Singmaster, Triangles with integer sides and sharing barrels, College Math. J. 21 (1990) 278-285.
1491. J.-M. Sixdeniers, K. A. Penson and A. I. Solomon, "Extended Bell and Stirling Numbers From Hypergeometric Exponentiation", J. Integer Sequences, Volume 4, 2001, Article 01.1.4.
1492. Jonas Sjostrand, Bruhat intervals as rooks on skew Ferrers boards (2006), http://arxiv.org/abs/math/0601615.
1493. Paul B. Slater, Eigenvalues, Separability and Absolute Separability of Two-Qubit States (2008); http://arxiv.org/abs/0805.0267
1494. N. J. A. Sloane, The Sphere Packing Problem, Proceedings Internat. Congress Math. Berlin 1998, Documenta Mathematika, III (1998), pp. 387-396. (postscript, pdf)
1495. N. J. A. Sloane, My Favorite Integer Sequences, in Sequences and their Applications (Proceedings of SETA '98), C. Ding, T. Helleseth and H. Niederreiter (editors), Springer-Verlag, London, 1999, pp. 103-130.
1496. N. J. A. Sloane, On Single-Deletion Correcting Codes, in K. T. Arasu and A. Seress, eds., Codes and Designs, Ohio State University, May 2000 (Ray-Chaudhuri Festschrift), Walter de Gruyter, Berlin, 2002, pp. 273-291.
1497. N. J. A. Sloane, The Sphere-Packing Problem (2002), http://arxiv.org/abs/math/0207256.
1498. N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences (2003), http://arxiv.org/abs/math/0312448.
1499. N. J. A. Sloane, Seven Staggering Sequences, to appear (2006).
1500. N. J. A. Sloane, Gleason's theorem on self-dual codes and its generalizations (talk given at Conference on Algebraic Combinatorics in honor of Eiichi Bannai, Sendai, Japan, June 2006).
1501. N. J. A. Sloane, Eight Hateful Sequences (2008); http://arxiv.org/abs/0805.2128
1502. N. J. A. Sloane and Parthasarathy Nambi, Integer Sequences Related to Chemistry, [pdf], Poster presented at the Amer. Chem. Soc. National Meeting, San Francisco, Fall 2006.
1503. N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), no. 3, 259-274.
1504. N. J. A. Sloane and Thomas Wieder, The Number of Hierarchical Orderings, Order 21 (2004), no. 1, 83-89 (2005).
1505. Slomczynska, Katarzyna Free spectra of linear equivalential algebras. J. Symbolic Logic 70 (2005), no. 4, 1341-1358.
1506. Michael Small, C.K. Tse, David M. Walker, Super-spreaders and the rate of transmission of the SARS virus, Physica D: Nonlinear Phenomena, Volume 215, Issue 2, 15 March 2006, Pages 146-158.
1507. F. Smarandache, Another Set of Sequences, Sub-Sequences and Sequences of Sequences, Partially published in "Only Problems, Not Solutions!", by Florentin Smarandache, Xiquan Publ. Hse., Phoenix, 1991.
1508. F. Smarandache, Considerations on New Functions in Number Theory, Partially inlcuded in the book "Noi Functii in Teoria Numerelor", by Florentin Smarandache, University of Kishinev Press, 120 p., 1999.
1509. F. Smarandache, A Set of Sequences in Number Theory, Presented to the Pedagogical High School Student Conference in Craiova, 1972. "Collected Papers", Vol. II, book by Florentin Smarandache, University of Kishinev Press, Kishinev, 200 p., 1997.
1510. F. Smarandache, G Add-On, Digital, Sieve, General Periodical and Non-Arithmetic Sequences.
1511. Florentin Smarandache, Numerology (2000), http://arxiv.org/abs/math.GM/0010132.
1512. Florentin Smarandache, Sequences of Numbers Involved in Unsolved Problems (2006), http://arxiv.org/abs/math.GM/0604019.
1513. Florentin Smarandache, Jean Dezert, An Introduction to the DSm Theory for the Combination of Paradoxical, Uncertain and Imprecise Sources of Information (2006), http://arxiv.org/abs/cs/0608002.
1514. Florentin Smarandache, Jean Dezert, The Combination of Paradoxical, Uncertain and Imprecise Sources of Information based on DSmT and Neutro-Fuzzy Inference (2004), http://arxiv.org/abs/cs/0412091.
1515. Snellman, Jan, Standard paths in another composition poset. Electron. J. Combin. 11 (2004), no. 1, Research Paper 76, 8 pp.
1516. Jan Snellman, Digraphs with a fixed number of edges and vertices, having a maximal number of walks of length 2 (2008); http://arxiv.org/abs/0804.4655
1517. Jan Snellman and Michael Paulsen, "Enumeration of Concave Integer Partitions", J. Integer Sequences, Volume 7, 2004, Article 04.1.3.
1518. D. R. Snow, Problems and Remarks, 18th International Symposium on Functional Equations, 1980, Remark 18. (ps, pdf)
1519. E. V. K. Sobolev, A survey of the cell-growth problem and some its variations, preprint, Mar. 2001.
1520. Edwin Soedarmadji, Latin hypercubes and MDS codes, Discrete Mathematics, Volume 306, Issue 12, 28 June 2006, Pages 1232-1239.
1521. Allan I. Solomon, Gerard Duchamp, Pawel Blasiak et al., Normal Order: Combinatorial Graphs (2004), http://arxiv.org/abs/quant-ph/0402082.
1522. Steven E. Sommars and Tim Sommars, "The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon", J. Integer Sequences, Volume 1, 1998, Article 98.1.5.
1523. Jonathan Sondow, New Vacca-Type Rational Series for Euler's Constant and Its "Alternating" Analog ln(4/Pi) (2005), http://arxiv.org/abs/math.NT/0508042.
1524. Sondow, Jonathan, A geometric proof that e is irrational and a new measure of its irrationality. Amer. Math. Monthly 113 (2006), no. 7, 637-641. 11J72
1525. Jonathan Sondow, Which Partial Sums of the Taylor Series for e are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463, ...) with an Appendix by Kyle Schalm (2007), http://arxiv.org/abs/0709.0671.
1526. Jonathan Sondow, Ramanujan primes and Bertrand's postulate, Amer. Math. Monthly, 116 (2009), 630-635.
1527. Sondow, Jonathan; and Hadjicostas, Petros, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant. J. Math. Anal. Appl. 332 (2007), no. 1, 292-314.
1528. H.-Y. Song and J. B. Lee, On (n,k)-sequences, Discrete Appl. Math. 105, No.1-3, 183-192 (2000).
1529. Sam E. Speed, "The Integer Sequence A002620 and Upper Antagonistic Functions", J. Integer Sequences, Volume 6, 2003, Article 03.1.4.
1530. Michael Z. Spivey, Combinatorial sums and finite differences, Discrete Mathematics, Volume 307, Issue 24, 28 November 2007, Pages 3130-3146.
1531. Michael Z. Spivey, Staircase rook polynomials and Cayley's game of Mousetrap, European Journal of Combinatorics, Volume 30, Issue 2, February 2009, Pages 532-539.
1532. Michael Z. Spivey and Laura L. Steil, "The k-Binomial Transforms and the Hankel Transform", J. Integer Sequences, Volume 9, 2006, Article 06.1.1.
1533. Pantelimon Stanica, p^q-Catalan Numbers and Squarefree Binomial Coefficients (2000), http://arxiv.org/abs/math/0010148.
1534. R. P. Stanley, Hipparchus, Plutarch, Schroeder and Hough, American Mathematical Monthly 104 (1997), 344-350.
1535. Richard P. Stanley, "The Descent Set and Connectivity Set of a Permutation", J. Integer Sequences, Volume 8, 2005, Article 05.3.8.
1536. P. R. Stein and M. S. Waterman, On some new sequences generalizing the Catalan and Motzkin numbers, Discrete Math., 26 (1979), 261-272.

1537. P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31.
1538. Bertran Steinsky, "A Recursive Formula for the Kolakoski Sequence A000002", J. Integer Sequences, Volume 9, 2006, Article 06.3.7.
1539. B. von Stengel, New maximal numbers of equilibria in bimatrix games, Discrete and Computational Geometry 21 (1999), 557-568.
1540. F. Stephan, Degrees of Computing and Learning, Habilitationsschrift an der Universitaet Heidelberg. Ueberarbeitete Version veroeffentlicht als Forschungsberichte Mathematische Logik 46 / 1999, Mathematisches Institut, Universitaet Heidelberg, Heidelberg, 1999.
1541. F. Stephan, On the structures inside truth-table degrees. J. Symbolic Logic 66 (2001), no. 2, 731-770. (Only the printed version mentions the On-Line Encyclopedia of Integer Sequences.)
1542. R. Stephan, Divide-and-conquer generating functions. Part I. Elementary sequences, 2003. arXiv:math.CO/0307027
1543. R. Stephan, On a sequence related to the Josephus problem, 2003. arXiv:math.CO/0305348
1544. Ralf Stephan, Prove or Disprove. 100 Conjectures from the OEIS (2004), http://arxiv.org/abs/math/0409509.
1545. Stevanovic, Dragan; de Abreu, Nair M. M.; de Freitas, Maria A. A.; Del-Vecchio, Renata, Walks and regular integral graphs. Linear Algebra Appl. 423 (2007), no. 1, 119-135.
1546. Gary E. Stevens, "A Connell-Like Sequence", J. Integer Sequences, Volume 1, 1998, Article 98.1.4.
1547. A. Stoimenow, On enumeration of chord diagrams and asymptotics of Vassiliev invariants, FU Berlin Digitale Dissertation (1999).
1548. A. Stoimenow, Wheel graphs, Lucas numbers and the determinant of a knot, Max Planck Institut-Oberseminar, 30/3/2000.
1549. A. Stoimenow, Graphs, determinants of knots and hyperbolic volume, preprint.
1550. Stoimenow, A. On the number of chord diagrams. Discrete Math. 218 (2000), no. 1-3, 209-233.
1551. A. Stoimenow, , Generating functions, Fibonacci numbers and rational knots, 2002: math.GT/0210174, J. Algebra 310 (2007), no. 2, 491-525.
1552. A. Stoimenow. On the crossing number of positive knots and braids and braid index criteria of Jones and Morton-Williams-Franks. Trans. Amer. Math. Soc. 354 (2002) 3927-3954.
1553. Stoimenow, A. Square numbers, spanning trees and invariants of achiral knots. Comm. Anal. Geom. 13 (2005), no. 3, 591-631.
1554. Th. Stoll, "On Families of Nonlinear Recurrences Related to Digits", J. Integer Sequences, Volume 8, 2005, Article 05.3.2.
1555. Stoll, Thomas, On a problem of Erdos and Graham concerning digits. Acta Arith. 125 (2006), no. 1, 89-100.
1556. Th. Stoll, On Hofstadter's married functions, Fib. Q., 46/47 (2008/2009), 62-67.
1557. Thomas Stoll, A fancy way to obtain the binary digits of 759250125 sqrt{2} (2009) http://arxiv.org/abs/0902.4168
1558. Douglas S. Stones, Ian M. Wanless, Divisors of the number of Latin rectangles, Journal of Combinatorial Theory, Series A, In Press, Corrected Proof, Available online 29 May 2009.
1559. R. Street, Trees, permutations and the tangent function, Reflections 27 (2) (Math. Assoc. of NSW, May 2002), pp. 19-23.
1560. Volker Strehl, A note on similarity relations, Discrete Mathematics, Volume 19, Issue 1, 1977, Pages 99-101.
1561. Volker Strehl, Alternating permutations and modified Ghandi-polynomials, Discrete Mathematics, Volume 28, Issue 1, 1979, Pages 89-100.
1562. R. A. Sulanke, A recurrence restricted by a diagonal condition: generalized Catalan arrays, Fibonacci Quart. 27 (1989), 33-46.
1563. R. A. Sulanke, "Moments of Generalized Motzkin Paths", J. Integer Sequences, Volume 3, 2000, Article 00.1.1.
1564. R. A. Sulanke, "Objects Counted by the Central Delannoy Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.1.5.
1565. R. A. Sulanke, Generalizing Narayana and Schröder numbers to higher dimensions, Electron. J. Combin. 11 (2004), Research Paper 54, 20 pp.
1566. R. A. Sulanke, Moments, Narayana Numbers and the Cut and Paste for Lattice Paths, Journal of Statistical Planning and Inference, Volume 135, Issue 1, 1 November 2005, Pages 229-244.
1567. R. A. Sulanke, Three dimensional Narayana and Schröder numbers, Theoret. Comput. Sci. 346 (2005), no. 2-3, 455-468.
1568. Xinyu Sun, "New Lower Bound On The Number of Ternary Square-Free Words", J. Integer Sequences, Volume 6, 2003, Article 03.3.2.
1569. Yidong Sun, The Star of David Rule (2008); http://arxiv.org/abs/0805.1277; Linear Algebra and its Applications, Volume 429, Issues 8-9, 16 October 2008, Pages 1954-1961.
1570. Yidong Sun and Zhiping Wang, Pattern Avoidance in Generalized Non-crossing Trees (2008); http://arxiv.org/abs/0805.1280
1571. Zhi-Hong Sun, "Expansion and identities concerning Lucas Sequences", The Fibonacci Quarterly, Volume 44, May 2006, pages 145-153.
1572. Zhi-Wei Sun and Roberto Tauraso, Congruences involving Catalan numbers (2007), http://arxiv.org/abs/0709.1665.
1573. P. Sung and Y. Zhang, Recurring Recurrences in Counting Permutations, 2002-2003.
1574. Zoran Sunik [or Sunic], "Young tableaux and other mutually describing sequences", J. Integer Sequences, Volume 5, 2002, Article 02.1.5.
1575. Z. Sunik [or Sunic], Self-describing sequences and the Catalan family tree (PostScript , Pdf), Electron. J. Combin. 10 (2003), Note 5, 9 pp.
1576. Zoran Sunik [or Sunic], Tree morphisms, transducers and integer sequences (2006), http://arxiv.org/abs/math/0612080.
1577. Zoran Sunik [or Sunic], "Rational Tree Morphisms and Transducer Integer Sequences: Definition and Examples", J. Integer Sequences, Volume 10, 2007, Article 07.4.3.
1578. Ruedi Suter, "Two Analogues of a Classical Sequence", J. Integer Sequences, Volume 3, 2000, Article 00.1.8.
1579. Andrew V. Sutherland, Order Computations in Generic Groups, Ph. D. Dissertation, Math. Dept., M.I.T., June 2007.

1580. Andrew V. Sutherland, Constructing elliptic curves over finite fields with prescribed torsion (2008); http://arxiv.org/abs/0811.0296
1581. K. Sutner, The Ehrenfeucht-Mycielski Staircase, Draft. (ps, pdf)
1582. A. Sutyak, Pierce-Engel Hybrid Expansions, Dissertation, West Virginia Univ., 2008.
1583. Christine Swart and Andrew Hone, Integrality and the Laurent phenomenon for Somos 4 sequences (2005), http://arxiv.org/abs/math/0508094.
1584. Székely, L. A.; Wang, Hua, On subtrees of trees. Adv. in Appl. Math. 34 (2005), no. 1, 138-155.
1585. Székely, L. A.; Wang, Hua, Binary trees with the largest number of subtrees. Discrete Appl. Math. 155 (2007), no. 3, 374-385.
1586. Terence Tao, A remark on primality testing and decimal expansions (2008); http://arxiv.org/abs/0802.3361
1587. Yuriy Tarannikov, "The Minimal Density of a Letter in an Infinite Ternary Square-Free Word is 0.2746...", J. Integer Sequences, Volume 5, 2002, Article 02.2.2.
1588. Boris V. Tarasov, The concrete theory of numbers : New Mersenne conjectures. Simplicity and other wonderful properties of numbers (n) = 2^{2n}\pm2^n\pm1$ (2008); http://arxiv.org/abs/0804.3830
1589. Paul Tarau and Brenda Luderman, A Logic Programming Framework for Combinational Circuit Synthesis (2008); http://arxiv.org/abs/0804.2095; in Logic Programming, Lecture Notes in Computer Science, Volume 4670/2007, Springer-Verlag.
1590. G. Tasi, F. Mizukami, J. Csontos, W. Gyorffy and I. Palinko, "Quantum algebraic-combinatoric study of the conformational properties of n-alkanes. II", Journal of Mathematical Chemistry, vol. 27, (#3) (2000), pp. 191-199.
1591. Roberto Tauraso, The dinner table problem: the rectangular case, Integers: Electr. J. Combin. Numb. Th., vol 6 (2006), # A11. Also http://arxiv.org/abs/math/0507293.
1592. P. J. Taylor, Conditions for C-alpha continuity of Bezier Curves, November 2001. [Broken link?]
1593. H. J. J. te Riele, Computational sieving applied to some classical number-theoretic problems, CWI Report, MAS R9821, October 1998.
1594. Zach Teitler, A note on Mustata's computation of multiplier ideals of hyperplane arrangements (2006), http://arxiv.org/abs/math/0610303.
1595. Tenner, Bridget Eileen, Pattern avoidance and the Bruhat order. J. Combin. Theory Ser. A 114 (2007), no. 5, 888-905.
1596. Bridget Eileen Tenner, Spotlight Tiling (2007), http://arxiv.org/abs/0711.1819.
1597. Elmar Teufl, Stephan Wagner, Enumeration problems for classes of self-similar graphs, Journal of Combinatorial Theory, Series A, Volume 114, Issue 7, October 2007, Pages 1254-1277.
1598. Thurber, Edward G., Efficient generation of minimal length addition chains. SIAM J. Comput. 28 (1999), no. 4, 1247-1263 (electronic).
1599. Chao Tian, Vinay A. Vaishampayan and N. J. A. Sloane, Constant Weight Codes: A Geometric Approach Based on Dissections, [pdf].
1600. R. Tonelli, Fibonacci-like sequences and shift spaces in symbolic dynamics (2007), http://arxiv.org/abs/0708.4370.
1601. M. Torelli, Increasing integer sequences and Goldbach's conjecture, preprint, 1996.
1602. M. Torelli, Partitions and Schubert polynomials, Presented at FPSAC'95.
1603. M. Torelli, Increasing Integer sequences and Goldbach's conjecture, RAIRO - Inf. Theor. Appl. 40 (2006) 107-121
1604. D. F. M. Torres, Numeros Felizes e Sucessoes de Smarandache: Digressoes com o Maple, April 2003.
1605. Laszlo Toth, Regular integers modulo n (2007), http://arxiv.org/abs/0710.1936.
1606. Amitabha Tripathi, "A Note on the Postage Stamp Problem", J. Integer Sequences, Volume 9, 2006, Article 06.1.3.
1607. Pavel Trojovsky, On some identities for the Fibonomial coefficients via generating function, Discrete Applied Mathematics, Volume 155, Issue 15, 15 September 2007, Pages 2017-2024.
1608. Tronícek, Zdenek; Shinohara, Ayumi, The size of subsequence automaton. Theoret. Comput. Sci. 341 (2005), no. 1-3, 379-384.
1609. M. Trott, Numerical Computations: The Mathematica GuideBook for Numerics, Springer-Verlag.
1610. Hans J. H. Tuenter, Walking into an absolute sum (2006), http://arxiv.org/abs/math/0606080.
1611. Victor Ufnarovski and Bo Ahlander, "How to Differentiate a Number", J. Integer Sequences, Volume 6, 2003, Article 03.3.4.
1612. Frank Uhlig, Tin-Yau Tam, David Carlson, Directions in matrix theory, Auburn 1990, conference report, Linear Algebra and its Applications, Volumes 162-164, February 1992, Pages 711-797.
1613. A. P. Ulyanov, Polydiagonal compactification of configuration spaces. J. Algebraic Geom. 11 (2002), no. 1, 129-159.
1614. Hanna Uscka-Wehlou, Continued Fractions and Digital Lines with Irrational Slopes, in Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Volume 4992/2008, Springer-Verlag.
1615. Hanna Uscka-Wehlou, Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map, Pattern Recognition, Volume 42, Issue 10, October 2009, Pages 2247-2254.
1616. Daniel Vainsencher, Alfred M. Bruckstein, On isoperimetrically optimal polyforms, Theoretical Computer Science, Volume 406, Issues 1-2, 28 October 2008, Pages 146-159.
1617. van Fossen Conrad, Eric; Flajolet, Philippe, The Fermat cubic, elliptic functions, continued fractions and a combinatorial excursion. Sém. Lothar. Combin. 54 (2005/06), Art. B54g, 44 pp.
1618. Alfred J. van der Poorten, "Elliptic Curves and Continued Fractions", J. Integer Sequences, Volume 8, 2005, Article 05.2.5.
1619. van der Poorten, Alfred J.; Swart, Christine S. Recurrence relations for elliptic sequences: every Somos 4 is a Somos k. Bull. London Math. Soc. 38 (2006), no. 4, 546-554.
1620. Ilan Vardi, The error term in Golomb's sequence, Journal of Number Theory, Volume 40, Issue 1, January 1992, Pages 1-11.
1621. Vasic, Bane; Milenkovic, Olgica, Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans. Inform. Theory 50 (2004), no. 6, 1156-1176.
1622. Vincent Vatter, Enumeration schemes for restricted permutations (2005), http://arxiv.org/abs/math/0510044.
1623. Andrea Velenich, Claudio Chamon, Leticia F. Cugliandolo and Dirk Kreimer, On the Brownian gas: a field theory with a Poissonian ground state (2008); http://arxiv.org/abs/0802.3212
1624. Vella, Antoine, Pattern avoidance in permutations: linear and cyclic orders. Permutation patterns (Otago, 2003). Electron. J. Combin. 9 (2002/03), no. 2, Research paper 18, 43 pp.
1625. T. Verhoeff, "Rectangular and Trapezoidal Arrangements", J. Integer Sequences, Volume 2, 1999, Article 99.1.6.
1626. F. Verstraete, J.I. Cirac, Matrix product states represent ground states faithfully (2005), http://arxiv.org/abs/cond-mat/0505140.
1627. Samuel Alexandre Vidal, An Optimal Algorithm to Generate Pointed Trivalent Diagrams and Pointed Triangular Maps (2007), http://arxiv.org/abs/0706.0969.
1628. Le Anh Vinh, "On Fibonacci-Like Sequences", J. Integer Sequences, Volume 10, 2007, Article 07.10.2.
1629. A. Viola, Analysis of Hashing Algorithms and a New Mathematical Transform
1630. Markus Voge, Anthony J. Guttmann, On the number of hexagonal polyominoes, Theoretical Computer Science, Volume 307, Issue 2, 7 October 2003, Pages 433-453.
1631. vom Scheidt, J.; Starkloff, H.-J.; Wunderlich, R. Stationary solutions of random differential equations with polynomial nonlinearities. Stochastic Anal. Appl. 19 (2001), no. 6, 1059-1075.
1632. P. Vondruska, Fermatuv test primality, Carmichaelova císla, bezctvercová císla, Crypto-World 6 and 7-8 (2000). (Cást I,Cást II).
1633. M. Vsemirnov, "A New Fibonacci-like Sequence of Composite Numbers", J. Integer Sequences, Volume 7, 2004, Article 04.3.7.
1634. Carl G. Wagner, "Partition Statistics and q-Bell Numbers (q = -1)", J. Integer Sequences, Volume 7, 2004, Article 04.1.1.
1635. S. Wagner, Graph-theoretical enumeration and digital expansions: an analytic approach, Dissertation, Fakult. f. Tech. Math. u. Tech. Physik, Tech. Univ. Graz, Austria, Feb., 2006.
1636. S. G. Wagner, An identity for the cycle indices of rooted tree automorphism groups, Elec. J. Combinat., 13 (2006), #R00.
1637. Wang, Weiping; Wang, Tianming, Matrices related to the Bell polynomials. Linear Algebra Appl. 422 (2007), no. 1, 139-154.
1638. Zilong Wang and Guang Gong, New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts (2008) http://arxiv.org/abs/0812.4487
1639. Zuoqin Wang, The twisted Mellin transform (2007), http://arxiv.org/abs/0706.2642.
1640. Wanless, Ian M., Permanents of matrices of signed ones. Linear Multilinear Algebra 53 (2005), no. 6, 427-433.
1641. I. M. Wanless, A computer enumeration of small latin trades, Australas. J. Combin. 39, (2007) 247-258.
1642. Stefan de Wannemacker, Thomas Laffey and Robert Osburn, On a conjecture of Wilf (2006), http://arxiv.org/abs/math/0608085.
1643. F. V. Weinstein, Notes on Fibonacci Partitions (2003), http://arxiv.org/abs/math/0307150.
1644. E. W. Weisstein, CRC Concise Encyclopedia of Mathematics. Boca Raton, FL: CRC Press, 1998. ISBN 0849396409.
1645. E. W. Weisstein's World of Mathematics.
1646. Julian West, Sorting twice through a stack, Theoretical Computer Science, Volume 117, Issues 1-2, 30 August 1993, Pages 303-313.
1647. J. West, Permutation trees and the Catalan and Schroeder numbers, Discrete Math., 146: 247-262 (1995).
1648. Bruce W. Westbury, Invariant tensors for the spin representation of so(7) (2006), http://arxiv.org/abs/math/0601209.
1649. Earl Glen Whitehead Jr., Stirling number identities from chromatic polynomials, Journal of Combinatorial Theory, Series A, Volume 24, Issue 3, May 1978, Pages 314-317.
1650. Robin W. Whitty, Rook polynomials on two-dimensional surfaces and graceful labellings of graphs, Discrete Mathematics, Volume 308, Issues 5-6, 28 March 2008, Pages 674-683.
1651. Thomas Wieder, The number of certain k-combinations of a n-set, Applied Mathematics Electronic Notes, vol. 7 (2007).
1652. T. Wieder: The number of certain rankings and hierarchies formed from labeled or unlabeled elements and sets, Appl. Math. Sci., Vol. 3, 2009, no. 53-56, 2707-2724.
1653. Herbert S. Wilf, The Redheffer matrix of a partially ordered set, The Electronic Journal of Combinatorics, Volume 11(2), 2004, R#10.
1654. Herbert S. Wilf, Mathematics: An Experimental Science, 2005, Draft of a chapter for the forthcoming volume "The Princeton Companion to Mathematics," edited by Tim Gowers.
1655. N. Williams, On Eliminating Square Paths in a Square Lattice, Master's Thesis, Rice University, 2000.
1656. Ryan Williams, Applying Practice to Theory (2008) http://arxiv.org/abs/0811.1305
1657. David W. Wilson, "The Fifth Taxicab Number is 48988659276962496", J. Integer Sequences, Volume 2, 1999, Article 99.1.9.
1658. R. Winkel, An exponential formula for polynomial vector fields II. Lie series, exponential substitution and rooted trees. Adv. Math. 147 (1999), no. 2, 260-303.
1659. H. M. Wiseman and J. Eisert, Nontrivial quantum effects in biology: A skeptical physicists' view (2007), http://arxiv.org/abs/0705.1232.
1660. Roman Witua and Damian Sota, "Quasi-Fibonacci Numbers of Order 11", J. Integer Sequences, Volume 10, 2007, Article 07.8.5.
1661. Roman Witua and Damian Sota, "New Ramanujan-Type Formulas and Quasi-Fibonacci Numbers of Order 7", J. Integer Sequences, Volume 10, 2007, Article 07.5.6.
1662. Roman Witua, Damian Sota and Adam Warzyski, "Quasi-Fibonacci Numbers of the Seventh Order", J. Integer Sequences, Volume 9, 2006, Article 06.4.3.
1663. Wen-Jin Woan, "Hankel Matrices and Lattice Paths", J. Integer Sequences, Volume 4, 2001, Article 01.1.2.
1664. Wen-jin Woan, "A Recursive Relation for Weighted Motzkin Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.1.6.
1665. Wen-jin Woan, "Animals And 2-Motzkin Paths", J. Integer Sequences, Volume 8, 2005, Article 05.5.6.
1666. Wen-jin Woan, "A Relation Between Restricted and Unrestricted Weighted Motzkin Paths", J. Integer Sequences, Volume 9, 2006, Article 06.1.7.
1667. Wen-jin Woan and Barbara Tankersley, "Exponential Generating Functions for Trees with Weighted Edges and Labeled Nodes", J. Integer Sequences, Volume 10, 2007, Article 07.8.4.
1668. Wójtowicz, Marek, Robin's inequality and the Riemann hypothesis. Proc. Japan Acad. Ser. A Math. Sci. 83 (2007), no. 4, 47-49.
1669. Roger Woodford, "Bounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers", J. Integer Sequences, Volume 10, 2007, Article 07.1.3.
1670. E. Wulcan, Pattern avoidance in involutions (Masters thesis), . (ps, pdf)
1671. B. G. Wybourne, Admissible partitions and the expansion of the square of the Vandermonde determinant in N variables, 2003.
1672. Guoce Xin, Determinant Formulas Relating to Tableaux of Bounded Height (2007), http://arxiv.org/abs/0704.3381.
1673. Guoce Xin and Terence Y. J. Zhang, Enumeration of bilaterally symmetric 3-noncrossing partitions (2008); http://arxiv.org/abs/0810.1344; Discrete Mathematics, Volume 309, Issue 8, 28 April 2009, Pages 2497-2509.
1674. Yu. Yakubovich, Integer partitions with fixed subsums, Elect. J. Combinatorics 12 (2005) N7.
1675. Sherry H. F. Yan, "From (2,3)-Motzkin Paths to Schröder Paths", J. Integer Sequences, Volume 10, 2007, Article 07.9.1.
1676. Sherry H. F. Yan, Schroeder Paths and Pattern Avoiding Partitions, arxiv:0805.2465 [math.CO]
1677. Sherry H.F. Yan, Xuezi Liu, 2-noncrossing trees and 5-ary trees, Discrete Mathematics, In Press, Corrected Proof, Available online 25 April 2009.
1678. Yang, Winston C. Derivatives are essentially integer partitions. Discrete Math. 222 (2000), no. 1-3, 235-245.
1679. Y. Yang and J. Leida, Pascal decompositions of geometric arrays in matrices, Fib. Quart. 42 (No. 3, 2004), 205-215.
1680. F. Yano and H. Yoshida, Some set partition statistics in non-crossing partitions and generating functions, Discr. Math., 307 (2007), 3147-3160.
1681. T. Yi, A Tree in a Brain Tumor, Proceedings Thirty-fourth Annual Meeting, Florida Section, Mathematical Association of America.
1682. Na You, Chang Xuan Mao, On hierarchical loglinear models in capturerecapture studies, Computational Statistics & Data Analysis, In Press, Corrected Proof, Available online 15 May 2009.
1683. G. S. Yovanof, H. Taylor, B2-sequences and the distinct distance constant, Computers & Mathematics with Applications, Volume 39, Issue 11, June 2000, Pages 37-42.
1684. Mike Zabrocki, The Joy of Set. To be presented at FPSAC'01 at Arizona State University in May, 2001.
1685. D. Zagier, Vassiliev invariants and a strange identity related to the Dedekind eta-function. Topology 40 (2001), no. 5, 945-960.
1686. A. A. Zaslavskii, Geometry of paired comparisons, Automation and Remote Control, Volume 68, Number 3 / March, 2007.
1687. Thomas Zaslavsky, A new distribution problem of balls into urns and how to color a graph by different-sized sets (2006), http://arxiv.org/abs/math/0609049.
1688. D. Zeilberger, 1998 Steele Prizes, Notices of the AMS, April 1998.

1689. D. Zeilberger, The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks, Electronic Journal of Combinatorics, Volume 8(1), 2001, article #R28.
1690. Doron Zeilberger, There are More Than 2**(n/17) n-Letter Ternary Square-Free Words (1998), http://arxiv.org/abs/math/9809135.
1691. J. Zelinsky, "A Partial Proof of a Conjecture and Other Results", J. Integer Sequences, Volume 5, 2002, Article 02.2.8.
1692. Cheng Zhang and Jianpeng Ma, Counting Solutions for the N-queens and Latin Square Problems by Efficient Monte Carlo Simulations (2008); http://arxiv.org/abs/0808.4003
1693. Hao Zhang and Daniel Gildea, "Enumeration of Factorizable Multi-Dimensional Permutations", J. Integer Sequences, Volume 10, 2007, Article 07.5.8.
1694. Tianping Zhang and Yuankui Ma, "On Generalized Fibonacci Polynomials and Bernoulli Numbers", J. Integer Sequences, Volume 8, 2005, Article 05.5.3.
1695. Ying Zhang, An elementary proof of uniqueness of Markoff numbers which are prime powers (2006), http://arxiv.org/abs/math/0606283.
1696. Zhang, Ying, Congruence and uniqueness of certain Markoff numbers. Acta Arith. 128 (2007), no. 3, 295-301.
1697. Frank Zielen, Rigorose und perturbative Konstruktion von phi^4-Trajektorien, (1998) MSc Thesis, Inst. f. Theoretische Physik, Westf. Wilhelms-Uni. Münster
1698. Robert M. Ziff, "On Cardy's formula for the critical crossing probability in 2d percolation," J. Phys. A. 28, 1249-1255 (1995).
1699. P. Zimmermann, Gaia: a package for the random generation of combinatorial structures, Maple Technical Newsletter vol. 1 nb. 1.
1700. E. Ziv, R. Koytcheff, M. Middendorf and C. Wiggins, Systematic identification of statistically significant network measures, Phys. Rev. E 71 (2005) 0161100
1701. M. Zivkovic, Classification of small (0,1) matrices, Linear Algebra and its Applications, 414 (2006), 310-346.
1702. Michael Zuker, David Sankoff, RNA secondary structures and their prediction, Bulletin of Mathematical Biology, Volume 46, Issue 4, 1984, Pages 591-621.
1703. Roland Zumkeller, Formal Global Optimisation with Taylor Models, Lect. Not. Comp. Sci. (LNCS) 4130 (2006) 408-422.

Click the single right arrow to go to the next demonstration page, or the single left arrow to return to the previous page.