This site is supported by donations to The OEIS Foundation.

CiteO

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.

References

  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. Kevin O'Bryant, Bh-Sets and Rigidity, arXiv:2312.10910 [math.NT], 2023. (A005282)
  5. Colm O'Dunlaing, In-order traversal of splay trees, Electronic Notes in Theoretical Computer Science, Volume 74, October 2003, Pages 134-157.
  6. Rory O'Dwyer, Stepping Stone Problem on Graphs, Math. Enthus. (2024) Vol. 21, No. 1-2, 42-53. PDF
  7. Cooper O'Kuhn and Todd Fellman, The Mondrian Puzzle: A Bound Concerning the M(n) = 0 Case, arXiv:2006.12547 [math.NT], 2020. See also Integers (2021) Vol. 21, #A37. Abstract (A276523)
  8. Daniel O’Malley, Manish Bhattarai, Javier Santos, Benchmarking Large Language Models with Integer Sequence Generation Tasks, arXiv:2411.04372 [cs.LG]: https://arxiv.org/abs/2411.04372
  9. Jason O'Neill, On the poset and asymptotics of Tesler Matrices, arXiv:1702.00866 [math.CO], 2017.
  10. Patrick Kaileigh O'Neill, Gene regulation from information theory to biophysics, Dissertation, University of Maryland, Baltimore County, 2016.
  11. Patrick K. O'Neill, I Erill, Parametric bootstrapping for biological sequence motifs, BMC Bioinformatics, (2016) 17:406; doi:10.1186/s12859-016-1246-8
  12. Edwin O'Shea, M-partitions: Optimal partitions of weight for one scale pan (2003), arXiv:math/0311230.
  13. Owen O'Shea, The Call of Coincidence: Mathematical Gems, Peculiar Patterns, and More Stories of Numerical Serendipity, Rowman & Littlefield, 2023, ISBN 9781633889279. (A001333, A002407 p. 12, A048386 p. 31)
  14. J. R. Oaks, An Improved Approximate-Bayesian Model-choice Method for Estimating Shared Evolutionary History, arXiv preprint arXiv:1402.6303, 2014
  15. 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
  16. M. A. A. Obaid, S. K. Nauman, W. M. Fakieh, C. M. Ringel, The numbers of support-tilting modules for a Dynkin algebra, http://www.math.uni-bielefeld.de/~ringel/opus/jeddah.pdf, 2014 and J. Int. Seq. 18 (2015) 15.10.6
  17. 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
  18. N. Ochiumi, On the total sum of number of nodes covering a given number of leaves in an unordered binary tree; PDF.
  19. Adrian Ocneanu, On the inner structure of a permutation: bicolored partitions and Eulerians, trees and primitives; arXiv preprint arXiv:1304.1263, 2013
  20. 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).
  21. A. M. Odlyzko, The rapid evolution of scholarly communication, Learned Publishing, Volume 15 no. 1, pp. 7-19.
  22. 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 http://www.dtc.umn.edu/~odlyzko/misc/experimental-math.pdf. Published in Amer. Math. Monthly, 118 (2011), 946-951.
  23. Fidel Oduol, On some properties of generalized Fibonacci polynomials, Open J. of Disc. Appl. Math. (2020) Vol. 3, Issue 3, 4-13. PDF
  24. Jakob Oesinghaus, Quasi-symmetric functions and the Chow ring of the stack of expanded pairs, arXiv:1806.10700 [math.AG], 2018. (A059966)
  25. J. Ofverstedt, Water Retention on Magic Squares with Constraint-Based Local Search, Department of Information Technology, Uppsala University, Report IT 12 018, June 2012.
  26. 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
  27. 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.
  28. 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].
  29. Seungsang Oh, Number of Dominating Sets in Cylindric Square Grid Graphs, Graphs and Combinatorics (2021) Vol. 37, 1357–1372. doi:10.1007/s00373-021-02323-8
  30. Seunghwan Oh, John R. Schmitt, and Xianzhi Wang, Repeatedly applying the Combinatorial Nullstellensatz for Zero-sum Grids to Martin Gardner's minimum no-3-in-a-line problem, arXiv:2401.03119 [math.CO], 2024. (A219760 p. 3)
  31. 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.
  32. 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; http://www.diva-portal.org/smash/get/diva2:721238/FULLTEXT01.pdf.
  33. Hidefumi Ohsugi, Akiyoshi Tsuchiya, h*-Polynomials of Locally Anti-Blocking Lattice Polytopes and Their γ-Positivity, arXiv:1906.04719 [math.CO], 2019. See also Discrete & Computational Geometry (2020), doi:10.1007/s00454-020-00236-6. (A204621)
  34. H. Ohtsuka, S. Nakamura A new formula for the sum of the sixth powers of Fibonacci numbers, vixra:0910.0012
  35. 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
  36. 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.
  37. 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
  38. Okhotin, Alexander Unambiguous finite automata over a unary alphabet. Inform. and Comput. 212 (2012), 15-36.
  39. Isaac Owino Okoth, Bijections of k-plane trees, Open J. Discret. Appl. Math. (2022) Vol. 5, No. 1, 29-35. doi:10.30538/psrp-odam2022.0068 (A001764, A006013)
  40. Karolina Okrasa, Paweł Rzążewski, Intersecting edge distinguishing colorings of hypergraphs. arXiv:1804.10470 [cs.DM]. (A000670)
  41. Andrei Okounkov, Rhymes in primes, Proc. Int'l Cong. Math. (2022) Vol 1. doi:10.4171/ICM2022/202 (A006880)
  42. İnci Okumuş, Yüksel Soykan, On a Generalized Tribonacci Sequence, Journal of Progressive Research in Mathematics (2018) Vol. 14, No. 3, 2413-2418. PDF
  43. İ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
  44. Jorge Alberto Olarte, Francisco Santos, Hypersimplicial subdivisions, arXiv:1906.05764 [math.CO], 2019. (A060595)
  45. Gloria Olive, Catalan numbers revisited, Journal of Mathematical Analysis and Applications, Volume 111, Issue 1, October 1985, Pages 201-235.
  46. 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)
  47. 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.
  48. A. M. Oller-Marcen, On arithmetic numbers, Arxiv preprint arXiv:1206.1823, 2012
  49. 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
  50. R. L. Ollerton. Fibonacci cubes. Intl J. Math. Educ. Sci. Techn. 37 (6) (2006) 754-756 doi:10.1080/00207390600712521
  51. Richard L. Ollerton, Counting i-paths, Slides of talk presented at Thirteenth International Conference on Fibonacci Numbers and Their Applications, University of Patras (Greece), 2008. [See A001181 for a copy]
  52. Richard L. Ollerton, Catalan numbers and non-intersecting lattice paths, Preprint April 4 2021
  53. Richard L. Ollerton and Anthony G. Shannon, Some properties of generalized Pascal squares and triangles, Fib. Q., 36 (1998), 98-109.
  54. R. L. Ollerton and A. G. Shannon, Extensions of generalized binomial coefficients (broken link), QM&MS Research Reports (2001). Also Ollerton R.L., Shannon A.G. (2004) Extensions of Generalized Binomial Coefficients. In: Howard F.T. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-0-306-48517-6_19
  55. Tahir Ölmez, Can the Golden Ratio Numbers in Biochemistry and Mathematics Have a Common Explanation with Nucleotide Bases?, Open Access Lib. J. (2023) Vol. 10, e9716. doi:10.4236/oalib.1109716 (A001622)
  56. Hans Olofsen, Blending functions based on trigonometric and polynomial approximations of the Fabius function, The Arctic University of Norway (Narvik, 2019). PDF (A005578)
  57. Trevor Vincent Olsen, Distance Related Graph Invariants in Triangulations and Quadrangulations of the Sphere, Ph. D. Dissertation, University of South Carolina (2020). Preview (A001400, A014125)
  58. 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.
  59. Mihai Oltean, Solving the Hamiltonian path problem with a light-based computer (2007), arXiv:0708.1512; Natural Computing, Volume 7, Number 1 / March, 2008.
  60. Mihai Oltean and Oana Muntean, Exact Cover with light (2007), arXiv:0708.1962; New Generation Computing, Volume 26, Number 4 / August, 2008.
  61. 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.
  62. Neşe Ömür, Gökhan Soydan, Yücel Türker Ulutaş, Yusuf Doğru, On triangles with coordinates of vertices from the terms of the sequences {Ukn} and {Vkn}, Matematičke Znanosti, Vol. 24 = 542(2020), 15-27. doi:10.21857/ydkx2cwq49 (A000129, A002203)
  63. 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
  64. Darren C. Ong, Abstract art generated by Thue-Morse correlation functions, arXiv:2209.11162 [cond-mat.stat-mech], 2022. (A010060)
  65. Lawrence Ong, Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers, arXiv preprint arXiv:1401.7369, 2014
  66. Lawrence Ong, Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers, arXiv preprint arXiv:1606.05982, 2016.
  67. Luca Onnis, On a variant of the happy numbers and their generalizations, arXiv:2203.03381 [math.GM], 2022. (A007770)
  68. Onofri, E.; Veneziano, G.; Wosiek, J. Supersymmetry and combinatorics. Comm. Math. Phys. 274 (2007), no. 2, 343-355.
  69. 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.
  70. F. Oort, Prime numbers, 2013, PDF
  71. 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
  72. Michal Opler, Major index distribution over permutation classes, preprint arXiv:1505.07135 (A008302)
  73. Michal Opler, Pavel Valtr, and Tung Anh Vu, On the Arrangement of Hyperplanes Determined by n Points, EuroCG (39th European Workshop on Computational Geometry, Barcelona, Spain 2023) Session 7B, Talk 1, Vol. 54, No. 6. PDF (A002817, A037255, A055503)
  74. Mārtiņš Opmanis, Diāna Siliņa, Sandra Siliņa, and Pēteris Pakalns, Team Competition in Informatics and Mathematics “Cēsis”, Vilnius Univ. (Lithuania, 2023) Vol. 17, 173-188. doi:10.15388/ioi.2023.13 (A226239)
  75. A. Orbanic et al., A note on enumeration of one-vertex maps, ARS MATHEMATICA CONTEMPORANEA, 3 (2010) 1-12 HTML
  76. David Orden, In how many ways can you fold a strip of stamps?, http://mappingignorance.org/2014/07/07/many-ways-can-fold-strip-stamps/, 2014.
  77. 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.
  78. 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 .
  79. Erik Ordentlich, Ron M. Roth, Gadiel Seroussi, On q-ary Antipodal Matchings and Applications, 2012; http://www.hpl.hp.com/techreports/2012/HPL-2012-113.pdf.
  80. Orellana, Rosa C. On partition algebras for complex reflection groups. J. Algebra 313 (2007), no. 2, 590-616.
  81. Rosa Orellana, Nancy Wallace, and Mike Zabrocki, Representations of the quasi-partition algebras, arXiv:2306.17326 [math.RT], 2023. (A000110, A207978)
  82. Orlitsky, Alon; Santhanam, Narayana P. Speaking of infinity. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2215-2230.
  83. 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.
  84. Katherine Ormeño Bastías, Paul Martin, and Steen Ryom-Hansen, On the spherical partition algebra, arXiv:2402.01890 [math.RT], 2024. (A002774)
  85. Ronald Orozco López, Solution of the Differential Equation y(k) = eay, Special Values of Bell Polynomials and (k,a)-Autonomous Coefficients, Autonomous values of Bell polynomials, Universidad de los Andes (Colombia 2021). PDF (A000111, A000295, A000367, A002105, A002445, A007548, A018893, A027778, A050534, A336020)
  86. Ronald Orozco López, Deformed Differential Calculus on Generalized Fibonacci Polynomials, arXiv:2211.04450 [math.CO], 2022. (A001787, A045873, A088137, A107920, A214733)
  87. Ronald Orozco López, Generating Functions of Generalized Simplicial Polytopic Numbers and (s,t)-Derivatives of Partial Theta Function, arXiv:2408.08943 [math.CO], 2024. (A001654, A001655, A006095, A006096, A084158, A084175, A099930)
  88. 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)
  89. 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)
  90. 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
  91. M. Ortolano, M. Abrate, L. Callegaro, On the synthesis of Quantum Hall Array Resistance Standards, arXiv preprint arXiv:1311.0756, 2013.
  92. Mercedes Orús-Lacort, Fermat numbers are not prime numbers for n ≤ 5, (2020). doi:10.13140/RG.2.2.31221.73449 (A023394, A050922)
  93. Robert Osburn, Research Statement.
  94. 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
  95. Osburn, Robert; Sahu, Brundaban Supercongruences for Apéry-like numbers. Adv. in Appl. Math. 47 (2011), no. 3, 631-638.
  96. Robert Osburn, Armin Straub, Wadim Zudilin. A modular supercongruence for 6F5: an Apéry-like story. arXiv:1701.04098 [math.NT], 2017.
  97. N. N. Osipov, On calculation of finite trigonometric sums, Mat. Pros. Ser. 3, vol. 23, pages 174-208 (2019).
  98. Wilbert Osmond, Growing Trees in Padovan Sequence For The Enhancement of L-System Algorithm, http://cys.or.id/docs/icys2014_abstract_wilbert_osmond.pdf, 2014.
  99. 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)
  100. 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.
  101. 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
  102. 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
  103. 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
  104. Öteleş, Ahmet doi:10.2298/FIL1715809O On the number of perfect matchings for some certain types of bipartite graphs, Filomat 31, No. 15, 4809-4818 (2017).
  105. 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)
  106. 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)
  107. J. A. Oteo and J. Ros, "A Fractal Set from the Binary Reflected Gray Code", J. Phys. A: Math Gen. 38 (2005) 8935-8949.
  108. Giorgio Ottaviani, Luca Sodomaco, Emuanuele Ventura, Asymptotics of degrees and ED degrees of Segre products, arXiv:2008.11670 [math.AG], 2020. (A176097)
  109. Nadia Otten, Optimal design of random knockout tournaments, master's dissertation, Liège Université (Belgium, 2020). PDF (A000108, A001190)
  110. 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.
  111. 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
  112. 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.
  113. D. Oudrar, M. Pouzet, Profile and hereditary classes of ordered relational structures, arXiv preprint arXiv:1409.1108, 2014.
  114. Djamila Oudrar, Maurice Pouzet, and Imed Zaguia, Minimal prime ages, words and permutation graphs, arXiv:2206.01557 [math.CO], 2022. (A111111)
  115. Stéphane Ouvry and Alexios Polychronakos, Lattice walk area combinatorics, some remarkable trigonometric sums and Apéry-like numbers, arXiv:2006.06445 [math-ph], 2020. (A006077, A081085, A143583)
  116. Stéphane Ouvry and Alexios P. Polychronakos, Exclusion statistics for particles with a discrete spectrum, arXiv:2105.14042 [cond-mat.stat-mech], 2021. (A227532, A227543)
  117. Stéphane Ouvry and Alexios P. Polychronakos, Signed area enumeration for lattice walks, Séminaire Lotharingien de Combinatoire (2023) Vol. 87B. PDF (A060801)
  118. 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.
  119. K. J. Overholt, Efficiency of the Fibonacci search method, Nordisk Tidskr. Informationsbehandling (BIT 1973) Vol. 13, 92-96. doi:10.1007/BF01933527 (A006478)
  120. Lars Magnus Øverlier, Highly Composite Numbers, arXiv:2305.14350 [math.NT], 2023. (A189394)
  121. Anthony Overmars, Survey of RSA Vulnerabilities, Modern Cryptography - Theory, Technology, Adaptation and Integration (2019, working title), IntechOpen. doi:10.5772/intechopen.84852 (A000040, A002110)
  122. Anthony Overmars and Sitalakshmi Venkatraman, A New Method for Factorizing Semi-Primes Using Simple Polynomials, 3rd Int'l Conf. on Research in Applied Science (2020). PDF (A000217, A000290)
  123. Valentin Ovsienko, Partitions of unity in SL(2,ℤ), negative continued fractions, and dissections of polygons, arXiv:1710.02996 [math.CO], 2017. (A293492)
  124. Valentin Ovsienko, Towards quantized complex numbers: q-deformed Gaussian integers and the Picard group, arXiv:2103.10800 [math.QA], 2021. (A008312, A053117)
  125. Valentin Ovsienko, Shadow sequences of integers, from Fibonacci to Markov and back, arXiv:2111.02553 [math.CO], 2021
  126. V. Ovsienko, S. Tabachnikov, Affine Hopf fibration, arXiv preprint arXiv:1511.08894, 2015.
  127. V. Ovsienko, Serge Tabachnikov, Hopf fibrations and Hurwitz-Radon numbers, Math. Intell. 38 (2016) 11-18 doi:10.1007/s00283-015-9618-x
  128. Art B. Owen, A First Course in Experimental Design Notes from Stat 263/363, Stanford University (2020). See pp. 50, 139. PDF (A000315, A007299)
  129. Arzu Özkoç, Some algebraic identities on quadra Fibona-Pell integer sequence, Advances in Difference Equations, 2015, 2015:148 (A000045, A000032, A000129, A002203)
  130. Paul W. Oxby, A Function Based on Chebyshev Polynomials as an Alternative to the Sinc Function in FIR Filter Design, arXiv:2011.10546 [eess.SP], 2020. (A023900, A046970)
  131. Engin Özkan and Hakan Akkuş, Copper ratio obtained by generalizing the Fibonacci sequence, AIP Advances (2024). doi:10.1063/5.0207147. (A001622, A014176, A098316, A098317, A098318, A176398, A176439, A176458, A176522, A182097)
  132. Engin Özkan, Bahar Kuloǧlu, and James Peters, k-Narayana sequence self-similarity, hal-03242990 [math.CO], 2021. Abstract (A000108, A058278, A097333)
  133. L. Ozsvart, Counting ordered graphs that avoid certain subgraphs, Discr. Math., 339 (2016), 1871-1877.
  134. 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.
Retrieved from "https://oeis.org/w/index.php?title=CiteO&oldid=1661684"