Logo

Demonstration of the

On-Line Encyclopedia of Integer Sequences

(Page 15)

  • 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

  • Thanks to Antonio Garcia Astudillo for supplying many updates and new items.

  • 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, (2008), 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, (2008), 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. F. Adorjan, Binary mapping of monotone sequences, the Aronson and cellular automaton functions, preprint, 2004.

  7. Aguiar, Marcelo; Bergeron, Nantel; Sottile, Frank, Combinatorial Hopf algebras and generalized Dehn-Sommerville relations. Compos. Math. 142 (2006), no. 1, 1-30.

  8. Aguiar, Marcelo; Loday, Jean-Louis, Quadri-algebras. J. Pure Appl. Algebra 191 (2004), no. 3, 205-221.

  9. Aguiar, Marcelo; Moreira, Walter, Combinatorics of the free Baxter algebra. Electron. J. Combin. 13 (2006), no. 1, Research Paper 17, 38 pp.

  10. Aguiar, Marcelo; Nyman, Kathryn; Orellana, Rosa, New results on the peak algebra. J. Algebraic Combin. 23 (2006), no. 2, 149-188.

  11. Marcelo Aguiar and Frank Sottile, Structure of the Malvenuto-Reutenauer Hopf algebra of permutations (2002), http://arxiv.org/abs/math/0203282.

  12. Aguiar, Marcelo; Sottile, Frank, Structure of the Malvenuto-Reutenauer Hopf algebra of permutations. Adv. Math. 191 (2005), no. 2, 225-275. [math.CO/0203282]

  13. Oswin Aichholzer, David Orden, Francisco Santos et al., On the Number of Pseudo-Triangulations of Certain Point Sets (2006), http://arxiv.org/abs/math/0601747.

  14. 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.

  15. Aichholzer, Oswin; Krasser, Hannes, Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36 (2007), no. 1, 2-15.

  16. 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

  17. Amir Akbary and Qiang Wang, A generalized Lucas sequence and permutation binomials, Proc. Amer. Math. Soc. 134 (2006), 15-22.

  18. 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.

  19. M. H. Albert, The fine structure of 321 avoiding permutations, Technical Report OUCS-2002-11, submitted to The Electronic Journal of Combinatorics.

  20. 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

  21. 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.

  22. M. H. Albert, M. D. Atkinson and M. Klazar, "The Enumeration of Simple Permutations", J. Integer Sequences, Volume 6, 2003, Article 03.4.4.

  23. 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.

  24. Albert, M. H.; Linton, Steve; Ruskuc, Nik, The insertion encoding of permutations. Electron. J. Combin. 12 (2005), Research Paper 47, 31 pp.

  25. M. Alekseyev, Josephus problem, in "The Empire of Mathematics" (Russian journal), 2, 2000.

  26. Max A. Alekseyev, On the number of two-dimensional threshold functions (2006), http://arxiv.org/abs/math/0602511.

  27. Lubomir Alexandrov, Prime number logarithmic geometry on the plane (2002), http://arxiv.org/abs/math/0204167.

  28. L. Alexandrov, D. B. Baranov and P. Yotov, Polynomial splines interpolating prime series.

  29. Iskander Aliev, Siegel's Lemma and Sum-Distinct Sets (2005), http://arxiv.org/abs/math/0503115.

  30. 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.]

  31. J.-P. Allouche, La recherche expérimentale en mathématiques.

  32. Jean-Paul Allouche, On a conjecture of Deutsch, Sagan and Wilson (2006), http://arxiv.org/abs/math/0606670.

  33. J.-P. Allouche, N. Rampersad and J. Shallit, On integer sequences whose first iterates are linear, Preprint, 2003.

  34. J.-P. Allouche and J. Shallit, The ring of k-regular sequences, Theoret. Comput. Sci. 98 (1992), 163-197.

  35. J.-P. Allouche and J. Shallit, The Ring of k-regular Sequences, II, Theoret. Comput. Sci. 307 (2003), 3-29.

  36. J.-P. Allouche, J. Shallit and G. Skordev, Self-generating sets, integers with missing blocks and substitutions, Discrete Math. 292 (2005) 1-15.

  37. Horst Alzer, Sharp inequalities for the harmonic numbers, Expo. Math 24 (2006) 385-388.

  38. 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).

  39. 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.

  40. 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.

  41. E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.

  42. 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.

  43. David Applegate, Marc LeBrun and N. J. A. Sloane, Descending Dungeons and Iterated Base-Changing (arXiv: math.NT/0611293).

  44. D. Applegate, E. M. Rains and N. J. A. Sloane, On Asymmetric Coverings and Covering Numbers, J. Combinatorial Designs, 11 (2003), 218-222.

  45. 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.

  46. R. Arratia, L. Goldstein and B. Langholz, Frequency Matching in Logistic Regression, Rejective Sampling and ...

  47. Andrei Asinowski, Toufik Mansour, Dyck paths with coloured ascents (2007), http://arxiv.org/abs/math/0701733.

  48. Ricardo Astudillo, "On a Class of Thue-Morse Type Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.4.2.

  49. Asveld, Peter R. J. Generating all permutations by context-free grammars in Chomsky normal form. Theoret. Comput. Sci. 354 (2006), no. 1, 118-130.

  50. S. Avgustinovich and S. Kitaev, On uniquely k-determined permutations, Discr. Math., 308 (2008), 1500-1507.

  51. Arvind Ayyer, The Half-Perimeter Generating Function of Gated and Wicketed Ferrers diagrams (2007), http://arxiv.org/abs/0710.5133.

  52. 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.

  53. Azarian, Mohammad K., On the hyperfactorial function, hypertriangular function and the discriminants of certain polynomials. Int. J. Pure Appl. Math. 36 (2007), 251-257.

  54. M. Baake and U. Grimm, Coordination sequences for root lattices and related graphs, Zeit. f. Kristallographie, 212 (1997), 253-256.

  55. Michael Baake, Uwe Grimm, Manuela Heuer et al., Coincidence rotations of the root lattice A_4 (2007), http://arxiv.org/abs/0709.1341.

  56. Michael Baake, Manuela Heuer, Robert V. Moody, Similar sublattices of the root lattice A_4 (2007), http://arxiv.org/abs/math/0702448.

  57. 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.

  58. 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.

  59. Roland Bacher, Fair Triangulations (2007), http://arxiv.org/abs/0710.0960.

  60. Roland Bacher, On generating series of complementary planar trees (2004), http://arxiv.org/abs/math/0409050.

  61. R. Bacher and D. Garber, Spindle configurations of skew lines, Geom. Topol. 11 (2007), 1049-1081.

  62. Bacher, Roland; Schaeffer, Gilles, On generating series of coloured planar trees. Sém. Lothar. Combin. 55 (2005/06), Art. B55e, 20 pp.

  63. Dave Bacon, Andrew M. Childs, Wim van Dam, Optimal measurements for the dihedral hidden subgroup problem (2005), http://arxiv.org/abs/quant-ph/0501044.

  64. 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.

  65. D. H. Bailey, Book Reviews, Math. Comp. 65 (1996), 877-895.

  66. 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].

  67. D. H. Bailey and J. M. Borwein, Experimantal mathematics: examples, methods and implications, Notices Amer. Math. Soc. 52 (2005), 502-514.

  68. 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."

  69. R. A. Bailey and P. J. Cameron, Latin squares: Equivalents and equivalence, Draft, May 2003.

  70. Valentin Bakoev, Algorithmic approach to counting certain types of m-ary partitions, Discrete Mathematics, Vol 275 (2004), pp. 17-41.

  71. 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.

  72. Barry Balof and Jacob Menashe, "Semiorders and Riordan Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.7.6.

  73. C. Banderier, Classifying ECO-Systems and Random Walks, Algorithms Project, INRIA Rocquencourt, September 27, 1999.

  74. 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.

  75. 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).

  76. 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).

  77. Cyril Banderier, Philippe Flajolet, Daniele Gardy et al., Generating functions for generating trees (2004), http://arxiv.org/abs/math/0411250.

  78. C. Banderier and S. Schwer, Why Delannoy numbers?, 5th International Conference on Lattice Path Combinatorics and Discrete Distributions, 2002.

  79. R. B. Banks, Slicing Pizzas, Racing Turtles, and Further Adventues in Applied Mathematics, Princeton Univ. Press, 1999.

  80. William D. Banks and Florian Luca, "Concatenations with Binary Recurrent Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.1.3.

  81. H. Barcelo and R. Laubenbacher, Perspectives on A-homotopy theory and its applications, Discr. Math., 298 (2005), 39-61.

  82. 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.

  83. E. Barcucci, L. Belanger and S. Brlek, On Tribonacci Sequences, to appear in Fibonacci Quarterly, 2002.

  84. 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).

  85. E. Barcucci, A. Bernini, M. Poneti, From Fibonacci to Catalan permutations (2006), http://arxiv.org/abs/math/0612277.

  86. 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.

  87. E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, From Motzkin to Catalan permutations, Discrete Mathematics, 217 (2000), 33-49.

  88. E. Barcucci, A. Frosini and S. Rinaldi, On directed-convex polyominoes in a rectangle, Discr. Math., 298 (2005). 62-78.

  89. 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.

  90. 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.

  91. 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.

  92. Baril, J. L.; Pallo, J. M. The phagocyte lattice of Dyck words. Order 23 (2006), no. 2-3, 97-107.

  93. Paul Barry, "A Catalan Transform and Related Transformations on Integer Sequences", J. Integer Sequences, Volume 8, 2005, Article 05.4.5.

  94. Paul Barry, "On Integer-Sequence-Based Constructions of Generalized Pascal Triangles", J. Integer Sequences, Volume 9, 2006, Article 06.2.4.

  95. Paul Barry, "On a Family of Generalized Pascal Triangles Defined by Exponential Riordan Arrays", J. Integer Sequences, Volume 10, 2007, Article 07.3.5.

  96. Paul Barry, "Some Observations on the Lah and Laguerre Transforms of Integer Sequences", J. Integer Sequences, Volume 10, 2007, Article 07.4.6.

  97. Paul Barry, "On Integer Sequences Associated With the Cyclic and Complete Graphs", J. Integer Sequences, Volume 10, 2007, Article 07.4.8.

  98. 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.

  99. 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.

  100. 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.

  101. Bassetti, Federico; Diaconis, Persi, Examples comparing importance sampling and the Metropolis algorithm. Illinois J. Math. 50 (2006), no. 1-4, 67-91 .

  102. F. Bassino, Cyril Nicaud, Pascal Weil, Random generation of finitely generated subgroups of a free group (2007), http://arxiv.org/abs/0707.3185.

  103. 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

  104. 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.

  105. Michel Bauer and Olivier Golinelli, "On the Kernel of Tree Incidence Matrices", J. Integer Sequences, Volume 3, 2000, Article 00.1.4.

  106. M. Bauer and O. Golinelli, Random incidence matrices: Moments of the spectral density, J. Stat. Phys. 103, 301-307 (2001).

  107. Karin Baur, Nolan Wallach, Nice Parabolic Subalgebras of Reductive Lie Algebras (2004), http://arxiv.org/abs/math/0409295.

  108. Andrew M. Baxter and Ron Umble,

  109. 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.

  110. George I. Bell, Solving Triangular Peg Solitaire [arXiv:math/0703865v4]

  111. George I. Bell, Diamond Solitaire (2007), http://arxiv.org/abs/0711.2749.

  112. 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.

  113. Lourdes Benito, Solutions of the problem of Erd\"os-Sierpi\'nski: sigma(n)=sigma(n+1), (2007), http://arxiv.org/abs/0707.2190.

  114. A. Benjamin, J. Neer, D. Otero and J. A. Sellers, A Probabilistic View of Certain Weighted Fibonacci Sums, to appear in Fibonacci Quarterly.

  115. Moussa Benoumhani, "A Sequence of Binomial Coefficients Related to Lucas and Fibonacci Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.2.1.

  116. Moussa Benoumhani, "The Number of Topologies on a Finite Set", J. Integer Sequences, Volume 9, 2006, Article 06.2.6.

  117. F. Bergeron and F. Gascon, "Counting Young Tableaux of Bounded Height", J. Integer Sequences, Volume 3, 2000, Article 00.1.7.

  118. F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998.

  119. 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 )

  120. Bergeron, N.; Hohlweg, C.; Zabrocki, M., Posets related to the connectivity set of Coxeter groups. J. Algebra 303 (2006), no. 2, 831-846.

  121. 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]

  122. 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.

  123. G. Berkolaiko and J.P. Keating, Two-point spectral correlations for star graphs, J. Phys. A 32 (1999), 7827-7841.

  124. F. R. Bernhart, Catalan, Motzkin and Riordan numbers, Discr. Math., 204 (1999) 73-112.

  125. Antonio Bernini, Filippo Disanto, Renzo Pinzani and Simone Rinaldi, "Permutations Defining Convex Permutominoes", J. Integer Sequences, Volume 10, 2007, Article 07.9.7.

  126. 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.

  127. 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.

  128. M. Bernstein, N. J. A. Sloane and P. E. Wright, On Sublattices of the Hexagonal Lattice, Discrete Math., 170 (1997) 29-39.

  129. Berstel, Jean, Growth of repetition-free words--a review. Theoret. Comput. Sci. 340 (2005), no. 2, 280-290.

  130. Bessenrodt, Christine; Olsson, J. B., A note on Cartan matrices for symmetric groups. Arch. Math. (Basel) 81 (2003), no. 5, 497-504.

  131. A. Betten and D. Betten, Linear Spaces with at Most 12 Points, Journal of Combinatorial Designs 7 (1999), 119-145.

  132. D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.

  133. Robert J. Betts, "Using Bonse's Inequality to Find Upper Bounds on Prime Gaps", J. Integer Sequences, Volume 10, 2007, Article 07.3.8.

  134. 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.

  135. R. Bisdorff, J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph (2007), http://arxiv.org/abs/math/0701647.

  136. A. Bjorner and R. P. Stanley, A Combinatorial Miscellany in ``New directions in mathematics'', Cambridge Univ. Press, to appear. Preprint 1998.

  137. Blanchard, Peter Floodstrand, Pseudo-arithmetic sets and Ramsey theory. J. Combin. Theory Ser. A 106 (2004), no. 1, 49-57.

  138. 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.

  139. R. Blanco, Complexity of Villamayor's algorithm in the monomial case (2007), http://arxiv.org/abs/0704.3416.

  140. P. Blasiak, A. Horzela, K. A. Penson, G. H. E. Duchamp and A. I. Solomon, Boson Normal Ordering via Substitutions and Sheffer-Type Polynomials

  141. P. Blasiak, K. A. Penson and A. I. Solomon, The Boson Normal Ordering Problem and Generalized Bell Numbers

  142. P. Blasiak, K. A. Penson and A. I. Solomon, Dobinski-type relations and the Log-normal distribution

  143. P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, Combinatorial field theories via boson normal ordering

  144. Pawel Blasiak, Karol A. Penson, Allan I. Solomon et al., The general boson normal ordering problem (2004), http://arxiv.org/abs/quant-ph/0402027.

  145. 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).

  146. Bloch, Ethan D., The angle defect for odd-dimensional simplicial manifolds. Discrete Comput. Geom. 35 (2006), no. 2, 311-328.

  147. V. Blondel, Structured Numbers. Properties of a hierarchy of internal operations on binary trees, Acta Informatica, 35, pp. 1-15, 1998. (ps, pdf)

  148. 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.

  149. H. Boas and S. Geller, A Survey of Mathematical Problems, Instructor's Guide.

  150. Florin P. Boca, An AF algebra associated with the Farey tessellation (2005), http://arxiv.org/abs/math/0511505.

  151. J.-P. Bode, Strategien für Aufbauspiele mit Mosaik-Polyominos, Doctoral Dissertation, 2000.

  152. 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.

  153. Manuel Bodirsky, Eric Fusy, Mihyun Kang et al., Enumeration of Unlabeled Outerplanar Graphs (2005), http://arxiv.org/abs/math/0511422.

  154. M. Bodirsky, Clemens Gröpl and Mihyun Kang, Generating Labeled Planar Graphs Uniformly at Random, Theoret. Comput. Sci. 379 (2007), no. 3, 377-386.

  155. Bodirsky, Manuel; Kang, Mihyun, Generating outerplanar graphs uniformly at random. Combin. Probab. Comput. 15 (2006), no. 3, 333-343.

  156. E. Bolker, V. Guillemin and T. Holm, How is a graph like a manifold?, preprint.

  157. Samuel Boissiere, Etienne Mann and Fabio Perroni, Crepant resolutions of weighted projective spaces and quantum deformations (2006), http://arxiv.org/abs/math/0610617.

  158. 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.

  159. 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.

  160. Julius Borcea, Boris Shapiro, Classifying real polynomial pencils (2004), http://arxiv.org/abs/math/0404215.

  161. Olivier Bordellès, "A Note on the Average Order of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.3.3.

  162. 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.

  163. 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.

  164. J. Borwein, Aesthetics for the Working Mathematician, April 2001. [ps pdf]

  165. J. Borwein, The Impact of Technology on the Doing of Mathematics, April 2000. [ps pdf]

  166. J. Borwein and P. Borwein, Some observations on computer aided analysis, Notices Amer. Math. Soc. 39 (1992), 825-829.

  167. J. M. Borwein and P. B. Borwein, Challenges in Mathematical Computing, Computing in Science and Engineering 3 (2001), 48-53. (PostScript , Pdf)

  168. J. M. Borwein and D. M. Bailey, Mathematics by Experiment, Peters, Boston, 2004.

  169. J. M. Borwein, P. R. Borwein and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.

  170. 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.

  171. 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.

  172. J. M. Borwein and K.-K. S. Choi, On the Representations of xy+yz+zx, Experimental Math., 9 (2000), 153-158.

  173. J. M. Borwein and K.-K. S. Choi, On Dirichlet series for sums of squares, The Ramanujan Journal, special issue for Robert Rankin, accepted January 2002. (ps, pdf)

  174. 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.

  175. 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.)

  176. J. M. Borwein and R. M. Corless, Emerging tools for experimental mathematics, Amer. Math. Monthly, 106 (No. 10, 1999), 889-909.

  177. 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.

  178. N. Boston, Explicit Galois Groups of Infinite p-Extensions Unramified at p, preprint.

  179. O. Bottema, The Malfatti problem, Forum Geom. 1, 43-50, (2001).

  180. H. Bottomley, Some Smarandache-type multiplicative sequences, Smarandache Notions Journal, Vol. 13, 2002, pp. 134-139.

  181. 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.

  182. Sadek Bouroubi, "Integer Partitions and Convexity", J. Integer Sequences, Volume 10, 2007, Article 07.6.3.

  183. M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar 2-face maps, Discrete Mathematics, 222 (2000), 1-25.

  184. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees, Proceedings FPSAC02, 133-147, (2002). (PostScript, Pdf)

  185. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.

  186. 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.

  187. M. Bousquet-Mélou and G. Schaeffer, Walks on the slit plane, Probab. Theory Related Fields, 124 (2002), no. 3, 305-344.

  188. 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.

  189. 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]

  190. 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

  191. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János, Einstein metrics on spheres. Ann. of Math. (2) 162 (2005), no. 1, 557-580.

  192. 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.

  193. 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.

  194. 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.

  195. D. M. Bradley, Experimental Mathematics via Inverse Symbolic Computation, Invited Talk, Department of Mathematics and Statistics, University of Maine, Orono, Maine, June 12, 1997.

  196. Brändén, Petter; Mansour, Toufik, Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A 110 (2005), no. 1, 127-145.

  197. 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.

  198. Bremner, Murray R.; Hentzel, Irvin R.; Peresi, Luiz A., Dimension formulas for the free nonassociative algebra. Comm. Algebra 33 (2005), no. 11, 4063-4081.

  199. Y. V. Brezhnev, Uniformization: on the Burnside curve y^2=x^5-x (2001), http://arxiv.org/abs/math/0111150.

  200. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the S_n-module structure of the noncommutative harmonics (2007), http://arxiv.org/abs/0704.1101.

  201. Gunnar Brinkmann and Brendan D. McKay, "Counting Unlabelled Topologies and Transitive Relations", J. Integer Sequences, Volume 8, 2005, Article 05.2.1.

  202. S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for succession rules, Discr. Math., 298 (2005), 142-154.

  203. 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.

  204. D. J. Broadhurst, On the enumeration of irreducible k-fold Euler sums and their roles in knot theory and field theory.

  205. D. J. Broadhurst, Conjectured enumeration of irreducible multiple zeta values, from knots and Feynman diagrams.

  206. D. J. Broadhurst, Conjectured enumeration of Vassiliev invariants.

  207. D. J. Broadhurst, Four-loop Dyson-Schwinger-Johnson anatomy.

  208. D. J. Broadhurst, Solutions by radicals at singular values k_N from new class invariants for N == 3 mod 8, to appear on the arXiv, July 2008

  209. 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).

  210. D. J. Broadhurst and D. Kreimer: Renormalization automated by Hopf algebra.

  211. D. J. Broadhurst and D. Kreimer: Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Pade-Borel resummation.

  212. 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.

  213. 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)

  214. Brodmann, Markus, Castelnuovo-Mumford regularity and degrees of generators of graded submodules. Illinois J. Math. 47 (2003), no. 3, 749-767.

  215. 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.

  216. 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.

  217. Kevin A. Broughan, "The Gcd-Sum Function", J. Integer Sequences, Volume 4, 2001, Article 01.2.2.

  218. Kevin A. Broughan, "Characterizing the Sum of Two Cubes", J. Integer Sequences, Volume 6, 2003, Article 03.4.6.

  219. 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.

  220. 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.

  221. J. Brousek, R. Cada, T. Kaiser, Z. Ryjácek, Diskrétní matematika, Lecture Notes.

  222. A. E. Brouwer, The Enumeration of Locally Transitive Tournaments. Math. Centr. Report ZW138, Amsterdam, April 1980.

  223. 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.

  224. F. Brunault, La fonction 'tau' de Ramanujan, Séminaire des doctorants de l'équipe de théorie des nombres de Chevaleret. (ps, pdf)

  225. 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.

  226. 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.

  227. Grady Bullington, "The Connell Sum Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.2.6.

  228. 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].

  229. Emily Burgunder, Ralf Holtkamp, Partial magmatic bialgebras (2007), http://arxiv.org/abs/0708.4191.

  230. Burstein, Alexander, Restricted Dumont permutations. Ann. Comb. 9 (2005), no. 3, 269-280.

  231. 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.

  232. Alexander Burstein, Sergey Kitaev, Toufik Mansour, Independent sets in certain classes of (almost) regular graphs (2003), http://arxiv.org/abs/math/0310379.

  233. Alexander Burstein and Isaiah Lankham, Restricted Patience Sorting and Barred Pattern Avoidance (2005), http://arxiv.org/abs/math/0512122.

  234. 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)

  235. 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.

  236. C. Caldwell and G. L. Honaker, Jr., "Palindromic prime pyramids," J. Recreational Math., 30:3 (1999-2000) 169-176. [ps, pdf, doc]

  237. 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]

  238. 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.)

  239. 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.

  240. D. Callan, Certificates of Integrality for Linear Binomials, Fibonacci Quarterly, 38 (Aug 2000), 317-325.

  241. David Callan, "A Combinatorial Derivation of the Number of Labeled Forests", J. Integer Sequences, Volume 6, 2003, Article 03.4.7.

  242. Callan, David, A uniformly distributed statistic on a class of lattice paths. Electron. J. Combin. 11 (2004), no. 1, Research Paper 82, 8 pp.

  243. David Callan, "Counting Stabilized-Interval-Free Permutations", J. Integer Sequences, Volume 7, 2004, Article 04.1.8.

  244. David Callan, "A Combinatorial Interpretation for a Super-Catalan Recurrence", J. Integer Sequences, Volume 8, 2005, Article 05.1.8.

  245. David Callan, "A Combinatorial Interpretation of the Eigensequence for Composition", J. Integer Sequences, Volume 9, 2006, Article 06.1.4.

  246. David Callan, A Combinatorial Interpretation of j/n {kn}\choose{n+j} (2006), http://arxiv.org/abs/math/0604471.

  247. David Callan, "On Generating Functions Involving the Square Root of a Quadratic Polynomial", J. Integer Sequences, Volume 10, 2007, Article 07.5.2.

  248. David Callan, Sets, Lists and Noncrossing Partitions (2007), http://arxiv.org/abs/0711.4841.

  249. C. S. Calude, E. Calude and M. J. Dinneen, What is the value of Taxicab(6)?, J. Universal Computer Science, 9 (2003), 1196-1203.

  250. Naiomi T. Cameron and Asamoah Nkwanta, "On Some (Pseudo) Involutions in the Riordan Group", J. Integer Sequences, Volume 8, 2005, Article 05.3.7.

  251. 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.

  252. P. J. Cameron, Counting two-graphs related to trees, Electronic Journal of Combinatorics, Volume 2(1), 1995, R#4.

  253. P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1994 (reprinted 1996).

  254. 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.

  255. 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)

  256. Peter J. Cameron, "Sequences Realized by Oligomorphic Permutation Groups", J. Integer Sequences, Volume 3, 2000, Article 00.1.5.

  257. P. J. Cameron, Homogeneous permutations, Electronic J. Combinatorics 9(2) (2002), #R2 (9pp).

  258. Cameron, Peter J. Research problems from the 19th British Combinatorial Conference. Discrete Math. 293 (2005), no. 1-3, 313-320.

  259. P. J. Cameron, D. A. Gewurz and F. Merola, Product action, Discrete Math., 308 (2008), 386-394.

  260. P. J. Cameron and C. R. Johnson, The number of equivalence patterns of symmetric sign patterns, Discr. Math., 306 (2006), 3074-3077.

  261. P. J. Cameron and D. A. Preece, Primitive lambda-roots, Combinatorics Study Group notes, March 2003.

  262. 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.

  263. Peter Cameron, Thomas Prellberg and Dudley Stark, Asymptotic enumeration of incidence matrices (2005), http://arxiv.org/abs/math/0511008.

  264. Saverio Caminiti and Emanuele G. Fusco, "On the Number of Labeled k-arch Graphs", J. Integer Sequences, Volume 10, 2007, Article 07.7.5.

  265. E. Rodney Canfield, Carla D. Savage and Herbert S. Wilf, Regularly Spaced Subsums of Integer Partitions, Acta Arith. 115 (2004), no. 3, 205-216.

  266. E. Rodney Canfield and Herbert S. Wilf, Counting permutations by their runs up and down (2006), http://arxiv.org/abs/math/0609704.

  267. J. Carlsson and B. H. J. McKellar, SU(N) Glueball Masses in 2+1 Dimensions, hep-lat/0303016, (2003).

  268. 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.

  269. 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.

  270. 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.

  271. Jose Castillo, Other Smarandache type functions

  272. M. Catalani, Polymatrix and generalized polynacci numbers, (2002). arXiv:math.CO/0210201

  273. M. Catalani, Identities for Tribonacci-related sequences, (2002). arXiv:math.CO/0209179

  274. M. Catalani, Sequences related to convergents to square root of rationals, (2003). arXiv:math.NT/0305270

  275. M. Catalani, On the average of triangular numbers, (2003). arXiv:math.NT/0304160

  276. M. Catalani, Sequences related to the Pell generalized equation, (2003). arXiv:math.CO/0304062

  277. N. Cavenagh and P. Lisonek, Planar Eulerian triangulations are equivalent to spherical latin bitrades, J. Combin. Theory, Series A, to appear, 2007.

  278. F. Cazals, Combinatorial properties of one-dimensional arrangements. J. Exp. Math. 6, No.1, 87-94 (1997).

  279. F. Cazals, Combinatorics of Non-Crossing Configurations, Studies in Automatic Combinatorics, Volume II (1997).

  280. F. Cazals, Monomer-Dimer Tilings, Studies in Automatic Combinatorics, Vol. 2, 1997.

  281. Cerin, Zvonko, Some alternating sums of Lucas numbers. Cent. Eur. J. Math. 3 (2005), no. 1, 1-13 .

  282. Zvonko Cerin, "Sums of Squares and Products of Jacobsthal Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.2.5.

  283. Chaichanavong, Panu; Marcus, Brian H. Stabilization of block-type-decodability properties for constrained systems. SIAM J. Discrete Math. 19 (2005), no. 2, 321-344 .

  284. 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).

  285. 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.

  286. Chair, Noureddine, The Waring formula and fusion rings. J. Geom. Phys. 37 (2001), no. 3, 216-228.

  287. Noureddine Chair, Partition Identities From Partial Supersymmetry (2004), http://arxiv.org/abs/hep-th/0409011.

  288. Marc Chamberland, "Binary BBP-Formulae for Logarithms and Generalized Gaussian-Mersenne Primes", J. Integer Sequences, Volume 6, 2003, Article 03.3.7.

  289. Marc Chamberland and Christopher French, "Generalized Catalan Numbers and Generalized Hankel Transformations", J. Integer Sequences, Volume 10, 2007, Article 07.1.1.

  290. A. C. Chan, W. I. Gasarch and C. P. Kruskal, Refined Upper and Lower Bounds for Two-sum. 1997.

  291. Ray Chandler and Eugen J. Ionascu, A characterization of all equilateral triangles in Z^3 (2007), http://arxiv.org/abs/0710.0708.

  292. Shu-Chiuan Chang and Lung-Chi Chen, Spanning forests on the Sierpinski gasket (2006), http://arxiv.org/abs/math-ph/0612083.

  293. 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.

  294. Chapoton, F., Sur le nombre d'intervalles dans les treillis de Tamari. Sém. Lothar. Combin. 55 (2005/06), Art. B55f, 18 pp.

  295. F. Chapoton, Florent Hivert, Jean-Christophe Novelli et al., An operational calculus for the Mould operad (2007), http://arxiv.org/abs/0710.0349.

  296. Alain Chaumont and Tom Müller "All Elite Primes Up to 250 Billion", J. Integer Sequences, Volume 9, 2006, Article 06.3.8.

  297. C. Chauve, Structures arborescentes : problèmes algorithmiques et combinatoires, PHD thesis - LaBRI, Université Bordeaux 1 (2000).

  298. 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.

  299. 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.

  300. Denis Chebikin, Richard Ehrenborg, Pavlo Pylyavskyy et al., Cyclotomic factors of the descent set polynomial (2007), http://arxiv.org/abs/0705.2451.

  301. Hongwei Chen, "Evaluations of Some Variant Euler Sums", J. Integer Sequences, Volume 9, 2006, Article 06.2.3.

  302. Kwang-Wu Chen, "Algorithms for Bernoulli numbers and Euler numbers", J. Integer Sequences, Volume 4, 2001, Article 01.1.6.

  303. Kwang-Wu Chen, "An Interesting Lemma for Regular C-fractions", J. Integer Sequences, Volume 6, 2003, Article 03.4.8.

  304. 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.

  305. William Y. C. Chen, Eva Y. P. Deng, Laura L. M. Yang, Riordan Paths and Derangements (2006), http://arxiv.org/abs/math/0602298.

  306. William Y. C. Chen, Nelson Y. Li, Louis W. Shapiro, The Butterfly Decomposition of Plane Trees (2005), http://arxiv.org/abs/math/0511045.

  307. 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.

  308. 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.

  309. William Y. C. Chen, Susan Y. J. Wu and Catherine Yan, Linked Partitions and Linked Cycles (2006), http://arxiv.org/abs/math/0607719.

  310. William Y. C. Chen, Sherry H. F. Yan, Laura L. M. Yang, Weighted 2-Motzkin Paths (2004), http://arxiv.org/abs/math/0410200.

  311. 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.

  312. Otfried Cheong, Mira Lee, The Hadwiger Number of Jordan Regions is Unbounded (2007), http://arxiv.org/abs/cs/0702079.

  313. 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.

  314. P. Z. Chinn, R. Grimaldi and S. Heubach, Rises, Levels, Drops and "+" Signs in Compositions, to appear in Fibonacci Quarterly.

  315. 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.

  316. Phyllis Chinn, Ralph Grimaldi and Silvia Heubach, "Tiling with L's and Squares", J. Integer Sequences, Volume 10, 2007, Article 07.2.8.

  317. Phyllis Chinn and Silvia Heubach, "Integer Sequences Related to Compositions without 2's", J. Integer Sequences, Volume 6, 2003, Article 03.2.3.

  318. P. Z. Chinn and S. Heubach, Compositions of n with no occurrence of k, preprint (submitted to Congressus Numerantium).

  319. P. Z. Chinn and S. Heubach, (1,k)-Compositions, preprint (submitted to Congressus Numerantium).

  320. P. Z. Chinn and D. R. Oliver, Some Results Inspired by Covering Rectangles with 1x1 and 1x3 Rectangles, Congr. Numerantium 122, 119-124 (1996).

  321. 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.

  322. 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.

  323. Stirling Chow and Frank Ruskey, "Minimum Area Venn Diagrams Whose Curves Are Polyominoes", Mathematics Magazine, Vol. 80, (2007) pp. 91-103.

  324. 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.]

  325. Julie Christophe, Jean-Paul Doignon and Samuel Fiorini, "Counting Biorders", J. Integer Sequences, Volume 6, 2003, Article 03.4.3.

  326. 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.

  327. V. Chvatal, Notes on the Kolakoski Sequence, DIMACS Technical Report 93-84, December 1993.

  328. 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.

  329. 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.

  330. Johann Cigler, Some results and conjectures about recurrence relations for certain sequences of binomial sums (2006), http://arxiv.org/abs/math.CO/0611189.

  331. A. Claesson, Generalized Pattern Avoidance, FPSAC01, European Journal of Combinatorics 22 (2001), 961-971. (PostScript, Pdf)

  332. 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.

  333. 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)

  334. A. Claesson and T. Mansour, Enumerating Permutations Avoiding a Pair of Babson-Steingrímsson Patterns, (ps, pdf) Ars Combin. 77 (2005), 17-31.

  335. A. Claesson and T. K. Petersen, Conway's Napkin Problem, American Mathematical Monthly, 114 (No. 3, 2007), 217-231.

  336. Lieven Clarisse, Sibasish Ghosh, Simone Severini et al., Entangling Power of Permutations (2005), http://arxiv.org/abs/quant-ph/0502040.

  337. Lane Clark, "An Asymptotic Expansion for the Catalan-Larcombe-French Sequence", J. Integer Sequences, Volume 7, 2004, Article 04.2.1.

  338. Benoit Cloitre, Chemins dans un tableau arithmetique, 2007.

  339. 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.

  340. 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.

  341. A. M. Cohen, H. Cuypers, E. Reinaldo Barreiro and H. Sterk, Interactive Mathematical Documents on the Web, to appear in Proceedings of Dagstuhl Conference.

  342. D. Cohen, Machine Head, New Scientist, 24 Feb 2001, Vol. 169, Number 2279, pp. 26-29. (Article about artificial intelligence that mentions the database.)

  343. G. L. Cohen and D. E. Iannucci, "Derived Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.1.1.

  344. 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.

  345. C. Coker, A family of eigensequences, Discrete Math., 282 (2004), 249-250.

  346. Coker, Curtis, Enumerating a class of lattice paths. Discrete Math. 271 (2003), no. 1-3, 13-28.

  347. S. Cokus, Summing Sums Symbolically: How Computers Revolutionized the Field of Combinatorial Identities, ACMS Seminar, Winter Quarter 2001.

  348. C. S. Collberg and T. A. Proebsting, AlgoVista - A Search Engine for Computer Scientists, Arizona Computer Science, Technical Report, 2000.

  349. C. S. Collberg and T. A. Proebsting, Problem Classification using Program Checking, Fun with Algorithms 2, May 2001.

  350. Collberg, Christian S.; Proebsting, Todd A., Problem identification using program checking. Discrete Appl. Math. 144 (2004), no. 3, 270-280.

  351. Simon Colton, "Refactorable Numbers - A Machine Invention", J. Integer Sequences, Volume 2, 1999, Article 99.1.2.

  352. S. Colton, Theory Formation Applied to Learning, Discovery and Problem Solving, presented at Machine Intelligence 17, Bury St. Edmunds, July 2000.

  353. 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.

  354. S. Colton, Automated Theory Formation Applied to Four Learning Tasks, Linkoping Electronic Articles in Computer and Information Science, Vol. 5 (2000): nr 38.

  355. 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.

  356. S. Colton, Mathematics - a new domain for datamining?, Proc IJCAI-01, Seattle, 2001

  357. Colton, Simon, Automated conjecture making in number theory using HR, Otter and Maple. J. Symbolic Comput. 39 (2005), no. 5, 593-615.

  358. 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)

  359. S. Colton, A. Bundy and T. Walsh, Automated Discovery in Pure Mathematics, Proceedings of the ECAI-98 workshop on machine discovery, 1998.

  360. 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)

  361. 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.

  362. 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)

  363. S. Colton, A. Bundy and T. Walsh, Automatic identification of mathematical concepts, Proc ICML-2000, Stanford, CA, 2000.

  364. S. Colton and L. Dennis, The NumbersWithNames Program, 7th International Symposium on Artificial Intelligence and Mathematics, 2002.

  365. 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.

  366. L. Comtet, Advanced Combinatorics, Reidel, 1974.

  367. Matthew M. Conroy, "A Sequence Related to a Conjecture of Schinzel", J. Integer Sequences, Volume 4, 2001, Article 01.1.7.

  368. J. H. Conway, "On Happy Factorizations", J. Integer Sequences, Volume 1, 1998, Article 98.1.1.

  369. J. H. Conway, E. M. Rains and N. J. A. Sloane, On the Existence of Similar Sublattices, Canad. J. Math., 51 (1999), 1300-1306.

  370. J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389.

  371. M. Cook and M. Kleber, Tournament sequences and Meeussen sequences, Electronic Journal of Combinatorics, Vol. 7(1) 2000, article #R44.

  372. C. Cooper and M. Wiemann, Divisibility of an F-L Type Convolution, Applications of Fibonacci Numbers, Volume 9.

  373. J. Copeland and J. Haemer, Odds and Ends, SunExpert, May 1999, pp. 50-53.

  374. J. Copeland and J. Haemer, High-School Algebra, Backwards, SunExpert, Feb 2001, pp. 34-37.

  375. R. M. Corless, Symbolic Computation in Nonlinear Dynamics, Proceedings of Let's Face Chaos Through Nonlinear Dynamics, Ljubljana, Slovenia, 1993.

  376. Sylvie Corteel and Pawe Hitczenko, "Generalizations of Carlitz Compositions", J. Integer Sequences, Volume 10, 2007, Article 07.8.8.

  377. G. E. Cossali, "A Common Generating Function for Catalan Numbers and Other Integer Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.1.8.

  378. M. A. Covington, The number of distinct alignments of two strings, (pdf, ps), Journal of Quantitative Linguistics, 2004, to appear.

  379. D. A. Cox and J. Shurman, Geometry and number theory on clovers, Amer. Math. Monthly, 112 (2005), 682-704.

  380. Michael Cuntz, Integral modular data and congruences (2006), http://arxiv.org/abs/math/0611233.

  381. 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

  382. 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.

  383. 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.

  384. P. Cvitanovic', Group Theory, webbook.

  385. D'Andrea, Carlos; Hare, Kevin G. On the height of the Sylvester resultant. Experiment. Math. 13 (2004), no. 3, 331-341.

  386. 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.

  387. H. M. Damm, Prüfziffernsysteme über Quasigruppen, Diplomarbeit Univ. Marburg, 1998.

  388. Damm, Michael, Check digit systems over groups and anti-symmetric mappings. Arch. Math. (Basel) 75 (2000), no. 6, 413-421.

  389. Thierry Dana-Picard:, Explicit closed forms for parametric integrals, Int. J. Math. Ed. Sci. Tech. 35 (3) (2004), 456-467.

  390. Thierry Dana-Picard:, Parametric integrals and Catalan numbers, Int. J. Math. Ed. Sci. Tech. 36 (4), 410-414.

  391. Thierry Dana-Picard, "Sequences of Definite Integrals, Factorials and Double Factorials", J. Integer Sequences, Volume 8, 2005, Article 05.4.6.

  392. Lars Eirik Danielsen, On Self-Dual Quantum Codes, Graphs and Boolean Functions (2005), http://arxiv.org/abs/quant-ph/0503236.

  393. Danielsen, Lars Eirik; Gulliver, T. Aaron; Parker, Matthew G. Aperiodic propagation criteria for Boolean functions. Inform. and Comput. 204 (2006), no. 5, 741-770.

  394. 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.

  395. Lars Eirik Danielsen, 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.

  396. Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes (2007), http://arxiv.org/abs/0710.2243.

  397. 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.

  398. 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]

  399. 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)

  400. R. J. M. Dawson, Tilings of the sphere with isosceles triangles, Discrete Comput. Geom. 30 (2003), 467--487.

  401. 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.

  402. de Luca, Aldo; De Luca, Alessandro, Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362 (2006), no. 1-3, 282-300.

  403. S. De Smedt, On Sloane's Sequence 1484, Saitama Math. J. 15 (1997), 9-13.

  404. 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.

  405. 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.

  406. 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.

  407. J.-P. Delahaye, Inventiones à suivre, Pour la Science, No. 353, March 2007.

  408. J.-P. Delahaye, L'arithmetique geometrique, Pour la Science, No. 360, October 2007.

  409. M. Delest, Polyominoes and animals : some recent results, J. of Math. Chem., 8 (1991), 3-18.

  410. M. Delest, Combinatorics, information vizualisation and algebraic languages, Invited talk, EWM'99.

  411. Giacomo Della Riccia, "Converting Between Generalized Bell, Lah, Stirling and Tanh Numbers", J. Integer Sequences, Volume 9, 2006, Article 06.3.5.

  412. A. Denise and R. Simion, Two combinatorial statistics on Dyck paths, Discrete Math. 137 (1995), 155-176.

  413. A. Denise, M. Vasconcellos and D. J. A. Welsh, The random planar graph, Congressus Numerantium 113 (1996) 61-79.

  414. S. C. Dent and J. Siemons, On a conjecture of Foulkes. J. Algebra 226 (2000), no. 1, 236-249.

  415. Nachum Dershowitz, Mitchell A. Harris and Guan-Shieng Huang, Enumeration Problems Related to Ground Horn Theories (2006), http://arxiv.org/abs/cs/0610054.

  416. E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999), 167-202.

  417. E. Deutsch, Enumerating symmetric directed convex polyominoes, Discrete Math., 280 (2004), 225-231.

  418. E. Deutsch, Ordered trees with prescribed root degrees, node degrees and branch lengths. Discrete Math. 282 (2004), no. 1-3, 89-94.

  419. 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.

  420. Deutsch, Emeric; Ferrari, Luca; Rinaldi, Simone, Production matrices. Adv. in Appl. Math. 34 (2005), no. 1, 101-122.

  421. 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.

  422. 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.

  423. E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory, 117 (2006), 191-215.

  424. 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 ..."

  425. E. Deutsch and L. Shapiro, A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Math., 256 (2002), 655-670.

  426. Jean Dezert, Florentin Smarandache, On the Generation of Hyper-powersets for the DSmT (2003), http://arxiv.org/abs/math/0309431.

  427. P. Di Francesco, O. Golinelli and E. Guitter, Meander, folding and arch statistics..

  428. 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.

  429. 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.

  430. Ayhan Dil, Veli Kurt and Mehmet Cenkci, "Algorithms for Bernoulli and Related Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.4.

  431. Karl Dilcher, "Congruences for a Class of Alternating Lacunary Sums of Binomial Coefficients", J. Integer Sequences, Volume 10, 2007, Article 07.10.1.

  432. 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.

  433. 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.

  434. Dragomir Z. Djokovic and Benjamin H. Smith, Quaternionic matrices: Unitary similarity, simultaneous triangularization and some trace identities (2007), http://arxiv.org/abs/0709.0513.

  435. 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).

  436. Jean-Paul Doignon and Anthony Labarre, "On Hultman Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.6.2.

  437. Tomislav Doli, "Maximum Product Over Partitions Into Distinct Parts", J. Integer Sequences, Volume 8, 2005, Article 05.5.8.

  438. Michael Domaratzki, "Combinatorial Interpretations of a Generalization of the Genocchi Numbers", J. Integer Sequences, Volume 7, 2004, Article 04.3.6.

  439. Doust, Ian; Hirschhorn, Michael D.; Ho, Jocelyn, Trigonometric identities, linear algebra and computer algebra. Amer. Math. Monthly 112 (2005), no. 2, 155-164.

  440. 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.

  441. Dan Drake, The combinatorics of associated Hermite polynomials (2007), http://arxiv.org/abs/0709.0987.

  442. 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.

  443. 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)

  444. B.-S. Du, Congruence identities arising from dynamical systems, Appl. Math. Letters, 12 (1999), 115-119.

  445. Harvey Dubner, "Carmichael Numbers of the Form (6m+1)(12m+1)(18m+1)", J. Integer Sequences, Volume 5, 2002, Article 02.2.1.

  446. Harvey Dubner, "Twin Prime Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.4.2.

  447. Harvey Dubner and Tony Forbes, "Prime Pythagorean Triangles", J. Integer Sequences, Volume 4, 2001, Article 01.2.3.

  448. 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.

  449. Gerard Henry Edmond Duchamp, Jean-Gabriel Luque, Jean-Christophe Novelli et al., Hopf algebras of diagrams (2007), http://arxiv.org/abs/0710.5661.

  450. 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.

  451. Enrica Duchi, Simone Rinaldi, Gilles Schaeffer, The number of Z-convex polyominoes (2006), http://arxiv.org/abs/math/0602124.

  452. 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.

  453. Duchi, Enrica; Fedou, Jean-Marc; Rinaldi, Simone, From object grammars to ECO systems. Theoret. Comput. Sci. 314 (2004), no. 1-2, 57-95.

  454. P. Duchon, Q-grammaires: un outil pour l'énumération, PHD thesis, Université Bordeaux 1 (1998).

  455. Philippe Duchon, On the link pattern distribution of quarter-turn symmetric FPL configurations (2007), http://arxiv.org/abs/0711.2871.

  456. P. Duchon, P. Flajolet, G. Louchard and G. Schaeffer, Random Sampling from Boltzmann Principles, Proc. ICALP'2002, Lecture Notes in Computer Science, July 2002.

  457. 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.

  458. St\'ephane Dugowson, Representation of finite connective spaces (2007), http://arxiv.org/abs/0707.2542.

  459. 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.

  460. W. M. B. Dukes, On a Unimodality Conjecture in Matroid Theory, Discrete Math. Theor. Comput. Sci., Volume 5 n° 1 (2002), pp. 181-190.

  461. 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.)

  462. 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.

  463. E. Early, Chain Lengths in the Dominance Lattice, 2002. Presented at FPSAC '03.

  464. 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.

  465. 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).

  466. 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.

  467. 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.

  468. 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.

  469. 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.

  470. Ekhad, Shalosh B.; Zeilberger, Doron, Proof of Conway's lost cosmological theorem. Electron. Res. Announc. Amer. Math. Soc. 3 (1997), 78-82 .

  471. Sergi Elizalde, Generating trees for permutations avoiding generalized patterns (2007), http://arxiv.org/abs/0707.4633.

  472. Sergi Elizalde, Toufik Mansour, Restricted Motzkin permutations, Motzkin paths, continued fractions and Chebyshev polynomials (2006), http://arxiv.org/abs/math/0610237.

  473. Elkies, Noam D. New directions in enumerative chess problems. Electron. J. Combin. 11 (2004/06), no. 2, Article 4, 14 pp.

  474. N. D. Elkies and R. P. Stanley, The mathematical knight, Math. Intelligencer, 25 (No. 1, 2003), 22-34. (PostScript, Pdf)

  475. G. Ellis and F. Lehmann, Exploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval, ICCS 1994, 293-310.

  476. Nathaniel D. Emerson, "A Family of Meta-Fibonacci Sequences Defined by Variable-Order Recursions", J. Integer Sequences, Volume 9, 2006, Article 06.1.8.

  477. N. Eriksen, Expected number of inversions after a sequence of random adjacent transpositions - an exact expression , Discr. Math., 298 (2005), 155-168.

  478. T. Etzion, On the stopping redundancy of Reed-Muller codes, arXiv:cs.IT/0511056, IEEE Trans. Inform. Theory 52 (2006), no. 11, 4867-4879.

  479. Eu, Sen-Peng; Fu, Tung-Shan, A simple proof of the Aztec diamond theorem. Electron. J. Combin. 12 (2005), Research Paper 18, 8 pp.

  480. 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.

  481. Eu, Sen-Peng; Liu, Shu-Chung; Yeh, Yeong-Nan, Odd or even on plane trees. Discrete Math. 281 (2004), no. 1-3, 189-196.

  482. 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.

  483. 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.

  484. G. Everest, Zsigmondy's Theorem for Elliptic Curves, 2002.

  485. 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.

  486. G. Everest, A. van der Poorten, I. Shparlinski and T. Ward , Recurrence Sequences, Amer. Math. Soc., 2003.

  487. 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.

  488. 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.

  489. M. Farrokhi D. G., "Some Remarks On the Equation Fn = kFm In Fibonacci Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.5.7.

  490. Greg Fee, Simon Plouffe, An efficient algorithm for the computation of Bernoulli numbers (2007), http://arxiv.org/abs/math/0702300.

  491. Andrew Feist, Fun with the (n) function.

  492. 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.

  493. Felsner, Stefan; Trotter, William T., Posets and planar graphs. J. Graph Theory 49 (2005), no. 4, 273-284.

  494. Emmanuel Ferrand, "Deformations of the Taylor Formula", J. Integer Sequences, Volume 10, 2007, Article 07.1.7.

  495. 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.

  496. 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.

  497. L. Ferrari, E. Pergola, R. Pinzani and S. Rinaldi, Jumping succession rules and their generating functions, Discrete Math., 271 (2003), 29-50.

  498. S. R. Finch, Mathematical Constants, Cambridge University Press (to appear), 2003. (Sample Essays and Supplementary Materials)

  499. S. R. Finch, Idempotents and Nilpotents Modulo n (arXiv: math.NT/0605019)

  500. Steven Finch, Powers of Euler's q-Series, (arXiv: math.NT/0701251).

  501. Steven Finch and Pascal Sebah, Squares and Cubes Modulo n, (arXiv: math.NT/0604465).

  502. S. Finch, P. Sebah and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle (arXiv:0802.2654)

  503. 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.

  504. 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.

  505. Fishburn, Peter C.; Reeds, James A. Counting split semiorders. Order 18 (2001), no. 2, 119-128.

  506. P. Flajolet, A Problem in Statistical Classification Theory, Studies in Automatic Combinatorics, Volume I (1996).

  507. P. Flajolet, Enumerating alcohols and other classes of chemical moleculs, an example of Polya's theory , Studies in Automatic Combinatorics, Volume I (1996).

  508. P. Flajolet, Balls and Urns, Etc., Studies in Automatic Combinatorics, Volume I (1996).

  509. 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.

  510. 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.

  511. 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.

  512. 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.)

  513. 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.)

  514. P. Flajolet and B. Salvy, Computer algebra libraries for combinatorial structures. Journal of Symbolic Computation, vol. 20, no. 5-6, 1995, pages 653-671.

  515. 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.

  516. P. Flajolet and R. Sedgewick, Analytic Combinatorics--Symbolic Combinatorics, 186p.+viii, May 2002.

  517. Anthony Flatters, Primitive Divisors of some Lehmer-Pierce Sequences (2007), http://arxiv.org/abs/0708.2190.

  518. 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.

  519. 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).

  520. Foata, D. and Krattenthaler, C., Graphical Major Indices, II, Seminaire Lotharingien de Combinatoire, B34k, 16 pp., 1995.

  521. D. Foata and D. Zeilberger, The graphical major index, J. Comput. Applied Math (special issue on q-series) 68 (1996) 79-101.

  522. 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)

  523. Foissy, L., Finite-dimensional comodules over the Hopf algebra of rooted trees. J. Algebra 255 (2002), no. 1, 89-120.

  524. Fomin, Sergey; Reading, Nathan, Generalized cluster complexes and Coxeter combinatorics. Int. Math. Res. Not. 2005, no. 44, 2709-2757.

  525. Stefan Forcey, Convex Hull Realizations of the Multiplihedra (2007), http://arxiv.org/abs/0706.3226.

  526. A. S. Fraenkel, Heap games, numeration systems and sequences

  527. A. S. Fraenkel, Arrays, numeration systems and Frankenstein games, FUN with algorithms (Elba, 1998). Theoret. Comput. Sci. 282 (2002), no. 2, 271-284.

  528. 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.

  529. A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004.

  530. 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.

  531. 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.

  532. J. Freeman, MetaMix: Between Unity and Collaboration.

  533. W. Freeman, A method for the compact and efficient encoding of ordinal primes, YCS technical report, 2003.

  534. Darrin D. Frey and James A. Sellers, "Jacobsthal Numbers and Alternating Sign Matrices", J. Integer Sequences, Volume 3, 2000, Article 00.2.3.

  535. 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.

  536. Peter J. Freyd, Core algebra revisited, Theoretical Computer Science, 375 (2007), Issues 1-3, 193-200.

  537. Erich Friedman and Mike Keith, "Magic Carpets", J. Integer Sequences, Volume 3, 2000, Article 00.2.5.

  538. A. Frosini and S. Rinaldi, "On the Sequence A079500 and Its Combinatorial Interpretations", J. Integer Sequences, Volume 9, 2006, Article 06.3.1.

  539. Fusy, Éric, Counting d-polytopes with d+3 vertices. Electron. J. Combin. 13 (2006), no. 1, Research Paper 23, 25 pp.

  540. Jozsef Garai, Analytical Solution Describing the Periodicity of the Elements in the Periodic System (2007), http://arxiv.org/abs/physics/0703231.

  541. Mariano Garcia, "A Million New Amicable Pairs", J. Integer Sequences, Volume 4, 2001, Article 01.2.6.

  542. 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.]

  543. Skip Garibaldi, "Somewhat more than governors need to know about trigonometry", Mathematics Magazine, vol. 81, No. 3, (2008) pp. 191-200.

  544. David Garth and Adam Gouge, "Affinely Self-Generating Sets and Morphisms", J. Integer Sequences, Volume 10, 2007, Article 07.1.5.

  545. David Garth, Donald Mills and Patrick Mitchell, "Polynomials Generated by the Fibonacci Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.6.8.

  546. Daniel L. Geisler, Combinatorics of Iterated Functions

  547. Ferenc Gerlits, The Euler characteristic of graph complexes via Feynman diagrams (2004), http://arxiv.org/abs/math/0412094.

  548. 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.

  549. 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.

  550. 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.

  551. Gewurz, Daniele A.; Merola, Francesca, Cycle action on treelike structures. J. Algebraic Combin. 20 (2004), no. 3, 301-310.

  552. Gewurz, Daniele A.; Merola, Francesca, Cycle action on treelike structures. J. Algebraic Combin. 22 (2005), no. 1, 105-114.

  553. Alessandro Ghigi and J\'anos Koll\'ar, Kaehler-Einstein metrics on orbifolds and Einstein metrics on spheres (2005), http://arxiv.org/abs/math/0507289.

  554. Alexandru Gica and Laurentiu Panaitopol, "On Obláth's Problem", J. Integer Sequences, Volume 6, 2003, Article 03.3.5.

  555. Jan de Gier and Bernard Nienhuis, Brauer loops and the commuting variety (2004), http://arxiv.org/abs/math/0410392.

  556. Dion Gijswijt and Pieter Moree, On a set-theoretic invariant (2003), http://arxiv.org/abs/math/0309318.

  557. 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.

  558. J. D. Gilbey, Permutation Group Algebras.

  559. J. D. Gilbey,Permutation Group Algebras and Parking Functions, PHD thesis, 2002.

  560. Gimbel, John; Zhang, Ping, Degree-continuous graphs. Czechoslovak Math. J. 51(126) (2001), no. 1, 163-171.

  561. James Gleick, Faster, Vintage Books, NY, 2000 (see p. 309).

  562. Goddard, Wayne; Kanakadandi, Kiran, Orientation distance graphs revisited. Discuss. Math. Graph Theory 27 (2007), no. 1, 125-136.

  563. 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.

  564. M. Göbel, Rewriting techniques and degree bounds for higher order symmetric polynomials, Appl. Algebra Engrg. Comm. Comput. 9 (1999), no. 6, 559-573.

  565. M. Göbel and H. Kredel, Reduction of permutation-invariant polynomials: A noncommutative case study, Inform. and Comput. 175 (2002), 158-170.

  566. 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.

  567. O. Golinelli, Asymptotic behavior of two-terminal series-parallel networks, Submitted to J. Phys. A.

  568. Goupil, Alain; Chauve, Cedric, Combinatorial operators for Kronecker powers of representations of G_n. Sém. Lothar. Combin. 54 (2005/06), Art. B54j, 13 pp.

  569. 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.

  570. Alain Goupil and Cedric Chauve, Combinatorial operators for Kronecker powers of representations of S_n (2005), http://arxiv.org/abs/math/0503307.

  571. X. Gourdon and B. Salvy, Effective asymptotics of linear recurrences with rational coefficients. Discrete Mathematics, vol. 153, no. 1-3, 1996, pages 145-163.

  572. 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.

  573. Grabner, Peter J.; Knopfmacher, Arnold, Analysis of some new partition statistics. Ramanujan J. 12 (2006), no. 3, 439-454.

  574. Gracia-Saz, Alfonso, The symbol of a function of a pseudo-differential operator. Ann. Inst. Fourier (Grenoble) 55 (2005), no. 7, 2257-2284.

  575. R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994.

  576. 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

  577. R. L. Graham, J. C. Lagarias, C. L. Mallows, A. R. Wilks and C. H. Yan, Apollonian Circle Packings: Number Theory

  578. 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.

  579. W. S. Gray and Y. Li, Generating Series for Interconnected Analytic Nonlinear Systems, SIAM J. Control Optim. 44 (2005), no. 2, 646-672 .

  580. 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.

  581. R. Grimaldi and S. Heubach, Binary Strings without Odd Runs of Zeros, to appear in Ars Combinatoria.

  582. Uwe Grimm, "Improved Bounds on the Number of Ternary Square-Free Words", J. Integer Sequences, Volume 4, 2001, Article 01.2.7.

  583. R. E. Griswold, Drafting with Sequences, Documents on Weaving, Textiles and Related Topics Created for On-Line Publication, July 1999.

  584. R. E. Griswold, Patterns from Term-Replication Sequences, Documents on Weaving, Textiles and Related Topics Created for On-Line Publication, March 2002.

  585. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), Recurrence Relations, The Icon Analyst 59, April 2000.

  586. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), Variations on Versum Sequences, The Icon Analyst 57, December 1999.

  587. R. E. Griswold, M. T. Griswold and G. M. Townsend (Editors), The Encyclopedia of Integer Sequences, The Icon Analyst 56, October 1999.

  588. 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.

  589. C. W. Groetsch and K. R. Meyer, Book Reviews, SIAM Review 38 (2) (1996) 333-337

  590. R. W. Grosse-Kunstleve, Zeolites, Frameworks, Coordination Sequences and Encyclopedia of Integer Sequences

  591. 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.

  592. K. Grudzinski and B. G. Wybourne, Symplectic models of n-particle systems, Rept. Math. Phys. 38, 251-266 (1996).

  593. 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.

  594. J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

  595. N. S. S. Gu, N. Y. Li and T. Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221.

  596. O. Guibert, Combinatoire des permutations à motifs exclus en liaison avec mots, cartes planaires et tableaux de Young, PHD thesis, Université Bordeaux 1 (1995).

  597. O. Guibert and T. Mansour, Restricted 132-involutions, Séminaire Lothaningien de Combinatorica 48 (2002), Article B48a.

  598. Olivier Guibert and Sylvain Pelat-Alloin, Extending Fine sequences: a link with forbidden patterns (2005), http://arxiv.org/abs/math/0507408.

  599. Guibert, O.; Pergola, E. Enumeration of vexillary involutions which are equal to their mirror/complement. Discrete Math. 224 (2000), no. 1-3, 281-287.

  600. Guillera, J., A class of conjectured series representations for 1/pi. Experiment. Math. 15 (2006), no. 4, 409-414.

  601. T. A. Gulliver, Sequences from squares of integers, Int. Math. J. 1 (2002), no. 4, 323-332.

  602. T. A. Gulliver, Sequences from cubes of integers, Int. Math. J. 4 (2003), 439-445.

  603. Robert M. Guralnick and Martin Lorenz, Orders of Finite Groups of Matrices (2005), http://arxiv.org/abs/math/0511191.

  604. R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.

  605. R. K. Guy, Reviews, Am. Math. Monthly 104 (2) (1997) 180-184.

  606. Richard K. Guy, "Catwalks, Sandsteps and Pascal Pyramids", J. Integer Sequences, Volume 3, 2000, Article 00.1.6.

  607. R. K. Guy, C. Krattenthaler and B. E. Sagan, Lattice paths, reflections and dimension-changing bijections, Ars Combin. 34 (1992), 3-15.

  608. R. K. Guy and W. O. J. Moser, Numbers of subsequences without isolated odd members. Fibonacci Quarterly, 34, No.2, 152-155 (1996).

  609. 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.

  610. 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.

  611. Haase, Christian; Melnikov, Ilarion V. The reflexive dimension of a lattice polytope. Ann. Comb. 10 (2006), no. 2, 211-217.

  612. Jan Hagberg, Centrality Testing and the Distribution of the Degree Variance in Bernoulli Graphs, International Sunbelt Social Network Conference, April 2001.

  613. 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.

  614. 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)

  615. L. Halbeisen and N. Hungerbuehler, Dual form of combinatorial problems and Laplace techniques, The Fibonacci Quarterly 38 (2000) 395-407. (ps, pdf)

  616. Lorenz Halbeisen and Saharon Shelah, Consequences of arithmetic for set theory, The Journal of Symbolic Logic, vol. 59 (1994), pp. 30-40. (ps, pdf )

  617. R. W. Hall and P. Klingsberg, Asymmetric rhythms and tiling canons, Amer. Math. Monthly, 113 (2006), 887-896.

  618. P. Hansen, How Far Should, Is And Could Be Conjecture-Making Automated in Graph Theory?, Les Cahiers du GERAD, August 2002. (ps, pdf)

  619. 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)

  620. C. R. H. Hanusa, A Generalized Binet's Formula for kth Order Linear Recurrences. A Markov Chain Approach, Math Senior Thesis, April 2001.

  621. 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.

  622. B. Hao, Fractals from genomes: exact solutions of a biology-inspired problem, Physica A282 (2000) 225-246.

  623. 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).

  624. B. Hao, H. Xie, Z. Yu and G. Chen, Factorisable language: From dynamics to complete genomes, Physica A288 (2000) 10-20.

  625. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.

  626. 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)

  627. M. Harborth, Strukturuntersuchungen für Shop-Scheduling-Probleme: Anzahlprobleme, potentielle Optimalität und neue Enumerationsalgorithmen, PhD Thesis, Otto-von-Guericke-Universität Magdeburg, 1999.

  628. K. Hare, Multisectioning, Rational Poly-Exponential Functions and Parallel Computation, M.Sc. Thesis, February 2001. (PostScript , Pdf)

  629. Kevin G. Hare and Soroosh Yazdani, "Further Results on Derived Sequences", J. Integer Sequences, Volume 6, 2003, Article 03.2.7.

  630. T. Harju and D. Nowotka, Counting bordered and primitive words with a fixed weight, Theoret. Comput. Sci. 340 (2005), no. 2, 273-279.

  631. 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)

  632. M. Harris and N. Dershowitz, Ordered Construction Of Combinatorial Objects, preprint.

  633. J. Harrison, Isolating critical cases for reciprocals using integer factorization, ARITH-16, June 2003. (ps, pdf)

  634. Rebecca Hartman-Baker, The Diffusion Equation Method for Global Optimization and Its Application to Magnetotelluric Geoprospecting

  635. Mehdi Hassani, "Derangements and Applications", J. Integer Sequences, Volume 6, 2003, Article 03.1.2.

  636. Mehdi Hassani, Approximation of the Multiplication Table Function (2006), http://arxiv.org/abs/math/0603644.

  637. B. Hayes, A Question of Numbers, in American Scientist.

  638. A. Healy and S. Toub, Efficient Mesh Licensing, Computer Science 276r, Harvard University, May 2001.

  639. 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 .

  640. Gottfried Helms, Bell Numbers, 2008.

  641. J. A. Hendrickson, Jr., On the enumeration of rectangular (0,1)-matrices, Journal of Statistical Computation and Simulation, 51 (1995), 291-313.

  642. A. Hendriks, Computations in Propositional Logic, PHD thesis, 1996.

  643. 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.

  644. Sven Herrmann, Genocchi Numbers and f-Vectors of Simplicial Balls (2007), http://arxiv.org/abs/math/0702172.

  645. Hetyei, Gábor, Central Delannoy numbers and balanced Cohen-Macaulay complexes. Ann. Comb. 10 (2006), no. 4, 443-462.

  646. 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.

  647. Heubach, Silvia; Mansour, Toufik, Avoiding patterns of length three in compositions and multiset permutations. Adv. in Appl. Math. 36 (2006), no. 2, 156-174.

  648. Heuberger, Clemens; Prodinger, Helmut, On alpha-greedy expansions of numbers. Adv. in Appl. Math. 38 (2007), no. 4, 505-525.

  649. Dean Hickerson, "Counting Horizontally Convex Polyominoes", J. Integer Sequences, Volume 2, 1999, Article 99.1.8.

  650. Dean Hickerson and Michael Kleber, "Reducing a Set by Subtracting Squares", J. Integer Sequences, Volume 2, 1999, Article 99.1.4.

  651. Hikami, Kazuhiro, Volume conjecture and asymptotic expansion of q-series. Experiment. Math. 12 (2003), no. 3, 319-337.

  652. Hindman, Neil; Jordan, Henry, Measures of sum-free intersecting families. New York J. Math. 13 (2007), 97-106 .

  653. 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.

  654. 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.

  655. 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.

  656. F. Hivert, J.-C. Novelli and J.-Y. Thibon, The Algebra of Binary Search Trees, Theoretical Computer Science, 339 (2005), 129-165.

  657. F. Hivert, J.-C. Novelli and J.-Y. Thibon, Commutative combinatorial Hopf algebras

  658. Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon, Trees, functional equations and combinatorial Hopf algebras (2007), http://arxiv.org/abs/math/0701539.

  659. 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.

  660. 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.

  661. 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.

  662. M. F. Hobart and J. D. H. Smith, Vector lattices and rooted trees, Alg. Univ. 34 (1995), 110-117.

  663. M. E. Hoffman, Combinatorics of rooted trees and Hopf algebras, Trans. AMS 355 (2003), 3795-3811.

  664. T. Hogg, Single-Step Quantum Search Using Problem Structure.

  665. Ralf Holtkamp, On Hopf algebra structures over operads (2004), http://arxiv.org/abs/math/0407074.

  666. Holtkamp, Ralf, On Hopf algebra structures over free operads. Adv. Math. 207 (2006), no. 2, 544-565.

  667. 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.

  668. Hone, A. N. W. Elliptic curves and quadratic recurrence sequences. Bull. London Math. Soc. 37 (2005), no. 2, 161-171.

  669. A. N. W. Hone, Diophantine non-integrability of a third order recurrence with the Laurent property.

  670. Andrew N. W. Hone, Laurent Polynomials and Superintegrable Maps (2007), http://arxiv.org/abs/math/0702280.

  671. I. Honkala, T. Laihonen and S. Ranto, On Strongly Identifying Codes, Discrete Math. 254 (2002), no. 1-3, 191-205.

  672. 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.

  673. A. F. Horadam, Applications of Modified Pell Numbers to Representations, Ulam Quaterly - Volume 3, Number 1, 1994.

  674. 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.

  675. 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.

  676. Qing-Hu Hou, Toufik Mansour and Simone Severini, Partial transpose of permutation matrices (2007), http://arxiv.org/abs/0709.3547.

  677. 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.

  678. Peter Hoyer, Troy Lee and Robert Spalek, Negative weights make adversaries stronger (2006), http://arxiv.org/abs/quant-ph/0611054.

  679. J. Hsiang, D. F. Hsu and Y. P. Shieh, On the hardness of counting problems of complete mappings, Discrete Math., 277 (2004), 87-100.

  680. Axel Hultman and Kathrin Vorwerk, Pattern avoidance and the Bruhat order on involutions (2007), http://arxiv.org/abs/0711.2223.

  681. S. P. Humphries, "Cogrowth groups and the Dedekind-Frobenius group determinant", Mathematical Proceedings of the