This site is supported by donations to The OEIS Foundation.

CiteD

From OeisWiki

Jump to: navigation, search


Contents

CiteD

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • This section lists works in which the first author's name begins with D.
  • The full list of sections is: A Ba Bi Ca Ci D E F G H I J K L M N O P Q R Sa Sl T U V W X Y Z.
  • For further information, see the main page for Works Citing OEIS.

References

  1. D'Andrea, Carlos; Hare, Kevin G. On the height of the Sylvester resultant. Experiment. Math. 13 (2004), no. 3, 331-341.
  2. Alma D'Aniello, A de Luca, A De Luca, On Christoffel and standard words and their derivatives, arXiv preprint arXiv:1602.03231, 2016
  3. 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.
  4. R. D'Mello, Marshall Hall's Conjecture and Gaps Between Integer Points on Mordell Elliptic Curves, arXiv preprint arXiv:1410.0078, 2014
  5. C. M. da Fonseca, Unifying some Pell and Fibonacci identities, Applied Mathematics and Computation, Volume 236, 1 June 2014, Pages 41-42,
  6. CM da Fonseca, ML Glasser, V Kowalenko, Basic trigonometric power sums with applications, arXiv preprint arXiv:1601.07839, 2016
  7. Ilda P.F. da Silva, Recursivity and geometry of the hypercube, Linear Algebra and its Applications, Volume 397, 1 March 2005, Pages 223-233.
  8. Matthew Dabkowski, N Fan, R Breiger, Exploratory blockmodeling for one-mode, unsigned, deterministic networks using integer programming and structural equivalence, Social Networks, Volume 47, October 2016, Pages 93–106; doi:10.1016/j.socnet.2016.05.005
  9. S. Daboul, J. Mangaldan, M. Z. Spivey and P. Taylor, The Lah Numbers and the nth Derivative of exp(1/x), http://math.pugetsound.edu/~mspivey/Exp.pdf.
  10. G Dahl, TA Haufmann, Zero-one completely positive matrices and the A(R,S) classes, Preprint, 2016; https://www.researchgate.net/profile/Geir_Dahl/publication/303684695_Zero-one_completely_positive_matrices_and_the_AR_S_classes/links/574d4e6308aec988526a3045.pdf
  11. Dairyko, Michael; Tyner, Samantha; Pudwell, Lara; Wynn, Casey. Non-contiguous pattern avoidance in binary trees. Electron. J. Combin. 19 (2012), no. 3, Paper 22, 21 pp. MR2967227.
  12. M. R. T. Dale, J. W. Moon, The permuted analogues of three Catalan sets, Journal of Statistical Planning and Inference, Volume 34, Issue 1, January 1993, Pages 75-87.
  13. C Dalfó, MA Fiol, A Note on the Order of Iterated Line Digraphs, Journal of Graph Theory, Volume 85, Issue 2, June 2017, Pages 395–39, 2016; doi:10.1002/jgt.22068; arXiv:1607.08832, 2016.
  14. Daniel Daly, doi:10.1007/s00026-010-0051-8 Fibonacci numbers, reduced decompositions and 321/3412 pattern classes, Ann. Combin. 14 (1) (2010) 53-64
  15. D. Daly and L. Pudwell, Pattern avoidance in rook monoids, 2013; http://faculty.valpo.edu/lpudwell/slides/sandiego2013.pdf
  16. David Damanik, Local symmetries in the period-doubling sequence, Discrete Applied Mathematics, Volume 100, Issues 1-2, 15 March 2000, Pages 115-121.
  17. H. M. Damm, Prüfziffernsysteme über Quasigruppen, Diplomarbeit Univ. Marburg, 1998.
  18. Damm, Michael, Check digit systems over groups and anti-symmetric mappings. Arch. Math. (Basel) 75 (2000), no. 6, 413-421.
  19. Thierry Dana-Picard:, Explicit closed forms for parametric integrals, Int. J. Math. Ed. Sci. Tech. 35 (3) (2004), 456-467.
  20. Thierry Dana-Picard:, Parametric integrals and Catalan numbers, Int. J. Math. Ed. Sci. Tech. 36 (4), 410-414.
  21. Thierry Dana-Picard, "Sequences of Definite Integrals, Factorials and Double Factorials", J. Integer Sequences, Volume 8, 2005, Article 05.4.6.
  22. Thierry Dana-Picard, doi:10.1080/0020739X.2010.519792 Integral representations of Catalan numbers and Wallis formula], Int. J. Math. Ed. Sci. Techn. 42 (1) (2011) 122-129
  23. Thierry Dana-Picard and David G. Zeitoun, Sequences of definite integrals, infinite series and Stirling numbers, International Journal of Mathematical Education in Science and Technology, jun 19 2011, doi:10.1080/0020739X.2011.582172
  24. Thierry Dana-Picard & David Zeitoun (2016): Exploration of parametric integrals related to a question of soil mechanics, International Journal of Mathematical Education in Science and Technology, doi:10.1080/0020739X.2016.1256445
  25. Th. Dana-Picard and D. Zeitoun (2009): Closed forms for 4- parameter families of integrals, International Journal of Mathematical Education in Science and Technology 40 (6), 828-837.
  26. Lars Eirik Danielsen, On Self-Dual Quantum Codes, Graphs and Boolean Functions (2005), arXiv:quant-ph/0503236.
  27. Lars Eirik Danielsen, Classification of Hermitian Self-Dual Additive Codes over GF(9), Arxiv preprint arXiv:1106.2428, 2011
  28. Danielsen, Lars Eirik; Gulliver, T. Aaron; Parker, Matthew G. Aperiodic propagation criteria for Boolean functions. Inform. and Comput. 204 (2006), no. 5, 741-770.
  29. Lars Eirik Danielsen and Matthew G. Parker, Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform (2005), arXiv:cs/0504102. In Sequences and Their Applications-SETA 2004, Lecture Notes in Computer Science, Volume 3486/2005, Springer-Verlag.
  30. 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.
  31. Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes (2007), arXiv:0710.2243.
  32. Lars Eirik Danielsen, Matthew G. Parker, Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes (2008); arXiv:0804.2576
  33. Lars Eirik Danielsen and Matthew G. Parker, Directed Graph Representation of Half-Rate Additive Codes over GF(4) (2009) arXiv:0902.3883
  34. 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.
  35. 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]
  36. 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)
  37. Alain Darte, John Mellor-Crummey, Robert Fowler, Daniel Chavarria-Miranda, Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations, Journal of Parallel and Distributed Computing, Volume 63, Issue 9, September 2003, Pages 887-911.
  38. Cecile Dartyge, Florian Luca and Pantelimon Stnic, On digit sums of multiples of an integer, Journal of Number Theory, 129 (2009), 2820-2830.
  39. Sandrine Dassehartaut and Pawel Hitczenko, Greek letters in random staircase tableaux, http://www.math.drexel.edu/~phitczen/st_pap_fin.pdf.
  40. Manosij Ghosh Dastidar and Sourav Sen Gupta, Generalization of a few results in Integer Partitions, Arxiv preprint arXiv:1111.0094, 2011
  41. Shouvik Datta, MR Gaberdiel, W Li, C Peng, Twisted sectors from plane partitions, arXiv preprint arXiv:1606.07070, 2016
  42. G. Dattoli, E. Di Palma, E. Sabia, Cardan Polynomials, Chebyshev Exponents, Ultra-Radicals and Generalized Imaginary Units, Advances in Applied Clifford Algebras, 2014
  43. G Dattoli, K Górska, A Horzela, KA Penson, E Sabia, Theory of relativistic heat polynomials and one-sided Lévy distributions, 2016; https://www.researchgate.net/profile/Giuseppe_Dattoli2/publication/306100458_Theory_of_relativistic_heat_polynomials_and_one-sided_Levy_distributions/links/57b1819d08aeb2cf17c4be1c.pdf
  44. Dennis E. Davenport, Lara K. Pudwell, Louis W. Shapiro, Leon C. Woodson, The Boundary of Ordered Trees, Journal of Integer Sequences, Vol. 18 (2015), Article 15.5.8. (A000108 A000245 A000344 A000957 A000984 A001700 A014137 A068551 A228180 A228197 A228343)
  45. D. E. Davenport, L. W. Shapiro and L. C. Woodson, The Double Riordan Group, The Electronic Journal of Combinatorics, 18(2) (2012), #P33.
  46. J. H. Davenport, International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), 2014; http://people.bath.ac.uk/masjhd/Meetings/JHDonISSAC2014.pdf
  47. Ori DAVIDOV and Shyamal PEDDADA, Order-Restricted Inference for Multivariate Binary Data With Application to Toxicology, Journal of the American Statistical Association, December 1, 2011, 106(496): 1394-1404, doi:10.1198/jasa.2011.tm10322.
  48. Donald M. Davis, Enumerating lattices of subsets, arXiv preprint arXiv:1311.6664, 2013
  49. Matt Davis, Quadrant Marked Mesh Patterns and the r-Stirling Numbers- arXiv preprint arXiv:1412.0345, 2014
  50. Nichole Davis, Dominic Klyve and Nicole Kraght, On the difference between an integer and the sum of its proper divisors, Involve, Vol. 6 (2013), No. 4, 493-504; doi:10.2140/involve.2013.6.493
  51. Philip J. Davis, The relevance of the irrelevant beginning, Science Open Research, 2014; https://www.science-open.com/document_file/bbb13cb9-819d-40ee-88c4-93da7a9837ee/ScienceOpen/1126_XE4980413325094859252.pdf ["... those concerned with mathematical heuristics have found that it is useful and makes good sense to create the Online Encyclopedia of Integer Sequences that will attempt to identify a finite sequence from among a large and growing database of sequences that have arisen in theoretical work."]
  52. B. A. Dawson, The Algorithmic Beauty of Music: Approaches to Computer-Aided Algorithmic Composition, http://brucedawson.net/wp-content/uploads/2015/05/DAWSONBRUCE_THESIS_PDF.pdf, 2015. [...includes automatic melody generation using the Online Encyclopedia of Integer Sequences...]
  53. R. J. M. Dawson, Tilings of the sphere with isosceles triangles, Discrete Comput. Geom. 30 (2003), 467-487.
  54. R. J. MacG. Dawson, doi:10.1007/s00022-010-0044-0 Monotone and Cebysev arcs in hyperspaces], J. Geom. 98 (1-2) (2010) 1-19
  55. D. E. Daykin, D. J. Kleitman and D. B. West, The number of meets between two subsets of a lattice, Journal of Combinatorial Theory, Series A, Volume 26, Issue 2, March 1979, Pages 135-156.
  56. Hernan de Alba, W Carballosa, J Leaños, LM Rivera, Independence and matching numbers of some token graphs, arXiv preprint arXiv:1606.06370, 2016
  57. R. F. de Andrade, E. Lundberg, B, Nagle, Asymptotics of the Extremal Excedance Set Statistic, arXiv preprint arXiv:1403.0691, 2014
  58. C. P. de Andrade, J. P. de Oliveira Santos, E. V. P. da Silva and K. C. P. Silva, Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers, Open Journal of Discrete Mathematics, 2013, 3, 25-32 doi:10.4236/ojdm.2013.31006.
  59. De Angelis, Valerio, and Dominic Marcello. "Wilf′ s Conjecture." The American Mathematical Monthly 123.6 (2016): 557-573.
  60. Stijn De Baerdemacker, A De Vos, L Chen, L Yu, The Birkhoff theorem for unitary matrices of arbitrary dimensions, arXiv preprint arXiv:1606.08642, 2016
  61. Bernard De Baets, Radko Mesiar, Triangular norms on product lattices, Fuzzy Sets and Systems, Volume 104, Issue 1, 16 May 1999, Pages 61-75.
  62. R. De Castro, A. L. Ramírez and J. L. Ramírez, Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs, arXiv preprint arXiv:1310.2449, 2013
  63. Patrick De Causmaecker and Stefan De Wannemacker, Partitioning in the space of anti-monotonic functions, arXiv:1103.2877.
  64. P. De Causmaecker, S. De Wannemacker, Decomposition of Intervals in the Space of Anti-Monotonic Functions, in Manuel Ojeda-Aciego, Jan Outrata (Eds.): CLA 2013, pp. 57{67, ISBN 978{2{7466{6566{8, Laboratory L3i, University of La Rochelle, 2013; http://ceur-ws.org/Vol-1062/proceedings-cla2013.pdf#page=69.
  65. P. De Causmaecker, S. De Wannemacker, On the number of antichains of sets in a finite universe, arXiv preprint arXiv:1407.4288, 2014
  66. P De Causmaecker, S De Wannemacker, J Yellen, Intervals of Antichains and Their Decompositions, arXiv preprint arXiv:1602.04675, 2016
  67. D. de Cogan, W. J. O'Connor, X. Gui, doi:10.1002/nme.1269 Accelerated convergence in TLM algorithms for the Laplace equation] Int. J. Num. Methods Engin. 63 (1) (2005) 122-138
  68. Florent de Dinechin, Matei Istoan, Guillaume Sergent, Kinga Illyes, Bogdan Popa and Nicolas Brunie, Arithmetic around the bit heap, http://hal.archives-ouvertes.fr/docs/00/73/84/12/PDF/2012-BitHeap.pdf, 2012.
  69. Edson de Faria & Charles Tresser (2014) On Sloane’s Persistence Problem, Experimental Mathematics, 23 (2014), 363-382, doi:10.1080/10586458.2014.910849
  70. Luca De Feo, David Jao and Jerome Plut, Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies, http://www.prism.uvsq.fr/~dfl/fichiers/pq-long.pdf
  71. Jan de Gier, Bernard Nienhuis, doi:10.1088/1742-5468/2005/01/P01006 Brauer loops and the commuting variety, J. Stat. Mechan.: Theor. Exp. vol. 2005 (2005) #P01006
  72. 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.
  73. J.-M. De Konink, F. Luca, Positive integers n such that sigma(phi(n))=sigma(n), JIS 11 (2008) 08.1.5
  74. 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)
  75. de Luca, Aldo; de Luca, Alessandro, Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362 (2006), no. 1-3, 282-300.
  76. A. de Luca, A. de Luca, Sturmian words and the Stern sequence, arXiv preprint arXiv:1410.4085, 2014
  77. Lucia De Luca, Gero Friesecke, Classification of particle numbers with unique Heitmann-Radin minimizer, arXiv:1701.07231 [math-ph], 2017.
  78. de Mello Koch, R. & Ramgoolam, S., Interactions as intertwiners in 4D QFT, J. High Energ. Phys. (2016) 2016: 165. doi:10.1007/JHEP03(2016)165
  79. Liesbeth De Mol, The Proof Is in the Process: A Preamble for a Philosophy of Computer-Assisted Mathematics, in New Directions in the Philosophy of Science, The Philosophy of Science in a European Perspective, Volume 5, 2014, pp. 15-33.
  80. J. Arias de Reyna, J. van de Lune, The question "How many 1's are needed?" revisited, arXiv preprint arXiv:1404.1850, 2014.
  81. J. Arias de Reyna, J. van de Lune, Algorithms for determining integer complexity, arXiv preprint arXiv:1404.2183, 2014
  82. David De Roure, P Willcox, DM Weigl, NUMBERS INTO NOTES: CAST YOUR MIND BACK 200 YEARS. Extended Abstracts for the Late-Breaking Demo Session of the 17th International Society for Music Information Retrieval Conference, 2016; https://wp.nyu.edu/ismir2016/wp-content/uploads/sites/2294/2016/08/deroure-numbers.pdf
  83. Johan de Ruiyer, Counting Classes of Klondike Solitaire Configurations, Master's Thesis, Internal Report 2012-9, August 2012, Universiteit Leiden, Opleiding Informatica; http://www.liacs.nl/assets/Masterscripties/2012-09JohandeRuiter.pdf.
  84. M. De Salvo, D. Fasino, D. Freni, G. Lo Faro, Fully simple semihypergroups, transitive digraphs, and sequence A000712, Journal of Algebra, Volume 415, 1 October 2014, Pages 65-87.
  85. Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Cryptographic key assignment schemes for any access control policy, Information Processing Letters, Volume 92, Issue 4, 30 November 2004, Pages 199-205.
  86. S. De Smedt, On Sloane's Sequence 1484, Saitama Math. J. 15 (1997), 9-13.
  87. A. de Vries, Formal Languages: An Introduction, http://haegar.fh-swf.de/Seminare/Genome/Archiv/languages.pdf
  88. Stefan De Wannemacker, Thomas Laffey, Robert Osburn, On a conjecture of Wilf, Journal of Combinatorial Theory, Series A, Volume 114, Issue 7, October 2007, Pages 1332-1349.
  89. de Winter, J. C. F., (2013). Using the Student's t-test with extremely small sample sizes. Practical Assessment, Research & Evaluation, 18(10). Available online: http://pareonline.net/getvn.asp?v=18&n=10.
  90. J. de Zoete, M. Sjerps, D. Lagnado, N. Fenton, Modelling crime linkage with Bayesian Networks, Sci. & Justice 55 (3) (2015) 209-217 doi:10.1016/j.scijus.2014.11.005
  91. B. Dearden, J. Iiams, J. Metzger, A Function Related to the Rumor Sequence Conjecture, J. Int. Seq. 14 (2011) # 11.2.3
  92. B. Dearden, J. Iiams, J. Metzger, Rumor Arrays, Journal of Integer Sequences, 16 (2013), #13.9.3.
  93. Colin Defant, Postorder Preimages, arXiv preprint arXiv:1604.01723, 2016
  94. Colin Defant, Some Poset Pattern-Avoidance Problems Posed by Yakoubov, arXiv preprint arXiv:1608.03951, 2016
  95. D. Deford, Seating rearrangements on arbitrary graphs, 2013; PDF INVOLVE 7:6 (2014); doi:10.2140/involve.2014.7.787
  96. Daryl Deford, Enumerating distinct chessboard tilings, (2014);
  97. P.-O. Dehaye, Combinatorics of the lower order terms in the moment conjectures: the Riemann zeta function, PDF
  98. Paul-Olivier DEHAYE, Engineering discovery in mathematics, SNSF CONSOLIDATOR GRANT RESEARCH PROPOSAL, 2014; http://user.math.uzh.ch/dehaye/ERC/ResearchPlan_Dehaye.pdf
  99. Italo J. Dejter, A numeral system for the middle levels, Preprint 2014; http://home.coqui.net/dejterij/anumeral.pdf.
  100. I. Dejter, <a href="http://home.coqui.net/dejterij/a_string.pdf">On a system of numeration applicable to the middle two levels of the Boolean lattice</a>
  101. Italo J. Dejter, Dihedral-symmetry middle-levels problem via a Catalan system of numeration, preprint, 2015. (A000108, A239903, A007623, A009766)
  102. I. J. Dejter, A new approach to the middle levels via a Catalan-number system of numeration, 2015; http://home.coqui.net/dejterij/aneliese.pdf
  103. F. M. Dekking, Pure morphic sequences and their standard forms, arXiv preprint arXiv:1509.00260, 2015. Appeared in J. Integer Sequences, Vol. 19, with title "Morphisms, Symbolic Sequences, and Their Standard Forms".
  104. Michel Dekking, M Keane, On the conjugacy class of the Fibonacci dynamical system, arXiv preprint arXiv:1608.04487, 2016
  105. A. Del Lungo, E. Duchi, A. Frosini, S. Rinaldi, Enumeration of convex polyominoes using the ECO method Disc. Math. Theo. Comp. Sci. AB (2003) 103-116
  106. 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.
  107. 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.
  108. 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.
  109. J.-P. Delahaye, Inventiones à suivre, Pour la Science, No. 353, March 2007.
  110. J.-P. Delahaye, L'arithmetique geometrique, Pour la Science, No. 360, October 2007.
  111. Jean-Paul Delahaye, Mille collections de nombres, Pour la Science N° 379 – mai 2009, pp. 88-93.
  112. Jean-Paul Delahaye, La persistance des nombres, Pour la Science, July 5, 2013, pp. 15-24.
  113. Jean-Paul DELAHAYE, Une seule intelligence?, Pour la Science, No. 446, Dec. 2014, pp. 76-77.
  114. Jean-Paul Delahaye, Inventions Mathématiques, Jouer avec l'arithmétique et la géométrie, Published by Pour La Science, 06/06/2014, Bibliotheque Scientifique, ISBN : 2842451287, EAN : 978-2842451288
  115. E. Delaygue, Arithmetic properties of Apery-like numbers, arXiv preprint arXiv:1310.4131, 2013
  116. Marc Deleglise and Jean-Louis Nicolas, Maximal product of primes whose sum is bounded, Arxiv preprint arXiv:1207.0603, 2012
  117. M. Deléglise, J.-L. Nicolas, On the Largest Product of Primes with Bounded Sum, Journal of Integer Sequences, 18 (2015), #15.2.8.
  118. M. Delest, Polyominoes and animals : some recent results, J. of Math. Chem., 8 (1991), 3-18.
  119. M. Delest, Enumeration of polyominoes using Macsyma, Theoretical Computer Science, Volume 79, Issue 1, 21 February 1991, Pages 209-226.
  120. M. Delest, Combinatorics, information vizualisation and algebraic languages, Invited talk, EWM'99.
  121. M. P. Delest, J. M. Fedou, Enumeration of skew Ferrers diagrams, Discrete Mathematics, Volume 112, Issues 1-3, 25 March 1993, Pages 65-79.
  122. Gesualdo Delfino and Jacopo Viti, Potts q-color field theory and scaling random cluster model, Arxiv preprint arXiv:1104.4323, 2011.
  123. A. Delgado, Daniel Calgiardi, Michael L. Gargano, Marty Lewinter, William Widulski, Even-Pancyclic subgraphs of meshes, (2008)
  124. O. Delgado-Friedrichs and M. O'Keeffe, Edge-transitive lattice nets, Acta Cryst. A, A65 (2009), 360-363.
  125. Giacomo Della Riccia, "Converting Between Generalized Bell, Lah, Stirling and Tanh Numbers", J. Integer Sequences, Volume 9, 2006, Article 06.3.5.
  126. Robert Deloin, Proof of Bunyakovsky's Conjecture, viXra, 2016.
  127. Delorme, Charles, Plane trivalent trees and their patterns. Cent. Eur. J. Math. 8 (2010), no. 6, 1041-1047.
  128. C. Delorme, Sequence of maximal distance codes in graphs or other metric spaces, Electronic Journal of Graph Theory and Applications 1 (2) (2013), 118-124
  129. Charles Delorme and Guillermo Pineda-Villavicencio, Quadratic Form Representations via Generalized Continuants, Journal of Integer Sequences, Vol. 18 (2015), Article 15.6.4. (A003655, A014602)
  130. Demaine, Erik D.; Demaine, Martin L.; Minsky, Yair N.; Mitchell, Joseph S. B.; Rivest, Ronald L.; PÇ~NtraÅ~_cu, Mihai Picture-hanging puzzles. Theory Comput. Syst. 54 (2014), no. 4, 531-550.
  131. O. Demetz, D. Hafner, J. Weickert, Morphologically Invariant Matching of Structures with the Complete Rank Transform, International Journal of Computer Vision, July 2015, Volume 113, Issue 3, pp 220-232
  132. B. Demoen and P.-L. Nguyen, The classification of graphs with a redundant inequality, Report CW633, Dept. of Computer Sci., Univ. Leuven, 2013; http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW633.pdf
  133. Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain Combinatorics of Boolean automata circuits dynamics. Discrete Appl. Math. 160 (2012), no. 4-5, 398-415.
  134. Eva Y.P. Deng, Toufik Mansour, Three Hoppy path problems and ternary paths, Discrete Applied Mathematics, Volume 156, Issue 5, 1 March 2008, Pages 770-779.
  135. Eva Y.P. Deng, Wei-Jun Yan, Some identities on the Catalan, Motzkin and Schroder numbers, Discrete Applied Mathematics, Volume 156, Issue 14, 28 July 2008, Pages 2781-2789.
  136. A. Denise and R. Simion, Two combinatorial statistics on Dyck paths, Discrete Math. 137 (1995), 155-176.
  137. A. Denise, M. Vasconcellos and D. J. A. Welsh, The random planar graph, Congressus Numerantium 113 (1996) 61-79.
  138. Z. Deniz, Topology of acyclic complexes of tournaments and coloring, Applicable Algebra in Engineering, Communication, March 2015, Volume 26, Issue 1, pp 213-226.
  139. H Denoncourt, DC Ernst, D Story, On the number of commutation classes of the longest element in the symmetric group, arXiv:1602.08328, 2016.
  140. S. C. Dent and J. Siemons, On a conjecture of Foulkes. J. Algebra 226 (2000), no. 1, 236-249.
  141. D. Denton, Methods of computing deque sortable permutations given complete and incomplete information, Arxiv preprint arXiv:1208.1532, 2012
  142. Tom Denton, Algebraic and Affine Pattern Avoidance, arXiv preprint arXiv:1303.3767, 2013
  143. Denton, Tom; Hivert, Florent; Schilling, Anne; Thiéry, Nicolas M. On the representation theory of finite J-trivial monoids. Sém. Lothar. Combin. 64 (2010/11), Art. B64d, 44 pp.
  144. Josh Deprez, Fair amenability for semigroups, arXiv preprint arXiv:1310.5589, 2013
  145. Leo Depuydt, The Prime Sequence: Demonstrably Highly Organized While Also Opaque and Incomputable-With Remarks on Riemann's Hypothesis, Partition, Goldbach's Conjecture, ..., Advances in Pure Mathematics, 4 (No. 8, 2014), 400-466.
  146. Derksen, Harm; and Fink, Alex; Valuative invariants for polymatroids. Adv. Math. 225 (2010), no. 4, 1840-1892.
  147. Nachum Dershowitz, Mitchell A. Harris and Guan-Shieng Huang, Enumeration Problems Related to Ground Horn Theories (2006), arXiv:cs/0610054.
  148. Nachum Dershowitz, Shmuel Zaks, Enumerations of ordered trees, Discrete Mathematics, Volume 31, Issue 1, 1980, Pages 9-28.
  149. M. A. Deryagina, On the enumeration of hypermaps which are self-equivalent with respect to reversing the colors of vertices, Preprint 2016; ftp://ftp.pdmi.ras.ru/pub/publicat/znsl/v446/p031.pdf
  150. M. A. Deryagina and A. D. Mednykh, On the enumeration of circular maps with given number of edges, Siberian Mathematical Journal, 54, No. 6, 2013, 624-639.
  151. Stephen DeSalvo, Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer, Algorithmica (2016). https://doi.org/10.1007/s00453-016-0223-y
  152. Derek Desantis, Rebecca Field, Wesley Hough, Brant Jones, Rebecca Meissen, and Jacob Ziefle, Permutation Pattern Avoidance and the Catalan Triangle, Missouri J. Math. Sci. Volume 25, Issue 1 (2013), 50-60.
  153. Jean-Marc Deshouillers, A footnote to the least non zero digit of n! in base 12, Uniform Distribution Theory 7 (2012), no. 1, 71-73; http://www.boku.ac.at/math/udt/vol07/no1/03Desh30-11.pdf.
  154. Jean-Marc Deshouillers, Yet Another Footnote to the Least Non Zero Digit of n! in Base 12, Unif. Distrib. Theory 11 (2016), no. 2, 163-167. doi:10.1515/UDT-2016-0018
  155. Jonathan Detchart, Jérôme Lacan, Fast Xor-based Erasure Coding based on Polynomial Ring Transforms, arXiv:1701.07731, 2017.
  156. Duane W. DeTemple and William Webb, Combinatorial Reasoning: An Introduction to the Art of Counting, Wiley, 2014.
  157. Chris Deugau and Frank Ruskey, Complete k-ary trees and generalized meta-Fibonacci sequences, in Fourth Colloquium on Mathematics and Computer Science, DMTCS Proc. AG, 2006, 203-214; http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/viewFile/570/1690
  158. E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999), 167-202.
  159. E. Deutsch, Enumerating symmetric directed convex polyominoes, Discrete Math., 280 (2004), 225-231.
  160. E. Deutsch, Ordered trees with prescribed root degrees, node degrees and branch lengths. Discrete Math. 282 (2004), no. 1-3, 89-94.
  161. E. Deutsch, Tree statistics from Matula numbers, Arxiv preprint arXiv:1111.4288, 2011
  162. E. Deutsch, Rooted tree statistics from Matula numbers, Discrete Applied Mathematics, Volume 160, Issue 15, October 2012, Pages 2314-2322.
  163. E. Deutsch and S. Elizalde, Cycle Up-down Permutations, arXiv:0909.5199. 2009.
  164. Emeric Deutsch, S Elizalde, Statistics on bargraphs viewed as cornerless Motzkin paths, arXiv preprint arXiv:1609.00088, 2016
  165. 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.
  166. Deutsch, Emeric; Ferrari, Luca; and Rinaldi, Simone, doi:10.1016/j.aam.2004.05.002 Production matrices], Adv. in Appl. Math. 34 (2005), no. 1, 101-122.
  167. Emeric Deutsch, Emanuele Munarini, and Simone Rinaldi, doi:10.1016/j.jspi.2010.01.015 Skew Dyck paths], J. Stat. Plan. Infer. 140 (8) (2010) 2191-2203
  168. 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.
  169. Emeric Deutsch and Helmut Prodinger, 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.
  170. E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory, 117 (2006), 191-215.
  171. 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 ..."
  172. E. Deutsch and L. Shapiro, A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Math., 256 (2002), 655-670.
  173. O. Deveci, Y. Akuzum, E. Karaduman, O. Erdag, The Cyclic Groups via Bezout Matrices, Journal of Mathematics Research, Vol. 7, No. 2; 2015, pp. 34-41.
  174. O. Deveci and E. Karaduman, On the Periods of Some Figurate Numbers, Selcuk J. Appl. Math. Vol. 12. No. 2. pp. 71-80, 2011; http://www.sumam.selcuk.edu.tr/vol%2012-2/12-2-7/sj10-42.pdf
  175. A. Sangeetha Devi, MM Shanmugapriya, Application of 2-Dominator Coloring in Graphs Using MATLAB, Journal of Computer and Mathematical Sciences, Vol. 7(4), 168-174, April 2016
  176. L. DeVille, S. Dhople, A. Dominguez-Garcia, J. Zhang, Stochastic hybrid systems in equilibrium: moment closure, finite-time blowup, and exact solutions, arXiv preprint arXiv:1411.6600, 2014
  177. P. Devlin, Integer Subsets with High Volume and Low Perimeter, Arxiv preprint arXiv:1202.1331, 2012
  178. Deza, Michel; Deza, Elena Cones of partial metrics. Contrib. Discrete Math. 6 (2011), no. 1, 26-47.
  179. Michel Deza, Roman Shklyar, Enumeration of hamiltonian cycles in 6-cube, arXiv:1003.4391 [cs.DM]
  180. Jean Dezert, Florentin Smarandache, On the Generation of Hyper-powersets for the DSmT (2003), arXiv:math/0309431.
  181. Rahul Dhal, Gerardo Lafferriere, John Caughman, Towards a complete characterization of vulnerability of networked synchronization processes, 2016 IEEE 55th Conference on Decision and Control (CDC). doi:10.1109/CDC.2016.7799066
  182. A. Di Crescenzo, B. Martinucci, A. Rhandi, A linear birth-death process on a star graph and its diffusion approximation, arXiv preprint arXiv:1405.4312, 2014
  183. P. Di Francesco, O. Golinelli, E. Guitter, Meanders: a direct enumeration approach, Nuclear Physics B, Volume 482, Issue 3, 30 December 1996, Pages 497-535.
  184. P. Di Francesco, O. Golinelli and E. Guitter, arXiv:hep-th/9506030 Meander, folding and arch statistics.]; Mathematical and Computer Modelling, Volume 26, Issues 8-10, October-November 1997, Pages 97-147.
  185. 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.
  186. M. R. Diamond, Multiplicative persistence base 10: some new null results, http://www.markdiamond.com.au/download/joous-3-1-1.pdf.
  187. J. A. Dias da Silva and P. J. Freitas, Counting Spectral Radii of Matrices with Positive Entries, arXiv preprint arXiv:1305.1139, 2013
  188. Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, Darleen Perez-Lavin, Peaks Sets of Classical Coxeter Groups, preprint arXiv:1505.04479, 2015. [A000330, A007051, A122983]
  189. R. Dickau, Unlabeled Stamp Foldings
  190. M Diepenbroek, M Maus, A Stoll, Pattern Avoidance in Reverse Double Lists, Preprint 2015, http://www.valpo.edu/mathematics-statistics/files/2014/09/Pudwell2015.pdf
  191. 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.
  192. A. Dil, Veli Kurt, Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices, J. Int. Seq. 14 (2011) # 11.4.6
  193. Ayhan Dil and Veli Kurt, Polynomials related to harmonic numbers and evaluation of harmonic number series I, INTEGERS, 12 (2012), #A38.
  194. Ayhan Dil, Veli Kurt and Mehmet Cenkci, "Algorithms for Bernoulli and Related Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.4.
  195. Karl Dilcher, "Congruences for a Class of Alternating Lacunary Sums of Binomial Coefficients", J. Integer Sequences, Volume 10, 2007, Article 07.10.1.
  196. K. Dilcher, L. Ericksen, Reducibility and irreducibility of Stern (0, 1)-polynomials, COMMUNICATIONS IN MATHEMATICS, VOLUME 22/2014 , pp. 77-102.
  197. K. Dilcher and L. Ericksen, Hyperbinary expansions and Stern polynomials, Elec. J. Combin, 22, 2015, #P2.24.
  198. Karl Dilcher, Larry Ericksen, The Polynomials of Mahler and Roots of Unity, The American Mathematical Monthly, Vol. 122, No. 04 (April 2015), pp. 338-353. [A49094,] "We encounter the amazingly interesting and helpful on-line mathematical tool OEIS ..."
  199. Karl Dilcher, Larry Ericksen, Hyperbinary Expansions and Stern Polynomials, Electronic Journal of Combinatorics, Volume 22, Issue 2 (2015), Paper #P2.24. [A002487, A000120, A005836, A000695, A033042]
  200. K Dilcher, L Ericksen, Factors and irreducibility of generalized Stern polynomials, Integers, #A50 15 (2015)
  201. Karl Dilcher and Larry Ericksen. Continued fractions and Stern polynomials. Ramanujan Journal (2017). doi:10.1007/s11139-016-9864-3.
  202. K. Dilcher, K. B. Stolarsky, Nonlinear recurrences related to Chebyshev polynomials, The Ramanujan Journal, 2014, Online Oct. 2014, pp. 1-23.
  203. D. Scott Dillery, Modeling with Data and Technology, Second Edition, 2011; http://simplex.lindsey.edu/~mdt/mdtText.pdf.
  204. D. Dimitrov, Efficient computation of trees with minimal atom-bond connectivity index, arXiv preprint arXiv:1305.1155, 2013
  205. Dimitrov, Darko; DvoÅ~Yák, Tomáš; Gregor, Petr; Å| krekovski, Riste Linear time construction of a compressed Gray code. European J. Combin. 34 (2013), no. 1, 69-81.
  206. Yun Ding and Rosena R. X. Du, Counting Humps in Motzkin paths, Arxiv preprint arXiv:1109.2661, 2011. Discrete Applied Mathematics, Volume 160 Issue 1-2, January, 2012; doi:10.1016/j.dam.2011.08.018
  207. Ziqian Ding, Dihedral Symmetries of Non-crossing Partition Lattices, Ph D Dissertation, University of Miami August 2016; http://scholarlyrepository.miami.edu/cgi/viewcontent.cgi?article=2698&context=oa_dissertation
  208. Felipe B. Diniz, About a new family of sequences, arXiv preprint arXiv:1607.06082, 2016
  209. Diophante.fr, <a href="http://www.diophante.fr/accueil">LES RECREATIONS MATHEMATIQUES</a>, PLUS DE 2000 RECREATIONS ET PROBLEMES MATHEMATIQUES.
  210. F. Disanto, Andre' permutations of the second kind associated to strictly binary increasing trees and left to right minima in their sub-permutations, Arxiv preprint arXiv:1202.1139, 2012
  211. F. Disanto, The size of the biggest Caterpillar subtree in binary rooted planar trees, Arxiv preprint arXiv:1202.5668, 2012
  212. Filippo Disanto, Unbalanced subtrees in binary rooted ordered and un-ordered trees, Seminaire Lotharingien de Combinatoire, 68 (2013), Article B68b.
  213. Filippo Disanto, Luca Ferrari, Renzo Pinzani et al., Catalan numbers and relations (2009) arXiv:0901.3509
  214. 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.
  215. Disanto, Filippo; Frosini, Andrea; Rinaldi, Simone Square involutions. J. Integer Seq. 14 (2011), no. 3, Article 11.3.5, 15 pp.
  216. F. Disanto, E. Pergola, R. Pinzani and S. Rinaldi, Generation and Enumeration of Some Classes of Interval Orders, Order, July 2012; doi:10.1007/s11083-012-9269-x.
  217. F. Disanto and S. Rinaldi, Symmetric convex permutominoes and involutions, PU. M. A., Vol. 22 (2011), No. 1, pp. 39-60; http://www.mat.unisi.it/newsito/puma/public_html/22_1/2-disanto_rinaldi.pdf
  218. Filippo Disanto and Thomas Wiehe, Some combinatorial problems on binary rooted trees occurring in population genetics, Arxiv preprint arXiv:1112.1295, 2011
  219. F. Disanto and T. Wiehe, Some instances of a sub-permutation problem on pattern avoiding permutations, arXiv preprint arXiv:1210.6908, 2012
  220. F. Disanto and T. Wiehe, Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model, Mathematical Biosciences, 2013 (in press).
  221. F. Disanto and T. Wiehe, On the sub-permutations of pattern avoiding permutations, Discrete Math., 337 *2014), 127-141.
  222. Andreas Distler and Tom Kelsey, The Monoids of Order Eight and Nine, in Intelligent Computer Mathematics, Lecture Notes in Computer Science, Volume 5144/2008, Springer-Verlag.
  223. Andreas Distler, Tom Kelsey, arXiv:1301.6023 The semigroups of order 9 and their automorphism groups
  224. Dariush Divsalar, Sudarsan V. S. Ranganathan, Richard D. Wesel, On the Girth of (3,L) Quasi-Cyclic LDPC Codes based on Complete Protographs, preprint arXiv:1504.04975 [A003111]
  225. Dragomir Z. Djokovic, arXiv:math.AC/0609262 Poincare series of some pure and mixed trace algebras of two generic matrices, J. Algebra 309 (2007), no. 2, 654-671.
  226. Norman Do and Paul Norbury, Pruned Hurwitz numbers, arXiv preprint arXiv:1312.7516, 2013
  227. Dragomir Z. Djokovic and Benjamin H. Smith, Quaternionic matrices: Unitary similarity, simultaneous triangularization and some trace identities (2007), arXiv:0709.0513.
  228. P. T. Do, D. Rossin and T. T. H. Tran, Combinatorial bijections from hatted avoiding permutations in S_n(132) to generalized Dyck and Motzkin paths, Arxiv preprint arXiv:1208.1075, 2012
  229. Vladimir Dobric, M Skyers, LJ Stanley, Polynomial Time Computable Triangular Arrays For Almost Sure Convergence, arXiv preprint arXiv:1603.04896, 2016
  230. 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).
  231. A. Dochtermann, Face rings of cycles, associahedra, and standard Young tableaux, arXiv preprint arXiv:1503.06243, 2015
  232. K. Dohmen, Closed-form expansions for the universal edge elimination polynomial, arXiv preprint arXiv:1403.0969, 2014
  233. K. Dohmen, M. Trinks, An Abstraction of Whitney's Broken Circuit Theorem, arXiv preprint arXiv:1404.5480, 2014
  234. Jean-Paul Doignon and Anthony Labarre, "On Hultman Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.6.2.
  235. T. Dokos, I. Pak, The expected shape of random doubly alternating Baxter permutations, arXiv:1401.0770, 2014.
  236. D. Z. Dokovic, I. Kotsireas, D. Recoskie, J. Sawada, Charm bracelets and their application to the construction of periodic Golay pairs, Discrete Applied Mathematics, Volume 188, 19 June 2015, Pages 32–40.; also arXiv:1405.7328, 2014.
  237. Tomislav Doli, "Maximum Product Over Partitions Into Distinct Parts", J. Integer Sequences, Volume 8, 2005, Article 05.5.8.
  238. I. Dolinka, J. East, A. Evangelou, D. FitzGerald, N. Ham, et al., Enumeration of idempotents in diagram semigroups and algebras, arXiv preprint arXiv:1408.2021, 2014
  239. I. Dolinka, J. East, A. Evangelou et al, Idempotent statistics of the Motzkin and Jones Monoids, arXiv:1507.04838 (2015)
  240. I Dolinka, J East, RD Gray, Motzkin monoids and partial Brauer monoids, arXiv preprint arXiv:1512.02279, 2015
  241. Domanski, Pawel; Langenbruch, Michael Hadamard multipliers on spaces of real analytic functions. Adv. Math. 240 (2013), 575-612.
  242. Michael Domaratzki, "Combinatorial Interpretations of a Generalization of the Genocchi Numbers", J. Integer Sequences, Volume 7, 2004, Article 04.3.6.
  243. Michael Domaratzki, Trajectory-based codes, Acta Informatica, Volume 40, Numbers 6-7 / May, 2004.
  244. Robert Donaghey, Alternating permutations and binary increasing trees, Journal of Combinatorial Theory, Series A, Volume 18, Issue 2, March 1975, Pages 141-148.
  245. Robert Donaghey, Binomial self-inverse sequences and tangent coefficients, Journal of Combinatorial Theory, Series A, Volume 21, Issue 2, September 1976, Pages 155-163.
  246. Robert Donaghey, Automorphisms on Catalan trees and bracketings, Journal of Combinatorial Theory, Series B, Volume 29, Issue 1, August 1980, Pages 75-90.
  247. Robert Donaghey, Restricted plane tree representations of four Motzkin-Catalan equations, Journal of Combinatorial Theory, Series B, Volume 22, Issue 2, April 1977, Pages 114-121.
  248. Robert Donaghey, Louis W. Shapiro, Motzkin numbers, Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, November 1977, Pages 291-301.
  249. D. M. Donovan, T. S. Griggs, T. A. McCourt, J. Opršal, D. Stanovský, Distributive and anti-distributive Mendelsohn triple systems, arXiv preprint arXiv:1411.5184, 2014
  250. M. Doring, J. Haidenbauer, U.-G. Meissner and A. Rusetsky, Dynamical coupled-channel approaches on a momentum lattice, Arxiv preprint arXiv:1108.0676, 2011.
  251. T. Doslic, Handshakes across a (round) table, JIS 13 (2010) #10.2.7.
  252. Tomislav Doslic, Planar polycyclic graphs and their Tutte polynomials, Journal of Mathematical Chemistry, Volume 51, Issue 6, 2013, pp. 1599-1607.
  253. T. Doslic, Kepler-Bouwkamp Radius of Combinatorial Sequences, Journal of Integer Sequences, Vol. 17, 2014, #14.11.3.
  254. Tomislav Doslic and R. Sharafdini, Hosoya Index of Splices, Bridges, and Necklaces, in Distance, Symmetry, and Topology in Carbon Nanomaterials, 2016, pp 147-156. Part of the Carbon Materials: Chemistry and Physics book series (CMCP, volume 9), doi:10.1007/978-3-319-31584-3_10
  255. T Doslic, T Short, Maximal matchings in polyspiro and benzenoid chains, arXiv preprint arXiv:1511.00590, 2015
  256. Tomislav Doslic, I Zubac, Counting maximal matchings in linear polymers, ARS MATHEMATICA CONTEMPORANEA 11 (2016) 255–276, http://amc-journal.eu
  257. V. Dotsenko, Pattern avoidance in labelled trees, Arxiv preprint arXiv:1110.0844, 2011
  258. V. Dotsenko and A. Khoroshkin, Shuffle algebras, homology, and consecutive pattern avoidance, Arxiv preprint arXiv:1109.2690, 2011
  259. Michael Dougherty, Christopher French, Benjamin Saderholm, and Wenyang Qian, Hankel Transforms of Linear Combinations of Catalan Numbers, Journal of Integer Sequences, Vol. 14 (2011), Article 11.5.1
  260. Doust, Ian; Hirschhorn, Michael D.; Ho, Jocelyn, Trigonometric identities, linear algebra and computer algebra. Amer. Math. Monthly 112 (2005), no. 2, 155-164.
  261. J. M. Dover, On two OEIS conjectures, arXiv:1606.08033 [math.CO], 2016.
  262. Jeremy M. Dover, Some Notes on Pairs in Binary Strings, arXiv preprint arXiv:1609.00980, 2016 ["Fortunately, when analyzing computational data for z(n, k, m), we searched the OEIS [1] for the case m = 0, which yielded an unexpected connection with the sequence A046854."]
  263. O. Dovgoshey, E. Petrov, H.-M. Teichert, On spaces extremal for the Gomory-Hu inequality, arXiv preprint arXiv:1412.1979, 2014
  264. Branko Dragovich, On Summation of p-Adic Series, arXiv:1702.02569 [math.NT], 2017.
  265. Branko Dragovich, Andrei Yu. Khrennikov, Natasa Z. Misic, Summation of p-Adic Functional Series in Integer Points, arXiv:1508.05079, 2015
  266. B. Dragovich, N. Z. Misic, p-Adic invariant summation of some p-adic functional series, P-Adic Numbers, Ultrametric Analysis, and Applications, October 2014, Volume 6, Issue 4, pp 275-283.
  267. J. Draisma, E. Horobet, G. Ottaviani, B. Sturmfels and R. K. Thomas, The Euclidean distance degree of an algebraic variety, arXiv preprint arXiv:1309.0049, 2013
  268. Brian Drake, Limits of areas under lattice paths, Discrete Mathematics, Volume 309, Issue 12, 28 June 2009, Pages 3936-3953.
  269. Dan Drake, The combinatorics of associated Hermite polynomials (2007), arXiv:0709.0987; European Journal of Combinatorics, Volume 30, Issue 4, May 2009, Pages 1005-1021.
  270. D. Drake, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Drake/drake.html">Bijections from Weighted Dyck Paths to Schröder Pathss</a, J. Int. Seq. 13 (2010) # 10.9.2
  271. Drake, Dan Higher-order matching polynomials and d-orthogonality. Adv. in Appl. Math. 46 (2011), no. 1-4, 226-246.
  272. 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
  273. Dan Drake and Jang Soo Kim, k -distant crossings and nestings of matchings and partitions (2008) arXiv:0812.2725
  274. Dan Drake, Ryan Gantner, arXiv:1109.3273 Generating functions for plateuas in Motzkin paths
  275. K. A. Draziotis, Computation of Pell Numbers of the Form p*X^2, CAI 2009, Lect. Notes Comp. Sci 5725 (2009) 220-226
  276. 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.
  277. G. P. B. Dresden, A simplified Binet Formula for k-Generalized Fibonacci Numbers, arXiv:0905.0304 [math.NT], 2009
  278. A. W. M. Dress, B. Morgenstern and J. Stoye, doi:10.1016/S0893-9659(98)00054-8 The Number of Standard and of Effective Multiple Alignments, Appl. Math. Lett. 11(4) (1998) 43-49. (Preprint)
  279. F. Drewes et al., Tight Bounds for Cut-Operations on Deterministic Finite Automata, in Lecture Notes in Computer Science, Volume 9288, 2015, Machines, Computations, and Universality, 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Editors: Jerome Durand-Lose, Benedek Nagy, ISBN: 978-3-319-23110-5 (Print) 978-3-319-23111-2 (Online)
  280. J. A. B. Dris, Euclid-Euler Heuristics for (Odd) Perfect Numbers, arXiv preprint arXiv:1310.5616, 2013
  281. J. A. B. Dris, A Sufficient Condition for Disproving Descartes's Conjecture on Odd Perfect Numbers, arXiv preprint arXiv:1311.6803, 2013
  282. Jose A. B. Dris, Conditions Equivalent to the Descartes-Frenicle-Sorli Conjecture on Odd Perfect Numbers, arXiv preprint arXiv:1610.01868, 2016
  283. M. Drmota, B. Gittenberger, The shape of unlabeled rooted random trees, arXiv:1003.1322
  284. Paul Drube, Generating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers, arXiv preprint arXiv:1606.04869, 2016
  285. Paul Drube, Set-Valued Tableaux & Generalized Catalan Numbers, arXiv preprint arXiv:1607.07411, 2016
  286. B.-S. Du, Congruence identities arising from dynamical systems, Appl. Math. Letters, 12 (1999), 115-119.
  287. R. R. X. Du, J. He, X. Yun, Counting vertices in plane and k-ary trees with given outdegree, arXiv preprint arXiv:1501.07468, 2015
  288. R. R. X. Du, Y. Nie, X. Sun, Bijective Enumerations on Humps and Peaks in (k,a)-paths and (n,m)-Dyck paths, arXiv preprint arXiv:1406.2449, 2014
  289. R. Duarte and A. G. de Oliveira, Short note on the convolution of binomial coefficients, arXiv preprint arXiv:1302.2100, 2013
  290. R. Duarte, A. G. de Oliveira, Note on the Convolution of Binomial Coefficients, Journal of Integer Sequences, 2013, #13.7.6.
  291. R. Duarte, A. G. de Oliveira, A Famous Identity of Hajós in Terms of Sets, Journal of Integer Sequences, 17 (2014), #14.9.1.
  292. A Dubey, A Simplified Analysis To A Generalized Restricted Partition Problem, Principia: The Princeton Undergraduate Mathematics Journal, Issue 2, 2016; http://pumj.org/docs/Issue2/Article4.pdf
  293. Artras Dubickas, On a sequence related to that of Thue-Morse and its applications, Discrete Mathematics, Volume 307, Issues 9-10, 6 May 2007, Pages 1082-1093.
  294. Arturas Dubickas, Heights of squares of Littlewood polynomials and infinite series, Ann. Polon. Math. 105 (2012), 145-163.
  295. Harvey Dubner, "Carmichael Numbers of the Form (6m+1)(12m+1)(18m+1)", J. Integer Sequences, Volume 5, 2002, Article 02.2.1.
  296. Harvey Dubner, "Twin Prime Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.4.2.
  297. Harvey Dubner and Tony Forbes, "Prime Pythagorean Triangles", J. Integer Sequences, Volume 4, 2001, Article 01.2.3.
  298. 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.
  299. Dubois C., Giorgetti A., Genestier R. (2016) Tests and Proofs for Enumerative Combinatorics. In: Aichernig B., Furia C. (eds) Tests and Proofs. TAP 2016. Lecture Notes in Computer Science, vol 9762. Springer.
  300. L Ducas, T Prest, Fast Fourier Orthogonalization, Preprint 2015, http://eprint.iacr.org/2015/1014.pdf
  301. E. G. DuCasse et al., Graphs whose vertices are forests with bounded degree: order and size, Congressus Numerantium, 205 (2010), 65-74.
  302. Gerard H. E. Duchamp, Florent Hivert, Jean-Christophe Novelli et al., Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited (2008); arXiv:0809.4479
  303. G. H. E Duchamp, N. Hoang-Nghia, A. Tanasa, A word Hopf algebra based on the selection/quotient principle, Séminaire Lotharingien de Combinatoire 68 (2013), Article B68c.
  304. Gerard Henry Edmond Duchamp, Jean-Gabriel Luque, Jean-Christophe Novelli et al., Hopf algebras of diagrams (2007), arXiv:0710.5661.
  305. Eric Duchêne, AS Fraenkel, V Gurvich, Nbao Ho, C. Kimberling, U. Larsson, Wythoff wisdom, Preprint 2016; http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/WythoffWisdomJune62016.pdf
  306. Duchi, Enrica; Fedou, Jean-Marc; Rinaldi, Simone, From object grammars to ECO systems. Theoret. Comput. Sci. 314 (2004), no. 1-2, 57-95.
  307. 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.
  308. Enrica Duchi, Simone Rinaldi, Gilles Schaeffer, The number of Z-convex polyominoes (2006), arXiv:math/0602124.
  309. 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.
  310. P. Duchon, Q-grammaires: un outil pour l'énumération, PHD thesis, Université Bordeaux 1 (1998).
  311. Philippe Duchon, On the link pattern distribution of quarter-turn symmetric FPL configurations (2007), arXiv:0711.2871.
  312. P. Duchon, R. Duvignau, A new generation tree for permutations, FPSAC 2014, Chicago, USA; Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, 2014, 679-690; http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/viewFile/dmAT0159/4546. ["The OEIS (2013) was very helpful in identifying the rencontre numbers in some apparently unrelated work, and thus lead to the tree construction that is the focus of the present paper."]
  313. P. Duchon, P. Flajolet, G. Louchard and G. Schaeffer, Random Sampling from Boltzmann Principles, Proc. ICALP'2002, Lecture Notes in Computer Science, July 2002.
  314. 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.
  315. William Dugan, Sam Glennon, Paul E. Gunnells, Einar Steingrimsson, Tiered trees, weights, and q-Eulerian numbers, arXiv:1702.02446 [math.CO], 2017.
  316. D. Dugger, Bigraded cohomology of Z/2-equivariant Grassmannians, arXiv preprint arXiv:1209.5067, 2012 [The Online Encyclopedia of Integer Sequences [OE] was useful in discovering the formula in part (b).]
  317. S. Dugowson, Representation of finite connective spaces (2007), arXiv:0707.2542.
  318. A. Dujella, A. S.Janfeda, S. Salami, A Search for High Rank Congruent Number Elliptic Curves, JIS 12 (2009) 09.5.8
  319. 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.
  320. M. Dukes and Y. Le Borgne, Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a q,t-Narayana polynomial, Journal of Combinatorial Theory, Series A, Volume 120, Issue 4, May 2013, Pages 816-842.
  321. Mark Dukes, Chris D White, Web Matrices: Structural Properties and Generating Combinatorial Identities, Electronic Journal Of Combinatorics, 23(1) (2016), #P1.45
  322. Peter J Dukes, K Garaschuk, On the cone of weighted graphs generated by triangles, arXiv preprint arXiv:1608.06017, 2016
  323. P. J. Dukes, J. Niezen, Pairwise balanced designs of dimension three, AUSTRALASIAN JOURNAL OF COMBINATORICS, Volume 61(1) (2015), Pages 98-113; http://ajc.maths.uq.edu.au/pdf/61/ajc_v61_p098.pdf
  324. W. M. B. Dukes, On a Unimodality Conjecture in Matroid Theory, Discrete Math. Theor. Comput. Sci., Volume 5 n° 1 (2002), pp. 181-190.
  325. 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.)
  326. DS Dummit, EP Dummit, H Kisilevsky, Characterizations of quadratic, cubic, and quartic residue matrices, arXiv preprint arXiv:1512.06480, 2015
  327. B. Duncan and R. Peele, Bell and Stirling numbers for graphs, JIS 12 (2009) 09.7.1
  328. P. Duncan and Einar Steingrimsson, Pattern avoidance in ascent sequences, Arxiv preprint arXiv:1109.3641, 2011 and El. J. Combinat. 18 (1) (2011) P226
  329. D. Dunham, Enumerations of Hyperbolic Truchet Tiles, http://www.duluth.umn.edu/~ddunham/isama11.pdf
  330. Fabien Durand, Julien Leroy, and Gwenaël Richomme, "Do the Properties of an S-adic Representation Determine Factor Complexity?", Journal of Integer Sequences, Vol. 16 (2013), #13.2.6.
  331. 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.
  332. Bergfinnur Durhuus and Soren Eilers, Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length (2009) arXiv:0902.2274
  333. J. M. Dusel, Balanced parabolic quotients and branching rules for Demazure crystals, 2014; http://math.ucr.edu/~jmd/JohnMDusel_balanced_quotients.pdf
  334. C. L. Duta, L. Gheorghe, N. Tapus, Framework for Evaluation and Comparison of Primality Testing Algorithms. Published in: Control Systems and Computer Science (CSCS), 2015 20th International Conference on Date of Conference: 27-29 May 2015 Page(s): 483 - 490 Print ISBN: 978-1-4799-1779-2 INSPEC Accession Number: 15397726
  335. Christophe Dutang. Theoretical L-moments and TL-moments Using Combinatorial Identities and Finite Operators. 2015. hal-01163638, https://hal.archives-ouvertes.fr/hal-01163638/document
  336. Anjan Dutta and Hichem Sahbi, High Order Stochastic Graphlet Embedding for Graph-Based Pattern Recognition, arXiv:1702.00156, 2017.
  337. Trinh Khanh Duy, Tomoyuki Shirai, The mean spectral measures of random Jacobi matrices related to Gaussian beta ensembles, preprint arXiv:1504.06904, 2015. [A000698, A167872]
  338. S. V. Duzhin, D. V. Pasechnik, Groups acting on necklaces and sandpile groups, ftp://pdmi.ras.ru/pub/publicat/znsl/v421/p081.pdf, 2014.
  339. Dymacek, Wayne M.; Lambert, Isaac Circular permutations avoiding runs of i,i+1,i+2 or i,i-1,i-2. J. Integer Seq. 14 (2011), no. 1, Article 11.1.6, 10 pp.
  340. Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012.
  341. Askar Dzhumadildaev and Damir Yeliussizov, "Power Sums of Binomial Coefficients", Journal of Integer Sequences, Vol. 16 (2013), #13.1.1.
  342. A. Dzhumadildaev, D. Yeliussizov, Path decompositions of digraphs and their applications to Weyl algebra, arXiv preprint arXiv:1408.6764v1, 2014. [Version 1 contained many references to the OEIS, which were removed in Version 2]
  343. Askar Dzhumadil’daev and Damir Yeliussizov, Walks, partitions, and normal ordering, Electronic Journal of Combinatorics, 22(4) (2015), #P4.10.
  344. A. Dzhumadil'daev, P. Zusmanovich, The alternative operad is not Koszul, arXiv:0906.1271 doi:10.1080/10586458.2011.544558 The alternative operad is not Koszul, Exper. Math. 20 (2) (2011) 138-144
  345. M. Dziemianczuk, Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients (2009) arXiv:0901.1337
  346. M. Dziemianczuk, Counting Lattice Paths With Four Types of Steps, Graphs and Combinatorics, September 2013, doi:10.1007/s00373-013-1357-1.
  347. M. Dziemianczuk, Generalizing Delannoy numbers via counting weighted lattice paths, INTEGERS, 13 (2013), #A54.
  348. Dziemiańczuk, M. "Enumerations of plane trees with multiple edges and Raney lattice paths." Discrete Mathematics 337 (2014): 9-24.
  349. M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, arXiv preprint arXiv:1410.5747, 2014

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • The full list of sections is: A Ba Bi Ca Ci D E F G H I J K L M N O P Q R Sa Sl T U V W X Y Z.
  • For further information, see the main page for Works Citing OEIS.
Retrieved from "http://oeis.org/wiki/CiteD"
Personal tools