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 is one of 26 sections, which have been partitioned according to the first letter of the first author's last name.
  • The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
  • 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. 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.
  3. Ilda P.F. da Silva, Recursivity and geometry of the hypercube, Linear Algebra and its Applications, Volume 397, 1 March 2005, Pages 223-233.
  4. 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.
  5. 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.
  6. 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.
  7. 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
  8. D. Daly and L. Pudwell, Pattern avoidance in rook monoids, 2013; http://faculty.valpo.edu/lpudwell/slides/sandiego2013.pdf
  9. David Damanik, Local symmetries in the period-doubling sequence, Discrete Applied Mathematics, Volume 100, Issues 1-2, 15 March 2000, Pages 115-121.
  10. H. M. Damm, Prüfziffernsysteme über Quasigruppen, Diplomarbeit Univ. Marburg, 1998.
  11. Damm, Michael, Check digit systems over groups and anti-symmetric mappings. Arch. Math. (Basel) 75 (2000), no. 6, 413-421.
  12. Thierry Dana-Picard:, Explicit closed forms for parametric integrals, Int. J. Math. Ed. Sci. Tech. 35 (3) (2004), 456-467.
  13. Thierry Dana-Picard:, Parametric integrals and Catalan numbers, Int. J. Math. Ed. Sci. Tech. 36 (4), 410-414.
  14. Thierry Dana-Picard, "Sequences of Definite Integrals, Factorials and Double Factorials", J. Integer Sequences, Volume 8, 2005, Article 05.4.6.
  15. 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
  16. 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
  17. Lars Eirik Danielsen, On Self-Dual Quantum Codes, Graphs and Boolean Functions (2005), arXiv:quant-ph/0503236.
  18. Lars Eirik Danielsen, Classification of Hermitian Self-Dual Additive Codes over GF(9), Arxiv preprint arXiv:1106.2428, 2011
  19. Danielsen, Lars Eirik; Gulliver, T. Aaron; Parker, Matthew G. Aperiodic propagation criteria for Boolean functions. Inform. and Comput. 204 (2006), no. 5, 741-770.
  20. 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.
  21. 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.
  22. Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes (2007), arXiv:0710.2243.
  23. Lars Eirik Danielsen, Matthew G. Parker, Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes (2008); arXiv:0804.2576
  24. Lars Eirik Danielsen and Matthew G. Parker, Directed Graph Representation of Half-Rate Additive Codes over GF(4) (2009) arXiv:0902.3883
  25. 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.
  26. 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]
  27. 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)
  28. 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.
  29. Cecile Dartyge, Florian Luca and Pantelimon Stnic, On digit sums of multiples of an integer, Journal of Number Theory, 129 (2009), 2820-2830.
  30. Sandrine Dassehartaut and Pawel Hitczenko, Greek letters in random staircase tableaux, http://www.math.drexel.edu/~phitczen/st_pap_fin.pdf.
  31. Manosij Ghosh Dastidar and Sourav Sen Gupta, Generalization of a few results in Integer Partitions, Arxiv preprint arXiv:1111.0094, 2011
  32. D. E. Davenport, L. W. Shapiro and L. C. Woodson, The Double Riordan Group, The Electronic Journal of Combinatorics, 18(2) (2012), #P33.
  33. 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.
  34. R. J. M. Dawson, Tilings of the sphere with isosceles triangles, Discrete Comput. Geom. 30 (2003), 467-487.
  35. 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
  36. 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.
  37. 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.
  38. Patrick De Causmaecker and Stefan De Wannemacker, Partitioning in the space of anti-monotonic functions, arXiv:1103.2877.
  39. 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
  40. 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.
  41. 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
  42. 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
  43. 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.
  44. van der Kamp, Peter H. Growth of degrees of integrable mappings. J. Difference Equ. Appl. 18 (2012), no. 3, 447-460.
  45. de Luca, Aldo; De Luca, Alessandro, Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362 (2006), no. 1-3, 282-300.
  46. 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.
  47. 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.
  48. S. De Smedt, On Sloane's Sequence 1484, Saitama Math. J. 15 (1997), 9-13.
  49. A. de Vries, Formal Languages: An Introduction, http://haegar.fh-swf.de/Seminare/Genome/Archiv/languages.pdf
  50. 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.
  51. P.-O. Dehaye, Combinatorics of the lower order terms in the moment conjectures: the Riemann zeta function, http://modular.math.washington.edu/home/wstein/www/home/pdehaye/full_moments.pdf.
  52. 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
  53. 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.
  54. 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.
  55. 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.
  56. J.-P. Delahaye, Inventiones à suivre, Pour la Science, No. 353, March 2007.
  57. J.-P. Delahaye, L'arithmetique geometrique, Pour la Science, No. 360, October 2007.
  58. Marc Deleglise and Jean-Louis Nicolas, Maximal product of primes whose sum is bounded, Arxiv preprint arXiv:1207.0603, 2012
  59. M. Delest, Polyominoes and animals : some recent results, J. of Math. Chem., 8 (1991), 3-18.
  60. M. Delest, Enumeration of polyominoes using Macsyma, Theoretical Computer Science, Volume 79, Issue 1, 21 February 1991, Pages 209-226.
  61. M. Delest, Combinatorics, information vizualisation and algebraic languages, Invited talk, EWM'99.
  62. M. P. Delest, J. M. Fedou, Enumeration of skew Ferrers diagrams, Discrete Mathematics, Volume 112, Issues 1-3, 25 March 1993, Pages 65-79.
  63. Gesualdo Delfino and Jacopo Viti, Potts q-color field theory and scaling random cluster model, Arxiv preprint arXiv:1104.4323, 2011.
  64. A. Delgado, Daniel Calgiardi, Michael L. Gargano, Marty Lewinter, William Widulski, Even-Pancyclic subgraphs of meshes, (2008)
  65. O. Delgado-Friedrichs and M. O'Keeffe, Edge-transitive lattice nets, Acta Cryst. A, A65 (2009), 360-363.
  66. Giacomo Della Riccia, "Converting Between Generalized Bell, Lah, Stirling and Tanh Numbers", J. Integer Sequences, Volume 9, 2006, Article 06.3.5.
  67. Delorme, Charles, Plane trivalent trees and their patterns. Cent. Eur. J. Math. 8 (2010), no. 6, 1041-1047.
  68. 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
  69. Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain Combinatorics of Boolean automata circuits dynamics. Discrete Appl. Math. 160 (2012), no. 4-5, 398-415.
  70. 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.
  71. 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.
  72. A. Denise and R. Simion, Two combinatorial statistics on Dyck paths, Discrete Math. 137 (1995), 155-176.
  73. A. Denise, M. Vasconcellos and D. J. A. Welsh, The random planar graph, Congressus Numerantium 113 (1996) 61-79.
  74. S. C. Dent and J. Siemons, On a conjecture of Foulkes. J. Algebra 226 (2000), no. 1, 236-249.
  75. D. Denton, Methods of computing deque sortable permutations given complete and incomplete information, Arxiv preprint arXiv:1208.1532, 2012
  76. 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.
  77. Derksen, Harm; and Fink, Alex; Valuative invariants for polymatroids. Adv. Math. 225 (2010), no. 4, 1840-1892.
  78. Nachum Dershowitz, Mitchell A. Harris and Guan-Shieng Huang, Enumeration Problems Related to Ground Horn Theories (2006), arXiv:cs/0610054.
  79. Nachum Dershowitz, Shmuel Zaks, Enumerations of ordered trees, Discrete Mathematics, Volume 31, Issue 1, 1980, Pages 9-28.
  80. J.-M. 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.
  81. Chris Deugau, Frank Ruskey, Generalized Meta-Fibonacci sequences, DMTCS proc AG (2006) 203-214
  82. E. Deutsch, Dyck path enumeration, Discrete Math., 204 (1999), 167-202.
  83. E. Deutsch, Enumerating symmetric directed convex polyominoes, Discrete Math., 280 (2004), 225-231.
  84. E. Deutsch, Ordered trees with prescribed root degrees, node degrees and branch lengths. Discrete Math. 282 (2004), no. 1-3, 89-94.
  85. E. Deutsch, Tree statistics from Matula numbers, Arxiv preprint arXiv:1111.4288, 2011
  86. E. Deutsch, Rooted tree statistics from Matula numbers, Discrete Applied Mathematics, Volume 160, Issue 15, October 2012, Pages 2314-2322.
  87. 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.
  88. 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.
  89. 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
  90. 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.
  91. Deutsch, Emeric and 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.
  92. E. Deutsch and B. E. Sagan, Congruences for Catalan and Motzkin numbers and related sequences, J. Number Theory, 117 (2006), 191-215.
  93. 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 ..."
  94. E. Deutsch and L. Shapiro, A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Math., 256 (2002), 655-670.
  95. 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
  96. P. Devlin, Integer Subsets with High Volume and Low Perimeter, Arxiv preprint arXiv:1202.1331, 2012
  97. Deza, Michel; Deza, Elena Cones of partial metrics. Contrib. Discrete Math. 6 (2011), no. 1, 26-47.
  98. Michel Deza, Roman Shklyar, arXiv:1003.4391 Enumeration of hamiltonian cycles in 6-cube], arXiv:1003.4391 [cs.DM]
  99. Jean Dezert, Florentin Smarandache, On the Generation of Hyper-powersets for the DSmT (2003), arXiv:math/0309431.
  100. 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.
  101. 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.
  102. 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.
  103. M. R. Diamond, Multiplicative persistence base 10: some new null results, http://www.markdiamond.com.au/download/joous-3-1-1.pdf.
  104. 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.
  105. Ayhan Dil and Veli Kurt, Polynomials related to harmonic numbers and evaluation of harmonic number series I, INTEGERS, 12 (2012), #A38.
  106. Ayhan Dil, Veli Kurt and Mehmet Cenkci, "Algorithms for Bernoulli and Related Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.4.
  107. Karl Dilcher, "Congruences for a Class of Alternating Lacunary Sums of Binomial Coefficients", J. Integer Sequences, Volume 10, 2007, Article 07.10.1.
  108. D. Scott Dillery, Modeling with Data and Technology, Second Edition, 2011; http://simplex.lindsey.edu/~mdt/mdtText.pdf.
  109. 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; http://dl.acm.org/citation.cfm?id=2076063
  110. 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
  111. F. Disanto, The size of the biggest Caterpillar subtree in binary rooted planar trees, Arxiv preprint arXiv:1202.5668, 2012
  112. Filippo Disanto, Unbalanced subtrees in binary rooted ordered and un-ordered trees, Seminaire Lotharingien de Combinatoire, 68 (2013), Article B68b.
  113. Filippo Disanto, Luca Ferrari, Renzo Pinzani et al., Catalan numbers and relations (2009) arXiv:0901.3509
  114. 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.
  115. Disanto, Filippo; Frosini, Andrea; Rinaldi, Simone Square involutions. J. Integer Seq. 14 (2011), no. 3, Article 11.3.5, 15 pp.
  116. 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.
  117. 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
  118. Filippo Disanto and Thomas Wiehe, Some combinatorial problems on binary rooted trees occurring in population genetics, Arxiv preprint arXiv:1112.1295, 2011
  119. F. Disanto and T. Wiehe, Some instances of a sub-permutation problem on pattern avoiding permutations, arXiv preprint arXiv:1210.6908, 2012
  120. F. Disanto and T. Wiehe, Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model, Mathematical Biosciences, 2013 (in press).
  121. 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.
  122. Andreas Distler, Tom Kelsey, arXiv:1301.6023 The semigroups of order 9 and their automorphism groups
  123. 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.
  124. Dragomir Z. Djokovic and Benjamin H. Smith, Quaternionic matrices: Unitary similarity, simultaneous triangularization and some trace identities (2007), arXiv:0709.0513.
  125. 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
  126. 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).
  127. Jean-Paul Doignon and Anthony Labarre, "On Hultman Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.6.2.
  128. Tomislav Doli, "Maximum Product Over Partitions Into Distinct Parts", J. Integer Sequences, Volume 8, 2005, Article 05.5.8.
  129. Michael Domaratzki, "Combinatorial Interpretations of a Generalization of the Genocchi Numbers", J. Integer Sequences, Volume 7, 2004, Article 04.3.6.
  130. Michael Domaratzki, Trajectory-based codes, Acta Informatica, Volume 40, Numbers 6-7 / May, 2004.
  131. Robert Donaghey, Alternating permutations and binary increasing trees, Journal of Combinatorial Theory, Series A, Volume 18, Issue 2, March 1975, Pages 141-148.
  132. Robert Donaghey, Binomial self-inverse sequences and tangent coefficients, Journal of Combinatorial Theory, Series A, Volume 21, Issue 2, September 1976, Pages 155-163.
  133. Robert Donaghey, Automorphisms on Catalan trees and bracketings, Journal of Combinatorial Theory, Series B, Volume 29, Issue 1, August 1980, Pages 75-90.
  134. 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.
  135. Robert Donaghey, Louis W. Shapiro, Motzkin numbers, Journal of Combinatorial Theory, Series A, Volume 23, Issue 3, November 1977, Pages 291-301.
  136. M. Doring, J. Haidenbauer, U.-G. Meissner and A. Rusetsky, Dynamical coupled-channel approaches on a momentum lattice, Arxiv preprint arXiv:1108.0676, 2011.
  137. V. Dotsenko, Pattern avoidance in labelled trees, Arxiv preprint arXiv:1110.0844, 2011
  138. Dougherty, Michael; French, Christopher; Saderholm, Benjamin; Qian, Wenyang Hankel transforms of linear combinations of Catalan numbers. J. Integer Seq. 14 (2011), no. 5, Article 11.5.1, 20 pp.
  139. V. Dotsenko and A. Khoroshkin, Shuffle algebras, homology, and consecutive pattern avoidance, Arxiv preprint arXiv:1109.2690, 2011
  140. 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
  141. Doust, Ian; Hirschhorn, Michael D.; Ho, Jocelyn, Trigonometric identities, linear algebra and computer algebra. Amer. Math. Monthly 112 (2005), no. 2, 155-164.
  142. Brian Drake, Limits of areas under lattice paths, Discrete Mathematics, Volume 309, Issue 12, 28 June 2009, Pages 3936-3953.
  143. Drake, Dan Higher-order matching polynomials and d-orthogonality. Adv. in Appl. Math. 46 (2011), no. 1-4, 226-246.
  144. 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.
  145. 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.
  146. Dan Drake and Jang Soo Kim, k -distant crossings and nestings of matchings and partitions (2008) http://arxiv.org/abs/0812.2725
  147. Dan Drake, Ryan Gantner, arXiv:1109.3273 Generating functions for plateuas in Motzkin paths
  148. K. A. Draziotis, Computation of Pell Numbers of the Form p*X^2, CAI 2009, Lect. Notes Comp. Sci 5725 (2009) 220-226
  149. 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.
  150. G. P. B. Dresden, A simplified Binet Formula for k-Generalized Fibonacci Numbers, arXiv:0905.0304 [math.NT], 2009
  151. A. W. M. Dress, B. Morgenstern and J. Stoye, The Number of Standard and of Effective Multiple Alignments, Appl. Math. Lett. 11(4) (1998) 43-49. (Preprint)
  152. M. Drmota, B. Gittenberger, The shape of unlabeled rooted random trees, arXiv:1003.1322
  153. B.-S. Du, Congruence identities arising from dynamical systems, Appl. Math. Letters, 12 (1999), 115-119.
  154. R. Duarte and A. G. de Oliveira, Short note on the convolution of binomial coefficients, arXiv preprint arXiv:1302.2100, 2013
  155. Artras Dubickas, On a sequence related to that of ThueMorse and its applications, Discrete Mathematics, Volume 307, Issues 9-10, 6 May 2007, Pages 1082-1093.
  156. Arturas Dubickas, Heights of squares of Littlewood polynomials and infinite series, Ann. Polon. Math. 105 (2012), 145-163.
  157. Harvey Dubner, "Carmichael Numbers of the Form (6m+1)(12m+1)(18m+1)", J. Integer Sequences, Volume 5, 2002, Article 02.2.1.
  158. Harvey Dubner, "Twin Prime Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.4.2.
  159. Harvey Dubner and Tony Forbes, "Prime Pythagorean Triangles", J. Integer Sequences, Volume 4, 2001, Article 01.2.3.
  160. 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.
  161. E. G. DuCasse et al., Graphs whose vertices are forests with bounded degree: order and size, Congressus Numerantium, 205 (2010), 65-74.
  162. Gerard H. E. Duchamp, Florent Hivert, Jean-Christophe Novelli et al., Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited (2008); arXiv:0809.4479
  163. Gerard Henry Edmond Duchamp, Jean-Gabriel Luque, Jean-Christophe Novelli et al., Hopf algebras of diagrams (2007), arXiv:0710.5661.
  164. Duchi, Enrica; Fedou, Jean-Marc; Rinaldi, Simone, From object grammars to ECO systems. Theoret. Comput. Sci. 314 (2004), no. 1-2, 57-95.
  165. 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.
  166. Enrica Duchi, Simone Rinaldi, Gilles Schaeffer, The number of Z-convex polyominoes (2006), arXiv:math/0602124.
  167. 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.
  168. P. Duchon, Q-grammaires: un outil pour l'énumération, PHD thesis, Université Bordeaux 1 (1998).
  169. Philippe Duchon, On the link pattern distribution of quarter-turn symmetric FPL configurations (2007), arXiv:0711.2871.
  170. P. Duchon, P. Flajolet, G. Louchard and G. Schaeffer, Random Sampling from Boltzmann Principles, Proc. ICALP'2002, Lecture Notes in Computer Science, July 2002.
  171. 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.
  172. 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).]
  173. S. Dugowson, Representation of finite connective spaces (2007), arXiv:0707.2542.
  174. 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.
  175. 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.
  176. W. M. B. Dukes, On a Unimodality Conjecture in Matroid Theory, Discrete Math. Theor. Comput. Sci., Volume 5 n° 1 (2002), pp. 181-190.
  177. 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.)
  178. P. Duncan and Einar Steingrimsson, Pattern avoidance in ascent sequences, Arxiv preprint arXiv:1109.3641, 2011 and El. J. Combinat. 18 (1) (2011) P226
  179. D. Dunham, Enumerations of Hyperbolic Truchet Tiles, http://www.duluth.umn.edu/~ddunham/isama11.pdf
  180. 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.
  181. Bergfinnur Durhuus and Soren Eilers, Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length (2009) arXiv:0902.2274
  182. 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.
  183. Wayne M. Dymacek, Isaac Lambert and Kyle Parsons, Arithmetic Progressions in Permutations, http://math.ku.edu/~ilambert/CN.pdf, 2012.
  184. 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
  185. M. Dziemianczuk, Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients (2009) arXiv:0901.1337

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 is one of 26 sections, which have been partitioned according to the first letter of the first author's last name.
  • The full list of sections is: CiteA, CiteB, CiteC, CiteD, CiteE, CiteF, CiteG, CiteH, CiteI, CiteJ, CiteK, CiteL, CiteM, CiteN, CiteO, CiteP, CiteQ, CiteR, CiteS, CiteT, CiteU, CiteV, CiteW, CiteX, CiteY, CiteZ.
  • For further information, see the main page for Works Citing OEIS.
Retrieved from "http://oeis.org/wiki/CiteD"
Personal tools