This site is supported by donations to The OEIS Foundation.


From OeisWiki
Jump to: navigation, search

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 O.
  • 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.


  1. M. J. O'Brien, De Bruijn Graphs and The Ehrenfeucht-Mycielski Sequence, Master's Thesis, Carnegie Mellon University, April 26, 2001.
  2. K. O'Bryant, The sequence of fractional parts of roots, arXiv preprint arXiv:1410.2927, 2014
  3. K. O'Bryant, Sets of natural numbers with proscribed subsets, arXiv preprint arXiv:1410.4900, 2014
  4. Colm O'Dunlaing, In-order traversal of splay trees, Electronic Notes in Theoretical Computer Science, Volume 74, October 2003, Pages 134-157.
  5. Jason O'Neill, On the poset and asymptotics of Tesler Matrices, arXiv:1702.00866 [math.CO], 2017.
  6. Patrick Kaileigh O'Neill, Gene regulation from information theory to biophysics, Dissertation, University of Maryland, Baltimore County, 2016.
  7. Patrick K. O'Neill, I Erill, Parametric bootstrapping for biological sequence motifs, BMC Bioinformatics, (2016) 17:406; doi:10.1186/s12859-016-1246-8
  8. Edwin O'Shea, M-partitions: Optimal partitions of weight for one scale pan (2003), arXiv:math/0311230.
  9. J. R. Oaks, An Improved Approximate-Bayesian Model-choice Method for Estimating Shared Evolutionary History, arXiv preprint arXiv:1402.6303, 2014
  10. Mustafa Obaid et al., The number of complete exceptional sequences for a Dynkin algebra, arXiv preprint arXiv:1307.7573, 2013 and Colloq. Math. 133 (2) (2013) 197-210 doi:10.4064/cm133-2-6
  11. M. A. A. Obaid, S. K. Nauman, W. M. Fakieh, C. M. Ringel, The numbers of support-tilting modules for a Dynkin algebra,, 2014 and J. Int. Seq. 18 (2015) 15.10.6
  12. Marija Obradović, Tiling the Lateral Surface of the Concave Cupolae of the Second Sort, Nexus Network Journal (2018), 1-19. doi:10.1007/s00004-018-0417-5
  13. N. Ochiumi, On the total sum of number of nodes covering a given number of leaves in an unordered binary tree; PDF.
  14. Adrian Ocneanu, On the inner structure of a permutation: bicolored partitions and Eulerians, trees and primitives; arXiv preprint arXiv:1304.1263, 2013
  15. A. M. Odlyzko, Asymptotic enumeration methods, in Handbook of Combinatorics, vol. 2, R. L. Graham, M. Groetschel and L. Lovasz, eds., Elsevier, 1995, pp. 1063-1229. (ps, PDF).
  16. A. M. Odlyzko, The rapid evolution of scholarly communication, Learned Publishing, Volume 15 no. 1, pp. 7-19.
  17. A. M. Odlyzko, Review of "Experimental Mathematics in Action by D. H. Bailey, J. M. Borwein, N. J. Calkin, R. Girgensohn, D. R. Luke and V. H. Moll. AK Peters, Wellesley, MA, 2007. xii+ 322 pp." See Published in Amer. Math. Monthly, 118 (2011), 946-951.
  18. Jakob Oesinghaus, Quasi-symmetric functions and the Chow ring of the stack of expanded pairs, arXiv:1806.10700 [math.AG], 2018. (A059966)
  19. J. Ofverstedt, Water Retention on Magic Squares with Constraint-Based Local Search, Department of Information Technology, Uppsala University, Report IT 12 018, June 2012.
  20. F. E. Oggier, G. F. Royle, N. J. A. Sloane, I. M. Wanless, H. S. Wilf, Acyclic digraphs and eigenvalues of (0,1)-matrices, J. Int. Seq. 79 (2004) # 04.3.3
  21. J. M. Oh, An explicit formula for the number of fuzzy subgroups of a finite abelian p-group of rank two, Iranian Journal of Fuzzy Systems, Dec 2013, Vol. 10 Issue 6, pp. 125-135.
  22. Oh, Seungsang. "Maximal independent sets on a grid graph." Discrete Mathematics 340.12 (2017): 2762-2768. doi:10.1016/j.disc.2017.08.015, also arXiv:1709.03678 [math.CO].
  23. Yun-Tak Oh, Hosho Katsura, Hyun-Yong Lee, Jung Hoon Han, Proposal of a spin-one chain model with competing dimer and trimer interactions, arXiv:1709.01344 [cond-mat.str-el], 2017.
  24. P. Ohlsson, On the grammars of fractal sequences: music in infinite patterns, Kurs: DG1013 Examensarbete, kandidat, komposition 15 HP, 2014, Konstnärlig kandidatexamen i musik, 180 HP, Institutionen för komposition, dirigering och musikteori, Kungl. Musikhögskolan | Royal College of Music in Stockholm;
  25. Hidefumi Ohsugi, Akiyoshi Tsuchiya, The h∗-polynomials of locally anti-blocking lattice polytopes and their γ-positivity, arXiv:1906.04719 [math.CO], 2019. (A204621)
  26. H. Ohtsuka, S. Nakamura A new formula for the sum of the sixth powers of Fibonacci numbers, vixra:0910.0012
  27. H. I. Okagbue, M.O.Adamu, S.A. Bishop and A.A. Opanuga, Properties of Sequences Generated by Summing the Digits of Cubed Positive Integers, Indian Journal Of Natural Sciences, Vol. 6 / Issue 32 / October 2015
  28. Hilary I. Okagbue, Muminu O. Adamu, Sheila A. Bishop, Abiodun A. Opanuga, Digit and Iterative Digit Sum of Fibonacci numbers, their identities and powers, International Journal of Applied Engineering Research ISSN 0973-4562 Volume 11, Number 6 (2016) pp 4623-4627.
  29. H. I. Okagbue, M. O. Adamu, S. A. Iyase, A. A. Opanuga, Sequence of Integers Generated by Summing the Digits of their Squares, Indian Journal of Science and Technology, Vol 8(15), doi:10.17485/ijst/2015/v8i15/69912, July 2015
  30. Okhotin, Alexander Unambiguous finite automata over a unary alphabet. Inform. and Comput. 212 (2012), 15-36.
  31. Karolina Okrasa, Paweł Rzążewski, Intersecting edge distinguishing colorings of hypergraphs. arXiv:1804.10470 [cs.DM]. (A000670)
  32. İnci Okumuş, Yüksel Soykan, On a Generalized Tribonacci Sequence, Journal of Progressive Research in Mathematics (2018) Vol. 14, No. 3, 2413-2418. PDF
  33. İnci Okumuş, Yüksel Soykan, Erkan Taşdemir, Melih Göcen, Gaussian Generalized Tribonacci Numbers, Journal of Progressive Research in Mathematics (2018) Vol. 14, No. 2, 2373-2387. PDF
  34. Jorge Alberto Olarte, Francisco Santos, Hypersimplicial subdivisions, arXiv:1906.05764 [math.CO], 2019. (A060595)
  35. Gloria Olive, Catalan numbers revisited, Journal of Mathematical Analysis and Applications, Volume 111, Issue 1, October 1985, Pages 201-235.
  36. Fernando Neres de Oliveira, On the Solvability of the Diophantine Equation p^x + (p + 8)^y = z^2 when p > 3 and p + 8 are Primes, Annals of Pure and Applied Mathematics (2018) Vol. 18, No. 1, 9-13. doi:10.22457/apam.v18n1a2 (A156320)
  37. K. Oliver and H. Prodinger, The continued fraction expansion of Gauss' hypergeometric function and a new application to the tangent function, Transactions of the Royal Society of South Africa, Vol. 76 (2012), 151-154, doi:10.1080/0035919X.2012.727363.
  38. A. M. Oller-Marcen, On arithmetic numbers, Arxiv preprint arXiv:1206.1823, 2012
  39. A. M. Oller-Marcen, J. Maria Grau, On the Base-b Expansion of the Number of Trailing Zeros of b^k!, J. Int. Seq. 14 (2011) 11.6.8
  40. Richard L. Ollerton and Anthony G. Shannon, Some properties of generalized Pascal squares and triangles, Fib. Q., 36 (1998), 98-109.
  41. R. L. Ollerton. Fibonacci cubes. Intl J. Math. Educ. Sci. Techn. 37 (6) (2006) 754-756 doi:10.1080/00207390600712521
  42. R. L. Ollerton and A. G. Shannon, Extensions of generalized binomial coefficients, QM&MS Research Reports (2001).
  43. Hans Olofsen, Blending functions based on trigonometric and polynomial approximations of the Fabius function, The Arctic University of Norway (Narvik, 2019). PDF (A005578)
  44. J. B. Olsson, Side 9-sætningen: En sætning om partitioner, Famøs Fagblad for Aktuar, Matematik, Økonomi og Statistik, 16. årgang, nr. 2, dec. 2002.
  45. Mihai Oltean, Solving the Hamiltonian path problem with a light-based computer (2007), arXiv:0708.1512; Natural Computing, Volume 7, Number 1 / March, 2008.
  46. Mihai Oltean and Oana Muntean, Exact Cover with light (2007), arXiv:0708.1962; New Generation Computing, Volume 26, Number 4 / August, 2008.
  47. Omey, Edward; Van Gulck, Stefan, On the number of orderings of n items. Bull. Belg. Math. Soc. Simon Stevin 14 (2007), no. 2, 229-237.
  48. J. D. Onera and F. Smarandache, An introduction to DSmT for information fusion, New Mathematics and Natural Computation, Volume 08, Issue 03, November 2012, doi:10.1142/S179300571250007X
  49. Lawrence Ong, Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers, arXiv preprint arXiv:1401.7369, 2014
  50. Lawrence Ong, Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers, arXiv preprint arXiv:1606.05982, 2016
  51. Onofri, E.; Veneziano, G.; Wosiek, J. Supersymmetry and combinatorics. Comm. Math. Phys. 274 (2007), no. 2, 343-355.
  52. Kritkhajohn Onphaeng and Prapanpong Pongsriiam. Jacobsthal and Jacobsthal-Lucas Numbers and Sums Introduced by Jacobsthal and Tverberg. Journal of Integer Sequences, Vol. 20 (2017), Article 17.3.6.
  53. F. Oort, Prime numbers, 2013, PDF
  54. J. D. Opdyke, doi:10.1007/s10852-009-9116-2 A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions, J. Math. Model. Algor. 9 (2010) 53-97
  55. Michal Opler, Major index distribution over permutation classes, preprint arXiv:1505.07135 (A008302)
  56. A. Orbanic et al., A note on enumeration of one-vertex maps, ARS MATHEMATICA CONTEMPORANEA, 3 (2010) 1-12 HTML
  57. David Orden, In how many ways can you fold a strip of stamps?,, 2014.
  58. E. Ordentlich and R. M. Roth, The Asymptotic Capacity of Multi-Dimensional Runlength-Limited Constraints and Independent Sets in Hypergraphs, HP Labs 2002 Technical Report.
  59. Ordentlich, Erik; Roth, Ron M., Independent sets in regular hypergraphs and multidimensional runlength-limited constraints. SIAM J. Discrete Math. 17 (2004), no. 4, 615-623 .
  60. Erik Ordentlich, Ron M. Roth, Gadiel Seroussi, On q-ary Antipodal Matchings and Applications, 2012;
  61. Orellana, Rosa C. On partition algebras for complex reflection groups. J. Algebra 313 (2007), no. 2, 590-616.
  62. Orlitsky, Alon; Santhanam, Narayana P. Speaking of infinity. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2215-2230.
  63. Orlitsky, Alon; Santhanam, Narayana P.; Zhang, Junan, Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inform. Theory 50 (2004), no. 7, 1469-1481.
  64. Laurent Orseau, Levi H. S. Lelis, Tor Lattimore, Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees, arXiv:1906.03242 [cs.AI], 2019. (A006519)
  65. Laurent Orseau, Levi H. S. Lelis, Tor Lattimore, Théophane Weber, Single-Agent Policy Tree Search With Guarantees, Advances in Neural Information Processing Systems, arXiv:1811.10928 [cs.AI], 2018. Also in 32nd Conference on Neural Information Processing Systems (NIPS 2018), Montréal, Canada. PDF (A006519, A182105)
  66. Manuel D. Ortigueira, J. A. Tenreiro Machado, New discrete-time fractional derivatives based on the bilinear transformation: Definitions and properties, Journal of Advanced Research (2020). doi:10.1016/j.jare.2020.02.011
  67. M. Ortolano, M. Abrate, L. Callegaro, On the synthesis of Quantum Hall Array Resistance Standards, arXiv preprint arXiv:1311.0756, 2013.
  68. Mercedes Orús-Lacort, Fermat numbers are not prime numbers for n ≤ 5, (2020). doi:10.13140/RG.2.2.31221.73449 (A023394, A050922)
  69. Robert Osburn, Research Statement.
  70. Robert Osburn and Brundaban Sahu, A supercongruence for generalized Domb numbers, PDF and Funct. Approx. Comment. Math. 48 (1) (2013) 29-36 doi:10.7169/facm/2013.48.1.3
  71. Osburn, Robert; Sahu, Brundaban Supercongruences for Apéry-like numbers. Adv. in Appl. Math. 47 (2011), no. 3, 631-638.
  72. Robert Osburn, Armin Straub, Wadim Zudilin. A modular supercongruence for 6F5: an Apéry-like story. arXiv:1701.04098 [math.NT], 2017.
  73. Wilbert Osmond, Growing Trees in Padovan Sequence For The Enhancement of L-System Algorithm,, 2014.
  74. Roy Oste and Joris Van der Jeugt, Motzkin paths, Motzkin polynomials and recurrence relations, The Electronic Journal of Combinatorics, 22(2) (2015), #P2.8 1. (A001006)
  75. P. R. J. Ostergard and V. H. Pettersson, Enumerating Perfect Matchings in n-Cubes, PDF, doi:10.1007/s11083-012-9279-8, Oder 30 (2013) 821-835.
  76. Patric R.J. Östergård, Ville H. Pettersson, On the maximum length of coil-in-the-box codes in dimension 8, Discrete Applied Mathematics, 2014; doi:10.1016/j.dam.2014.07.010
  77. P. R. J. Ostergard and H. Ville, Exhaustive Search for Snake-in-the-Box Codes, Preprint, PDF doi:10.1007/s00373-014-1423-3, Graphs and Combinatorics, May 2014
  78. Ahmet Öteleş, On the sum of Pell and Jacobsthal numbers by the determinants of Hessenberg matrices, AIP Conference Proceedings 1863, 310003 (2017). doi:10.1063/1.4992479
  79. Ahmet Öteleş, Intersecting semi-disks and the synergy of three quadratic forms, An. Şt. Univ. Ovidius Constantą, (2019) Vol. 27, Issue 2, 109-120. doi:10.2478/auom-2019-0022, also PDF (A000129, A000225, A001608)
  80. Ahmet Öteleş, Zekeriya Y. Karata, Diyar O. Mustafa Zangana, Jacobsthal Numbers and Associated Hessenberg Matrices, Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.5. HTML (A000045, A000129, A001045)
  81. J. A. Oteo and J. Ros, "A Fractal Set from the Binary Reflected Gray Code", J. Phys. A: Math Gen. 38 (2005) 8935-8949
  82. Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira and Ling Cheng, Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes, Designs, Codes and Cryptography, Volume 48, Number 2 / August, 2008.
  83. Koji Ouchi and Ryuhei Uehara, Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns, In: Poon SH., Rahman M., Yen HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2017. Lecture Notes in Computer Science, vol 10167, pp. 19-29. doi:10.1007/978-3-319-53925-6_2
  84. D. Oudrar, Sur l'énumération de structures discrètes, une approche par la théorie des relations, Thesis (in French), arXiv:1604.05839 [math.CO], 2016.
  85. D. Oudrar, M. Pouzet, Profile and hereditary classes of ordered relational structures, arXiv preprint arXiv:1409.1108, 2014
  86. Sergei Ovchinnikov, Discrete piecewise linear functions (2008); arXiv:0807.3364 and doi:10.1016.j.ejc.2009.11.005 Eur. J. Combinat. 31 (5) (2010) 1283-1294.
  87. Anthony Overmars, Survey of RSA Vulnerabilities, Modern Cryptography - Theory, Technology, Adaptation and Integration (2019, working title), IntechOpen. doi:10.5772/intechopen.84852 (A000040, A002110)
  88. Valentin Ovsienko, Partitions of unity in SL(2,ℤ), negative continued fractions, and dissections of polygons, arXiv:1710.02996 [math.CO], 2017. (A293492)
  89. V Ovsienko, S Tabachnikov, Affine Hopf fibration, arXiv preprint arXiv:1511.08894, 2015
  90. Arzu Özkoç, Some algebraic identities on quadra Fibona-Pell integer sequence, Advances in Difference Equations, 2015, 2015:148 (A000045, A000032, A000129, A002203)
  91. L. Ozsvart, Counting ordered graphs that avoid certain subgraphs, Discr. Math., 339 (2016), 1871-1877.
  92. M. Öztürk, M. Pirlot, A. Tsoukias, Representign preferences using intervals, Art. Intell. 175 (2011) 1194-1222 doi:10.1016/j.artint.2010.11.013

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.