This site is supported by donations to The OEIS Foundation.


From OeisWiki
Jump to: navigation, search

"... each entry in the OEIS chronicles a mathematical theorem, and the integer sequence associated to the entry is that theorem's fingerprint. The OEIS is arguably the most established fingerprint database for theorems to date." [Sara C. Billey and Bridget E. Tenner, 2013]

"Preliminary work using [OEIS] assisted in the identification of the closed formulae in the proposition." [R. Biswal et al., 2015]

"In creating this table, we discovered, by way of the OEIS database, that the generating function for \mu = (5,2) is identical to the generating function for the number of so-called metacyclic p-groups for prime p." [Jonathan Bloom and Nathan McNew, 2019]

" least 39 entries in Sloane's OEIS were found containing sequences whose generating functions satisfy Riccati equations, including some entries related to the families of indecomposable combinatorial objects, moments of probability distributions, chord diagrams, Feynman diagrams, etc." [Olivier Bodini et al., 2018]

"OEIS is an amazing instrumental resource, ... a model both for curation and for moderation." [J. M. Borwein, 2016]

"Experimental data combined with an OEIS search leads us to the following conjecture...." [Benjamin Braun and Fu Liu, 2018]

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 Bi to Bz.
  • 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. Bialecki, Z. Czechowski, Random Domino Automaton: Modeling Macroscopic Properties by Means of Microscopic Rules, in Achievements, History and Challenges in Geophysics, GeoPlanet: Earth and Planetary Sciences, 2014, pp. 223-241; doi:10.1007/978-3-319-07599-0_13
  2. Min Bian, Olivia X. M. Yao, Yan Zhang, Alina F. Y. Zhao, Proof of a conjecture of Z. W. Sun, Contributions to Discrete Mathematics (2019) Vol. 14, No. 1, 214-221. doi:10.11575/cdm.v14i1.62700 (A295112)
  3. M. P. Bianchi, H.-J. Bockenhauer, J. Hromkovic and L. Keller, Online Coloring of Bipartite Graphs With and Without Advice, PDF, Algorithmica 70 (2014) 92-111 doi:10.1007/s00453-013-9819-7.
  4. Philippe Biane (LIGM), Laver tables and combinatorics, arXiv:1810.00548 [math.CO], 2018. (A018819)
  5. P. Biane, P. Dehornoy, Dual Garside structure of braids and free cumulants of products, arXiv preprint arXiv:1407.1604, 2014
  6. Mark Jaybee S. Biano, Bernadette S. Estoque, Lynden Aaron D. Galera, Maria Elena S. Rulloda, Daisy Ann A. Disu, On Weird Numbers, DMMMSU-CAS Science Monitor (2016-2017) Vol. 15 No. 2, 157-162. PDF (A006037, A258250)
  7. Allan Bickle, Zhongyuan Che, Wiener indices of maximal k-degenerate graphs, arXiv:1908.09202 [math.CO], 2019. (A000292, A002623, A014125, A122046, A122047)
  8. Bidkhori, Hoda; Sullivant, Seth Eulerian-Catalan numbers. Electron. J. Combin. 18 (2011), no. 1, Paper 187, 10 pp.
  9. Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey Shallit, Rollercoasters and Caterpillars, arXiv:1801.08565 [cs.CG], 2018. (A277556)
  10. Yonah Biers-Ariel, A New Quantity Counted by OEIS Sequence A006012, arXiv:1706.07064 [math.CO], 2017.
  11. Yonah Biers-Ariel, "The Number of Permutations Avoiding a Set of Generalized Permutation Patterns", Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.3. PDF
  12. Yonah Biers-Ariel, A Generalization of the 'Raboter' Operation, arXiv:1902.06354 [math.CO], 2019. (A318921)
  13. Yonah Biers-Ariel, Flexible Schemes and Beyond: Experimental Enumeration of Pattern Avoidance Classes, Ph. D. Dissertation, Rutgers University (2020). Preview (A006012)
  14. Bigeni, Ange, Combinatorial study of Dellac configurations and q-extended normalized median Genocchi numbers. Electron. J. Combin. 21 (2014), no. 2, Paper 2.32, 27 pp.
  15. Bigeni, Ange. "A bijection between the irreducible k-shapes and the surjective pistols of height k-1." arXiv preprint arXiv:1402.1383 (2014). Also Discrete Math., 338 (2015), 1432-1448.
  16. Ange Bigeni, Combinatorial interpretations of the Kreweras triangle in terms of subset tuples, arXiv:1712.01929 [math.CO], 2017. (A000366, A005439, A110501)
  17. Ange Bigeni, A generalization of the Kreweras triangle through the universal sl2 weight system, arXiv:1712.05475 [math.CO], 2017. (A000366, A005439, A110501)
  18. Ange Bigeni, A generalization of the Kreweras triangle through the universal sl_2 weight system, Journal of Combinatorial Theory, Series A (2019) Vol. 161, 309-326. doi:10.1016/j.jcta.2018.08.005 (A000366, A005439, A110501)
  19. Ange Bigeni, Evgeny Feigin, Poincaré polynomials of the degenerate flag varieties of type C, arXiv:1804.10804 [math.CO], 2018. (A005773, A098279)
  20. Ange Bigeni, Evgeny Feigin, Symmetric Dellac configurations, arXiv:1808.04275 [math.CO], 2018. Also "Symmetric Dellac configurations and symplectic/orthogonal flag varieties", Linear Algebra and its Applications (2019) Vol. 573, 54-79. doi:10.1016/j.laa.2019.03.015 (A000366, A000657, A002832, A098278, A098279)
  21. Oliver Biggar, Mohammad Zamani, Iman Shames, A principled analysis of Behavior Trees and their generalisations, arXiv:2008.11906 [cs.AI], 2020. (A006318)
  22. Frédéric Bihan, Francisco Santos, Pierre-Jean Spaenlehauer, A Polyhedral Method for Sparse Systems with many Positive Solutions, arXiv:1804.05683 [math.CO], 2018. (A008288, A102413, A110110)
  23. Colin Bijaoui, Hans U. Boden, Beckham Myers, Robert Osburn, William Rushworth, Aaron Tronsgard, Shaoyang Zhou, Generalized Fishburn numbers and torus knots, arXiv:2002.00635 [math.NT], 2020. (A022493)
  24. G. Bilgici, Generalized order-k Pell-Padovan-like numbers by matrix methods, Pure and Applied Mathematics Journal, 2013; 2(6): 174-178; Published online November 30, 2013 (; doi:10.11648/j.pamj.20130206.11
  25. Göksal Bilgici, Tuncay Deniz Şentürk, Some Addition Formulas for Fibonacci, Pell and Jacobsthal Numbers, Annales Mathematicae Silesianae (2019) Vol. 33, 55-65. doi:10.2478/amsil-2019-0005 (A003462)
  26. Louis J. Billera, Sara C. Billey, Vasu Tewari, Boolean product polynomials and Schur-positivity, arXiv:1806.02943 [math.CO], 2018. (A000522, A034997)
  27. L. J. Billera, J. T. Moore, C. D. Moraites, Y. Wang and K. Williams, Maximal unbalanced families, arXiv preprint arXiv:1209.2309, 2012
  28. S. C. Billey, K. Burdzy and B. E. Sagan, Permutations with given peak set, Arxiv preprint arXiv:1209.0693, 2012 and J. Int. Seq. 16 (2013) #13.6.1
  29. S. Billey, A. Crites, Rational smoothness and affine Schubert varieties of type A. Proc. FPSAC 2011. p 171-182
  30. S. Billey, A. Crites, doi:10.1016/j.jalgebra.2012.03.019 Pattern characterization of rationally smooth affine Schubert varieties of type A. J. Alg. 361 (2012) 107-133
  31. S. C. Billey, M. Konvalinka, and F. E. Matsen, On the enumeration of tanglegrams and tangled chains, arXiv:1507.04976 (2015).
  32. Sara Billey, Matjaž Konvalinka, Frederick A. Matsen IV, On trees, tanglegrams, and tangled chains, hal-02173394 [math.CO], 2020. Abstract (A000123, A001190, A258620)
  33. Sara C. Billey, M Konvalinka, TK Petersen, W Slofstra, B. E. Tenner, Parabolic double cosets in Coxeter groups, El. J. Combin. 25 (1) (2018) P.23. See also hal-02173393 [math.CO], 2020. Abstract (A000670, A120733)
  34. Sara C. Billey, Matjaž Konvalinka, Joshua P. Swanson, Tableaux posets and the fake degrees of coinvariant algebras, arXiv:1809.07386 [math.CO], 2018. (A008302, A318806)
  35. Sara C. Billey, Matjaž Konvalinka, Joshua P. Swanson, Asymptotic normality of the major index on standard tableaux, arXiv:1905.00975 [math.CO], 2019. (A002457, A008642, A266755)
  36. Sara C. Billey, Peter R. W. McNamara, The contributions of Stanley to the fabric of symmetric and quasisymmetric functions, preprint arXiv:1505.01115 (A005118)
  37. Sara C. Billey, Brendon Rhoades, Vasu Tewari, Boolean product polynomials, Schur positivity, and Chern plethysm, arXiv:1902.11165 [math.CO], 2019. (A005130, A306397)
  38. Sara C. Billey and Bridget E. Tenner, Fingerprint databases for theorems, arXiv:1304.3866, (2013); Notices Amer. Math. Soc., 60 (No. 6, Sept. 2013), 1034-1039. [... each entry in the OEIS chronicles a mathematical theorem, and the integer sequence associated to the entry is that theorem's fingerprint. The OEIS is arguably the most established fingerprint database for theorems to date.]
  39. Stefano Bilotta, Variable-length Non-overlapping Codes, arXiv preprint arXiv:1605.03785, 2016
  40. S. Bilotta, E. Grazzini, E. Pergola, Enumeration of Two Particular Sets of Minimal Permutations, J. Int. Seq. 18 (2015) 15.10.2
  41. S. Bilotta, E. Pergola and R. Pinzani, A new approach to cross-bifix-free sets, Arxiv preprint arXiv:1112.3168, 2011
  42. S. Bilotta, E. Pergola, R. Pinzani, S. Rinaldi, Recurrence relations versus succession rules, arXiv preprint arXiv:1301.2967, 2013
  43. S. Bilotta, E. Pergola, R. Pinzani, S. Rinaldi, Recurrence Relations, Succession Rules, and the Positivity Problem, in Language and Automata Theory and Applications, 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, Pages 499-510, Lecture Notes Comp. Sci. Vol. 8977.
  44. Yu. Bilu, P. Habegger, L. Kühne, Effective bounds for singular units. arXiv:1805.07167 [math.NT], 2018. (A002182, A004394)
  45. Yuri Bilu, Diego Marques, Alain Togbé, Generalized Cullen Numbers in Linear Recurrence Sequences, arXiv:1806.09441 [math.NT], 2018. (A002064)
  46. Vladislav Bína, Jiří Přibil, Note on enumeration of labeled split graphs, Comment. Math. Univ. Carolin. 56,2 (2015) 133 –137. (A047864)
  47. Aram Bingham, Commutative n-ary Arithmetic, University of New Orleans Theses and Dissertations, Paper 1959, 2015. (A003215)
  48. Aram Bingham, Ternary arithmetic, factorization, and the class number one problem, arXiv:2002.02059 [math.NT], 2020. (A014556)
  49. Aram Bingham, Özlem Uğurlu, Sects and lattice paths over the Lagrangian Grassmannian, arXiv:1903.07229 [math.CO], 2019. (A083886)
  50. Aram Bingham, Özlem Uğurlu, Sects, rooks, pyramids, partitions and paths for type DIII clans, arXiv:1907.08875 [math.CO], 2019. (A000085, A000902)
  51. R. S. Bird, On building cyclic and shared structures in Haskell, Formal Aspects of Computing, 24 (2012), 609-621; doi:10.1007/s00165-012-0243-6
  52. S. Birdsong and G. Hetyei, A Gray Code for the Shelling Types of the Boundary of a Hypercube, Arxiv preprint arXiv:1111.4710, 2011; Birdsong, Sarah; Hetyei, Gábor. A Gray code for the shelling types of the boundary of a hypercube. Discrete Math. 313 (2013), no. 3, 258--268. MR2995390.
  53. D Birmajer, JB Gil, PRW McNamara, MD Weiner, Enumeration of colored Dyck paths via partial Bell polynomials, arXiv preprint arXiv:1602.03550, 2016
  54. D. Birmajer, J. B. Gil, M. D. Weiner, Linear recurrence sequences via Bell polynomials, arXiv preprint arXiv:1405.7727, 2014
  55. Daniel Birmajer, Juan B. Gil, Michael D. Weiner, Linear recurrence sequences with indices in arithmetic progression and their sums, preprint arXiv:1505.06339, 2015. (A001353, A003500, A000073, A001644, A000931, A001608, A007420, A001610, A073728)
  56. D. Birmajer, J. B. Gil, M. D. Weiner, Linear Recurrence Sequences and Their Convolutions via Bell Polynomials, Journal of Integer Sequences, 18 (2015), #151.1.2.
  57. D. Birmajer, J. B. Gil, M. D. Weiner, Colored partitions of a convex polygon by noncrossing diagonals, arXiv preprint arXiv:1503.05242, 2015, Discr. Math. 340 (2017) 563 doi:10.1016/j.disc.2016.12.006
  58. D. Birmajer, J. B. Gil, M. D. Weiner, <a href="">n the Enumeration of Restricted Words over a Finite Alphabet </a>, J. Int. Seq. 19 (2016) # 16.1.3
  59. Daniel Birmajer, Juan B. Gil, Michael D. Weiner, (an + b)-color compositions, arXiv:1707.07798 [math.CO], 2017.
  60. Daniel Birmajer, Juan B. Gil, Michael D. Weiner, Bounce statistics for rational lattice paths, arXiv:1707.09918 [math.CO], 2017.
  61. Daniel Birmajer, Juan B. Gil, Michael D. Weiner, On factor-free Dyck words with half-integer slope, arXiv:1804.11244 [math.CO], 2018. (A274052)
  62. R. Bisdorff, J.-L. Marichal, Counting non-isomorphic maximal independent sets of the n-cycle graph (2007), arXiv:math/0701647 and JIS 11 (2008) 08.5.7.
  63. R. Biswal, V. Chari, L. Schneider, S. Viswanath, Demazure Flags, Chebyshev polynomials, Partial and Mock theta functions, arXiv preprint arXiv:1502.05322, 2015 ["Preliminary work using [OEIS] assisted in the identification of the closed formulae in the proposition."]
  64. Md. Shamim Hossain Biswas, MSH Biswas Cryptosystem, International Journal of Scientific and Research Publications (2019), see p. 12, Appendix B. doi:10.29322/IJSRP.29.12.2019
  65. Rony A. Bitan and Michael M. Schein, On the flat cohomology of binary norm forms, arXiv:1702.05080 [math.NT], 2017.
  66. Björner, Anders. "Positive Sum Systems", in Bruno Benedetti, Emanuele Delucchi, and Luca Moci, editors, Combinatorial Methods in Topology and Algebra. Springer International Publishing, 2015. 157-171.
  67. A. Bjorner and R. P. Stanley, A Combinatorial Miscellany in ``New directions in mathematics, Cambridge Univ. Press, to appear. Preprint 1998.
  68. Hadley Black, Implementation of Internal and Semi-External Hierarchical Clustering, DIMACS REU Final Report, 2016;
  69. Simon R. Blackburn, John R. Britnell, Mark Wildon, The probability that a pair of elements of a finite group are conjugate. arXiv:1108.1784 [math.GR], 2011 and doi:10.1112/jlms/jds022 J. Lond. Math. Soc. II Ser. 86 (3) (2012) 755-778
  70. Bryce Emerson Blackham, Subtraction Games: Range and Strict Periodicity, masters thesis, 2018. PDF. (A003849, A007538)
  71. David Blackman, Sebastiano Vigna, Scrambled Linear Pseudorandom Number Generators. arXiv:1805.01407 [cs.DS], 2018. (A052955)
  72. I. V. Blagouchine, Rediscovery of Malmsten's integrals, their evaluation by contour integration methods and some related results, The Ramanujan Journal, 2014, doi:10.1007/s11139-013-9528-5.
  73. Iaroslav V. Blagouchine and Marc-Antoine Coppo, A note on some constants related to the zeta-function and their relationship with the Gregory coefficients, arXiv:1703.08601 [math.NT], 2017.
  74. Iaroslav V. Blagouchine, Three notes on Ser's and Hasse's representation for the zeta-functions, Integers (2018) 18A, Article #A3. Abstract (A002195, A002196, A002206, A002207, A002657, A002790, A193546, (A194506))
  75. Matthew Blair, Rigoberto Flórez, Antara Mukherjee, Matrices in the Hosoya triangle, arXiv:1808.05278 [math.CO], 2018. (A001629, A006733, A058071, A284115, A284129, A284126, A284130, A284127, A284131, A284128)
  76. Blanchard, Peter Floodstrand, Pseudo-arithmetic sets and Ramsey theory. J. Combin. Theory Ser. A 106 (2004), no. 1, 49-57.
  77. Blanchet-Sadri, Francine. Algorithmic combinatorics on partial words. Chapman & Hall/CRC, Boca Raton, FL, 2008. ii+385 pp. ISBN: 978-1-4200-6092-8; 1-4200-6092-9 MR2384993 (2009f:68142)
  78. F. Blanchet-Sadri, Kun Chen, Kenneth Hawes, Dyck Words, Lattice Paths, and Abelian Borders, arXiv:1708.06461 [cs.FL], 2017.
  79. Jonathan Blanchette, Robert Laganière, A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting, arXiv:1910.11749 [cs.DS], 2019. (A006022)
  80. Blanchini, Franco; Lepschy, Antonio; Miani, Stefano; Viaro, Umberto, Characterization of PID and lead/lag compensators satisfying given H_\infty specifications. IEEE Trans. Automat. Control 49 (2004), no. 5, 736-740.
  81. R. Blanco, Complexity of Villamayor's algorithm in the monomial case (2007), arXiv:0704.3416.
  82. P. Blasiak, G. Dattoli , A. Horzela et al., Motzkin numbers, central trinomial coefficients and hybrid polynomials (2008); arXiv:0802.0075 and JIS 11 (2008) 08.1.1
  83. Blasiak, Pawel; Flajolet, Philippe Combinatorial models of creation-annihilation. Sém. Lothar. Combin. 65 (2010/12), Art. B65c, 78 pp.
  84. P. Blasiak, A. Horzela, K. A. Penson, G. H. E. Duchamp and A. I. Solomon, arXiv:quant-ph/0501155 Boson Normal Ordering via Substitutions and Sheffer-Type Polynomials; Physics Letters A, Volume 338, Issue 2, 25 April 2005, Pages 108-116.
  85. P. Blasiak, K. A. Penson and A. I. Solomon, arXiv:quant-ph/0212072 The Boson Normal Ordering Problem and Generalized Bell Numbers
  86. P. Blasiak, K. A. Penson and A. I. Solomon, arXiv:quant-ph/0303030 Dobinski-type relations and the Log-normal distribution
  87. P. Blasiak, K. A. Penson, A. I. Solomon, The general boson normal ordering problem, Physics Letters A, Volume 309, Issues 3-4, 24 March 2003, Pages 198-205; arXiv:quant-ph/0402027.
  88. P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, arXiv:quant-ph/0405103 Combinatorial field theories via boson normal ordering]
  89. P. Blasiak, K. A. Penson, A. I. Solomon, A. Horzela and G. E. H. Duchamp, doi:10.1063/1.1904161 Some useful combinatorial formulas for bosonic operators, J. Math. Phys. 46, 052110 (2005) (6 pages).
  90. A. Blass, N. Dobrinen, D. Raghavan, The next best thing to a P-point, arXiv preprint arXiv:1308.3790, 2013.
  91. Collin Bleak, Peter J. Cameron, Feyishayo Olukoya, Automorphisms of shift spaces and the Higman-Thomspon groups: the one-sided case, arXiv:2004.08478 [math.GR], 2020. (A248905)
  92. Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Water capacity of Dyck paths, Advances in Applied Mathematics (2019) Vol. 112, 101945. doi:10.1016/j.aam.2019.101945 (A000108)
  93. Blecher, Aubrey, Charlotte Brennan, Arnold Knopfmacher, and Toufik Mansour. "The perimeter of words." Discrete Mathematics 340, no. 10 (2017): 2456-2465. doi:10.1016/j.disc.2017.06.003
  94. Aubrey Blecher, T Mansour, AO Munagi, Some Parity Statistics in Integer Partitions, Bulletin of the Polish Academy of Sciences. Mathematics, Vol. 63, No. 2, 2015.
  95. D. Blessing, E. Insko, K. Johnson, C. Mauretour, On (t,r) Broadcast Domination Numbers of Grids, arXiv preprint arXiv:1401.2499, 2014.
  96. Joakim Blikstad, On the longest common subsequence of Thue-Morse words, arXiv:1904.00248 [cs.DM], 2019. (A297618, A320847)
  97. Nathan Bliss, J Verschelde, Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods, arXiv preprint arXiv:1606.05563, 2016.
  98. Natasha Blitvić, Vicente I. Fernandez, A Combinatorial Model for Heterogeneous Microbial Growth, arXiv:1901.04080 [math.CO], 2019. (A005686)
  99. Natasha Blitvić, Einar Steingrímsson, Permutations, moments, measures, arXiv:2001.00280 [math.CO], 2020. (A000108, A000142, A000166, A000364, A001003, A001147, A052186)
  100. Andreas B. G. Blobel, An Asymptotic Form of the Generating Function Product_{k = 1..oo}(1+x^k/k), arXiv:1904.07808 [math.CO], 2019. (A000009)
  101. Bloch, Ethan D., The angle defect for odd-dimensional simplicial manifolds. Discrete Comput. Geom. 35 (2006), no. 2, 311-328.
  102. S. Bloch, P. Vanhove, The elliptic dilogarithm for the sunset graph, arXiv preprint arXiv:1309.5865, 2013
  103. Aart Blokhuis, Xiwang Cao, Wun-Seng Chou, Xiang-Dong Hou, On the roots of certain Dickson polynomials, Journal of Number Theory, Vol. 188, July 2018, Pages 229-246. doi:10.1016/j.jnt.2018.01.003
  104. Lars Blomberg, Scott R. Shannon, N. J. A. Sloane, Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids, (2020). PDF Also arXiv:2009.07918. (A007678, A159065, A288187, A306302, A331452, A331453, A331755, A331757, A331763, A331766, A333282, A334701, A335701)
  105. V. Blondel, Structured Numbers. Properties of a hierarchy of internal operations on binary trees, Acta Informatica, 35, pp. 1-15, 1998. (ps, pdf)
  106. A. Blondin Massé, S. Brlek, S. Labbé, M. Mendès France, Fibonacci Snowflakes, Ann. Sci. Math. Quebec 35 (2011) no 2, 141-152
  107. J. Bloom, A, Burstein, Egge triples and unbalanced Wilf-equivalence, arXiv preprint arXiv:1410.0230, 2014
  108. J. Bloom and S. Elizalde, Pattern avoidance in matchings and partitions, arXiv preprint arXiv:1211.3442, 2012.
  109. Jonathan Bloom, Nathan McNew, Counting pattern-avoiding integer partitions, arXiv:1908.03953 [math.CO], 2019. (A000005, A000012, A000027, A001399, A001400, A004526, A033638, A117142, A117143, A136185, A265250, A309097, A309098, A309099, A309194, A320226) In creating this table, we discovered, by way of the OEIS database, that the generating function for μ = (5,2) is identical to the generating function for the number of so-called metacyclic p-groups for prime p
  110. J. Bloom, V. Vatter, Two Vignettes On Full Rook Placements, arXiv preprint arXiv:1310.6073, 2013
  111. Benjamin A. Blumer, Michael S. Underwood and David L. Feder, Single-qubit unitary gates by graph scattering, arXiv:1111.5032, 2011
  112. Johannes Blümlein, Algebraic relations between harmonic sums and associated quantities, Computer Physics Communications, Volume 159, Issue 1, 1 May 2004, Pages 19-54.
  113. Johannes Blümlein. Structural relations of harmonic sums and Mellin transforms up to weight w=5. Comput. Phys. Comun 180 (11) (2009) 2218-2249. doi:10.1016/j.cpc.2009.07.004
  114. Johannes Blümlein, Iterative Non-iterative Integrals in Quantum Field Theory, arXiv:1808.08128 [hep-th], 2018. (A187100, A187153, A256637)
  115. J. Blümlein and W. L. van Neerven, arXiv:hep-ph/9811519 Less Singular Terms and Small x Evolution in a Soluble Model, Phys.Lett. B450 (1999), 412-416.
  116. H. Boas and S. Geller, A Survey of Mathematical Problems, Instructor's Guide.
  117. Bruce Bobier and Joe Sawada, A fast algorithm to generate open meandric systems and meanders, ACM Transactions on Algorithms, Vol. 6, No. 2, 2010, article #42.
  118. Florin P. Boca, An AF algebra associated with the Farey tessellation (2005), arXiv:math/0511505.
  119. Florin P. Boca and Christopher Linden, On Minkowski type question mark functions associated with even or odd continued fractions, arXiv:1705.01238 [math.RS], 2017.
  120. Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner, An analysis of call admission problems in grids, LIPICs preprint, 2018. PDF (A000078)
  121. E. Bod, Explicit formulas for parametrized families of irreducible algebraic Appell, Lauricella and Horn functions, arXiv preprint arXiv:1304.2540, 2013
  122. J.-P. Bode, Strategien für Aufbauspiele mit Mosaik-Polyominos, Doctoral Dissertation, 2000.
  123. J. Bodeen, S. Butler, T. Kim, X. Sun, S. Wang, Tiling a strip with triangles, El. J. Combinat. 21 (1) (2014) P1.7
  124. Arnaud Bodin, Number of irreducible polynomials in several variables over finite fields (2007), arXiv:0706.0157, Amer. Math. Monthly, 115 (2008), 653-660.
  125. Olivier Bodini, Julien Courtiel, Sergey Dovgal, Hsien-Kuei Hwang, Asymptotic Distribution of Parameters in Random Maps, arXiv:1802.07112 [math.CO], 2018. " least 39 entries in Sloane's OEIS were found containing sequences whose generating functions satisfy Riccati equations, including some entries related to the families of indecomposable combinatorial objects, moments of probability distributions, chord diagrams, Feynman diagrams, etc."
  126. O Bodini, M Dien, X Fontaine, A Genitrini, HK Hwang, Increasing Diamonds, in LATIN 2016: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings Pages pp 207-219 2016 doi:10.1007/978-3-662-49529-2_16 Lecture Notes in Computer Science Series Volume 9644
  127. Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski, The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. In: 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). doi:10.1137/1.9781611974775.2
  128. Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola, Beyond series-parallel concurrent systems: the case of arch processes, arXiv:1803.00843 [cs.DM], 2018. (A220433)
  129. Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, On the number of increasing trees with label repetitions, arXiv:1809.04314 [math.CO], 2018. (A171792)
  130. Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima, Compaction for two models of logarithmic-depth trees: Analysis and Experiments, arXiv:2005.12997 [math.CO], 2020. (A132862)
  131. Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima, Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study, hal-02865198 [math.CO] / [math.PR] / [cs.DS] / [cs.DM], 2020. Abstract (A000670, A001710, A019538, A058307, A092582, A094112, A129062, A145324, A171792)
  132. Olivier Bodini, Antoine Genitrini, Mehdi Naima, Ranked Schröder Trees, arXiv:1808.08376 [cs.DS], 2018. Also in 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). doi:10.1137/1.9781611975505.2 (A000522, A000670, A001710, A092582, A094112, A136124, A143491, A145324)
  133. O. Bodini, A. Genitrini, F. Peschanski, The Combinatorics of Non-determinism,, 2013.
  134. O. Bodini, A. Genitrini, F. Peschanski, A Quantitative Study of Pure Parallel Processes, arXiv preprint arXiv:1407.1873, 2014
  135. Olivier Bodini and Eric Rivals, Tiling an Interval of the Discrete Line, in Combinatorial Pattern Matching, Lecture Notes in Computer Science, Volume 4009/2006, Springer-Verlag.
  136. Olivier Bodini, Paul Tarau, On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms, arXiv:1709.04302 [cs.PL], 2017.
  137. Manuel Bodirsky, Eric Fusy, Mihyun Kang et al., Enumeration of Unlabeled Outerplanar Graphs (2005), arXiv:math/0511422, and El. J. Comb. 14 (2007) R66.
  138. M. Bodirsky, Clemens Gröpl and Mihyun Kang, Generating Labeled Planar Graphs Uniformly at Random, Theoret. Comput. Sci. 379 (2007), no. 3, 377-386.
  139. Bodirsky, Manuel; Fusy, Éric; Kang, Mihyun; Vigerske, Stefan Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput. 40 (2011), no. 3, 721-769.
  140. Bodirsky, Manuel; Kang, Mihyun, Generating outerplanar graphs uniformly at random. Combin. Probab. Comput. 15 (2006), no. 3, 333-343.
  141. Andreas Bøe, The Toy Robot (Published on Amazon). (A short story collection. It contains a reference to the OEIS database in the sub-chapter with the title "Sloane".)
  142. Andreas Bøe, The Right Left (Published on Amazon, 2014). Science fiction novel that mentions the OEIS.
  143. Tobias Boege, Alessio D'Alì, Thomas Kahle, Bernd Sturmfels, The Geometry of Gaussoids, arXiv:1710.07175 [math.CO], 2017. (A005118)
  144. Tobias Boege, Thomas Kahle, Construction Methods for Gaussoids, arXiv:1902.11260 [math.CO], 2019. (A000079, A000085, A000110, A006125, A007395, A011800, A213434)
  145. Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, On the Robustness of Winners: Counting Briberies in Elections, arXiv:2010.09678 [cs.GT], 2020. (A008302)
  146. R. H. Boels, Three particle superstring amplitudes with massive legs, Arxiv preprint arXiv:1201.2655, 2012
  147. R. H. Boels, On the field theory expansion of superstring five point amplitudes, arXiv preprint arXiv:1304.7918, 2013
  148. R. H. Boels, T. Hansen, String theory in target space, arXiv preprint arXiv:1402.6356, 2014
  149. Rutger Boels, Kasper J. Larsen, Niels A. Obers and Marcel Vonk, MHV, CSW and BCFW: field theory structures in string theory amplitudes (2008); arXiv:0808.2598
  150. Georg Boenn, The Farey Sequence as a Model for Musical Rhythm and Meter, Computational Models of Rhythm and Meter, Springer, Cham, 83-112. doi:10.1007/978-3-319-76285-2_7 HTML
  151. Stefan Boettcher, Stephan Mertens, Analysis of the Karmarkar-Karp Differencing Algorithm (2008); arXiv:0802.4040; The European Physical Journal B-Condensed Matter and Complex Systems, Volume 65, Number 1 / September, 2008.
  152. Bogart, Tristram; Contois, Mark; Gubeladze, Joseph Hom-polytopes. Math. Z. 273 (2013), no. 3-4, 1267-1296.
  153. N. M. Bogoliubov, Enumerative combinatorics of XX0 Heisenberg chain, Scientific Notes, POMI Workshops, Russian Academy of Sciences (St. Petersburg, Russia, 2019), Vol. 487. (Н. М. Боголюбовь: Записки научных, семинаров ПОМИ 2019, Том 487). PDF via FTP (A002426)
  154. Nicholas Bohall, On Gaussian Primes, Senior Thesis, June 2016, Department of Mathematics, University of Washington.
  155. Martin Böhm, Graph labeling, Bachelor Thesis, Department of Applied Mathematics, Charles University in Prague, 2011.
  156. Walter M. Böhm, Interesting Topics for Bachelor Theses, 2016;
  157. K Böhmová, C Dalfó, C Huemer, On cyclic Kautz digraphs, Preprint 2016;
  158. Nina Bohlmann and Ralf Benölken, Complex Tasks: Potentials and Pitfalls, Mathematics (2020) Vol. 8, No. 10, 1780. doi:10.3390/math8101780 (A000162)
  159. Samuel Boissiere, Etienne Mann and Fabio Perroni, Crepant resolutions of weighted projective spaces and quantum deformations (2006), arXiv:math/0610617.
  160. Boissière, Samuel; Mann, Étienne; Perroni, Fabio Computing certain Gromov-Witten invariants of the crepant resolution of P(1,3,4,4). Nagoya Math. J. 201 (2011), 1-22.
  161. R Bojicic, MD Petkovic, Orthogonal Polynomials Approach to the Hankel Transform of Sequences Based on Motzkin Numbers, Bulletin of the Malaysian Mathematical Sciences, 2015, doi:10.1007/s40840-015-0249-3
  162. Radica Bojicic, Marko D. Petkovic and Paul Barry, Hankel transform of a sequence obtained by series reversion II-aerating transforms, Arxiv preprint arXiv:1112.1656, 2011
  163. Radica Bojicic, Marko D. Petkovic and Paul Barry, The Hankel transform of aerated sequences, Preprint 2013,
  164. Radica Bojičić, Marko D. Petković, Predrag M. Rajković, Hankel transforms of generalized Motzkin numbers, Mathematical Methods in the Applied Sciences, Volume 40, Issue 16, 15 November 2017. doi:10.1002/mma.4430
  165. Jan Bok, Graph-indexed random walks on special classes of graphs, arXiv:1801.05498 [math.CO], 2018. (A001006, A002426, A027907)
  166. Jan Bok, Jaroslav Nešetřil, Graph-indexed random walks on pseudotrees, Electronic Notes in Discrete Mathematics (2018) Vol. 68, 263-268. doi:10.1016/j.endm.2018.06.045
  167. Jurgen Bokowski, Branko Grunbaum, Lars Schewe, Topological configurations (n4) exist for all n17, European Journal of Combinatorics, In Press, Corrected Proof, Available online 13 January 2009.
  168. P Boldi, S Vigna, On the lattice of antichains of finite intervals, arXiv preprint arXiv:1510.03675, 2015.
  169. Ethan D. Bolker, Samuel A. Feuer, Catalin Zara, Balance weighing—variations on a theme, Mathematics Magazine (February 2015) Vol. 88, No. 1, 1-14. [1] (A066425)
  170. E. Bolker, V. Guillemin and T. Holm, arXiv:math.CO/0206103 How is a graph like a manifold?, preprint.
  171. József Bölcsföldi, György Birkás, Golden ratio prime numbers, International Journal of Engineering Science Invention (2018) Vol. 6 Issue 12, 82-85. PDF (A019546)
  172. József Bölcsföldi, György Birkás, Monotone prime numbers, IOSR Journal of Engineering (2018) Vol. 08, Issue 9 (2018), V(II), 28-30. PDF (A019546)
  173. József Bölcsföldi, György Birkás, Miklós Ferenczi, Bölcsföldi-Birkás-Ferenczi prime numbers (Full prime numbers), International Journal of Mathematics and Statistics Invention (IJMSI), Volume 5, Issue 2, February 2017, pp. 4-7.
  174. Tommaso Bolognesi, A pseudo-random network mobile automaton with linear growth, Information Processing Letters, Volume 109, Issue 13, 15 June 2009, Pages 668-674.
  175. Tommaso Bolognesi, V Ciancia, Nominal Cellular Automata, arXiv preprint arXiv:1608.03320, 2016
  176. S. Bolus, A QOBDD-based Approach to Simple Games, Dissertation, Doktor der Ingenieurwissenschaften der Technischen Fakultaet der Christian-Albrechts-Universitaet zu Kiel,, 2012.
  177. Bruce M. Boman, Thien-Nam Dinh, Keith Decker, Brooks Emerick, Christopher Raymond, Gilberto Schleinger, Why do Fibonacci numbers appear in patterns of growth in nature?, in Fibonacci Quarterly, 55(5): pp 30-41, (2017). PDF (A000079, A000045, A000930, A003239, A003520, A005708)
  178. Miklos Bona, On Two Related Questions of Wilf Concerning Standard Young Tableaux (2008); arXiv:0805.2590; European Journal of Combinatorics, Volume 30, Issue 5, July 2009, Pages 1318-1322.
  179. M. Bona, Non-overlapping permutation patterns, PU. M. A. Vol. 22 (2012), 99-105;
  180. Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015.
  181. Miklos Bona, Balanced vertices in labeled rooted trees, arXiv:1705.09688 [math.CO], 2017.
  182. Miklós Bóna, Most principal permutation classes have nonrational generating functions, arXiv:1901.08506 [math.CO], 2019.
  183. Miklos Bóna, Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions, Acta Mathematica Universitatis Comenianae (2019) Vol. 88, No. 3, 481-487. PDF
  184. Miklos Bona, Elijah DeJonge, Pattern avoiding permutations and involutions with a unique longest increasing subsequence, arXiv:2003.10640 [math.CO], 2020. (A082582, A152880, A167995)
  185. Miklós Bóna, Elijah DeJonge, Pattern Avoiding Permutations and Involutions with a Unique Longest Increasing Subsequence, (2020). PDF (A152880)
  186. Miklos Bóna, R Gómez, MD Ward, Workshop in Analytic and Probabilistic Combinatorics BIRS-16w5048 , 2016;
  187. M. Bóna, C. Homberger, J. Pantone, V. Vatter, Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration, arXiv preprint arXiv:1310.7003, 2013
  188. Miklos Bona and Hyeong-Kwan Ju, Enumerating Solutions of a System of Linear Inequalities Related to Magic Squares, Annals of Combinatorics, Volume 10, Number 2 / September, 2006.
  189. Miklos Bona, Istvan Mezo, Limiting probabilities for vertices of a given rank in rooted trees, arXiv:1803.05033 [math.CO], 2018. (A080635)
  190. Miklós Bóna, István Mező, Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees, The Electronic Journal of Combinatorics (2019) Vol. 26, No. 3, P#3.41. Abstract (A000111, A034428, A080635)
  191. Miklos Bona and Philippe Flajolet, Isomorphism and Symmetries in Random Phylogenetic Trees (2009) arXiv:0901.0696 and J. Appl. Probab. 46, No. 4, 1005-1019 (2009) doi:10.1239/jap/1261670685
  192. Miklós Bóna and Bruce E. Sagan, "On Divisibility of Narayana Numbers by Primes", J. Integer Sequences, Volume 8, 2005, Article 05.2.4; arXiv:math/0505383.
  193. Miklos Bona, Rebecca Smith, An Involution on Involutions and a Generalization of Layered Permutations, arXiv preprint arXiv:1605.06158, 2016
  194. Miklos Bona, Rebecca Smith, Pattern avoidance in permutations and their squares, arXiv:1901.00026 [math.CO], 2019. (A122584)
  195. Maria Paola Bonacina and Nachum Dershowitz, Canonical Inference for Implicational Systems, in Automated Reasoning, Lecture Notes in Computer Science, Volume 5195/2008, Springer-Verlag.
  196. Bonacina, Maria Paola; Dershowitz, Nachum doi:10.1007/978-3-642-37651-1_3. Canonical ground Horn theories. Lecture Notes in Computer Science 7797, 35-71 (2013)
  197. Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Socała, Marcin Wrochna, On Directed Feedback Vertex Set parameterized by treewidth, arXiv:1707.01470 [cs.DS], 2017.
  198. Pierre Bonardo, Anna E. Frid, Jeffrey Shallit, Number of valid decompositions of Fibonacci prefixes, arXiv:1806.09534 [math.CO], 2018. See also PDF or Theoretical Computer Science (2019) doi:10.1016/j.tcs.2018.12.016. (A000119, A300066)
  199. A. Bonato and B. Yang, Graph searching and related problems, PDF
  200. Marco Bonatto, Michael Kinyon, David Stanovský, Petr Vojtěchovský, Involutive Latin solutions of the Yang-Baxter equation, arXiv:1910.02148 [math.GR], 2019. (A290887)
  201. Nicolas Bonichon, M Bousquet-Mélou, P Dorbec, On the number of planar Eulerian orientations, arXiv preprint 2016
  202. Nicolas Bonichon, Éric Fusy, Benjamin Lévêque, A bijection for essentially 3-connected toroidal maps, arXiv:1907.04016 [math.CO], 2019. (A308523, A308524, A308526)
  203. Nicolas Bonichon and Benjamin Lévêque, A bijection for essentially 4-connected toroidal triangulations, arXiv:1707.08191 [cs.DM], 2017.
  204. J. Bonin, A. de Mier and M. Noy, arXiv:math.CO/0211188 Lattice path matroids: enumerative aspects and Tutte polynomials, Journal of Combinatorial Theory, Series A, 104 (2003), no. 1, 63-94.
  205. Ofek Lauber Bonomo, Shlomi Reuveni, Occupancy correlations in the asymmetric simple inclusion process, arXiv:1905.02170 [cond-mat.stat-mech], 2019. (A002866)
  206. Bonzio S., Baldi M.P., Valota D. (2018) Counting Finite Linearly Ordered Involutive Bisemilattices. In: Desharnais J., Guttmann W., Joosten S. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2018. Lecture Notes in Computer Science, vol 11194. Springer, 2018.
  207. Valentin Bonzom, Etera R. Livine, Self-duality of the 6j-symbol and Fisher zeros for the Tetrahedron, arXiv:1905.00348 [math-ph], 2019. (A142978)
  208. A. R. Booker, On Mullin's second sequence of primes, Arxiv preprint arXiv:1107.3318, 2011, INTEGERS 12A (2012): John Selfridge Memorial Issue, #A4.
  209. Andrew R. Booker, A variant of the Euclid-Mullin sequence containing every prime, arXiv preprint arXiv:1605.08929, 2016
  210. A. R. Booker, S. A. Irvine, The Euclid-Mullin graph, arXiv preprint arXiv:1508.03039, 2015
  211. Magdalena Boos, Giovanni Cerulli Irelli, Francesco Esposito, Parabolic orbits of 2-nilpotent elements for classical groups, arXiv:1802.06425 [math.RT], 2018. (A115329, A202837)
  212. Boothby, T.; Burkert, J.; Eichwald, M.; Ernst, D. C.; Green, R. M.; Macauley, M. doi:10.1007/s10801-011-0327-z On the cyclically fully commutative elements of Coxeter groups. J. Algebr. Comb. 36, No. 1, 123-148 (2012).
  213. C. H. M. Boor, Aliyu Dogara Mohammed, Halilu Usman Ibrabim, Availability of Physical Infrastructure and Instructional Materials for Teaching and Learning School Library in Adult Education in Giwa Local Government Area of Kaduna State, Int'l J. of Educational Benchmark (2018) Vol. 9, No. 1, 105-116. PDF
  214. A. C. Borah, Kandarpa Tamuly, Number of Symmetrical objects in n-dimensional space with different layers, International Journal of Applied Engineering Research (2019) Vol. 14, No. 16, 3489-3493. PDF (A005917, A022521, A220902)
  215. Julius Borcea, Boris Shapiro, Classifying real polynomial pencils (2004), arXiv:math/0404215.
  216. Daniel Borchmann, Bernhard Ganter, Concept Lattice Orbifolds—First Steps, Proceedings of the 7th International Conference on Formal Concept Analysis (ICFCA 2009), 22–37. doi:10.1007/978-3-642-01815-2_2 (A102896, A108799)
  217. Olivier Bordellès, "A Note on the Average Order of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.3.3.
  218. Olivier Bordelles, An Asymptotic Formula for Short Sums of Gcd-Sum Functions, Journal of Integer Sequences, Vol. 15 (2012), #12.6.8.
  219. O. Bordelles and B. Cloitre, Bounds for the Kolakoski Sequence, J. Integer Sequences, 14 (2011), #11.2.1.
  220. Magnus Bordewich, Ina Maria Deutschmann, Mareike Fischer, Elisa Kasbohm, Charles Semple, Mike Steel, On the information content of discrete phylogenetic characters, arXiv:1703.04734 [q-bio.PE], 2017.
  221. Magnus Bordewich, Martin Dyer and Marek Karpinski, Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs (2005), arXiv:math/0501081.
  222. Oscar J. Borenstein, Alexander Shashkov, Garland Recurrences, arXiv:1909.04215 [math.CO], 2019. (A227656)
  223. Jacopo Borga, Raul Penaguiao, The feasible regions for consecutive patterns of pattern avoiding permutations, Institut für Mathematik, Universität Zürich (Switzerland, 2020). PDF (A214015)
  224. Börger, Reinhard Continuous selections, free vector lattices and formal Minkowski differences. J. Convex Anal. 18 (2011), no. 3, 855-864.
  225. N. Borie, Combinatorics of simple marked mesh patterns in 132-avoiding permutations, arXiv preprint arXiv:1311.6292, 2013
  226. Nicolas Borie. On the combinatorics of quadrant marked mesh patterns in 132-avoiding permutations. Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2016, 64 (1), pp.140-153. < v64 p140.pdf>. <hal-01222921>
  227. Nicolas Borie, The Hopf Algebra of graph invariants, arXiv preprint arXiv:1511.05843, 2015
  228. Nicolas Borie, Three-dimensional Catalan numbers and product-coproduct prographs, arXiv:1704.00212 [math.CO], 2017.
  229. Michael Borinsky, Generating asymptotics for factorially divergent sequences, arXiv preprint arXiv:1603.01236, 2016
  230. Michael Borinsky, Renormalized asymptotic enumeration of Feynman diagrams, arXiv:1703.00840 [hep-th], 2017.
  231. Michael Borinsky, The Ring of Factorially Divergent Power Series, Graphs in Perturbation Theory (2018), Springer, Cham, 135-172. doi:10.1007/978-3-030-03541-9_4
  232. Michael Borinsky, Examples from Zero-Dimensional QFT, Graphs in Perturbation Theory (2018), Springer, Cham, 135-172. doi:10.1007/978-3-030-03541-9_7
  233. Bornemann, F., The SIAM 100-Digit Challenge: A Decade Later, Jahresber. Dtsch. Math. Ver. (2016) 118: 87. doi:10.1365/s13291-016-0137-2
  234. Jan-Peter Börnsen, Anton E. M. van de Ven, Tangent Developable Orbit Space of an Octupole, arXiv:1807.04817 [hep-th], 2018. (A000421)
  235. Matvey Borodin, Hannah Han, Kaylee Ji, Tanya Khovanova, Alexander Peng, David Sun, Isabel Tu, Jason Yang, William Yang, Kevin Zhang, Kevin Zhao, Variants of Base 3 over 2, arXiv:1901.09818 [math.NT], 2019. (A005836, A024629, A256785, A265316)
  236. G. Boros and V. H. Moll. Irresistible Integrals, Cambridge, 2004.
  237. A. V. Borovik, A. G. Myasnikov and V. N. Remeslennikov, arXiv:math.GR/0204070 Multiplicative measures on free groups, Internat. J. Algebra Comput. 13 (2003), no. 6, 705-731.
  238. A Borowiec, W Mlotkowski, New Eulerian numbers of type D, arXiv preprint arXiv:1509.03758, 2015
  239. A. Bors, Finite groups having an automorphism with a sufficiently large cycle are solvable, arXiv preprint arXiv:1501.07172, 2015 [A000793 is referenced in version 1 but not in version 2]
  240. Alexander Bors, Michael Giudici, Cheryl E. Praeger, Documentation for the GAP code file OrbOrd.txt, arXiv:1910.12570 [math.GR], 2019. (A000009)
  241. J. Borwein, Aesthetics for the Working Mathematician, April 2001. [ps pdf]
  242. J. Borwein, The Impact of Technology on the Doing of Mathematics, April 2000. [ps pdf]
  243. J. M. Borwein, Exploratory experimentation: digitally-assisted discovery and proof, Gaz. Austr. Math. Soc. 36 (3) (2009) p 166-175 [Includes an OEIS screen shot]
  244. J. M. Borwein, The Life of Modern Homo Habilis Mathematicus: Experimental Computation and Visual Theorems, 2014; Chapter prepared for John Monaghan, Luc Troche and Jonathan Borwein, "Tools and mathematics: Instruments for learning", Spring-Verlag, 2015;
  245. J. M. Borwein, A short walk can be beautiful, 2015;
  246. J. M. Borwein, "Adventures with the OEIS: Five sequences Tony may like", Guttman 70th Meeting, 2015, revised May 2016. "OEIS is an amazing instrumental resource, ... a model both for curation and for moderation" PDF (A000110, A000364, A001861, A002895, A011248, A055745, A060997, A103370, A218147, A253095); also doi:10.1007/978-3-319-68376-8_9
  247. Jonathan M. Borwein, I prefer pi: A brief history and anthology of articles in the American Mathematical Monthly (2015), in Pi: The Next Generation, Springer 2016, pp 475-499, doi:10.1007/978-3-319-32377-0_25.
  248. J. Borwein and P. Borwein, Some observations on computer aided analysis, Notices Amer. Math. Soc. 39 (1992), 825-829.
  249. J. M. Borwein and D. M. Bailey, Mathematics by Experiment, Peters, Boston, 2004.
  250. J. Borwein, D. Bailey and R. Girgensohn, Experimentation in Mathematics: Computational Paths to Discovery, Peters, Boston, 2004.
  251. J. M. Borwein and P. B. Borwein, Challenges in Mathematical Computing, Computing in Science and Engineering 3 (2001), 48-53. (PostScript , Pdf)
  252. J. M. Borwein, P. R. Borwein and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.
  253. J. M. Borwein, D. M. Bradley and D. J. Broadhurst, Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k, Elect. J. Combin., #R5 of Vol. 4(2), 1997.
  254. J. M. Borwein, D. M. Bradley, D. J. Broadhurst and P. Lisonek, Special Values of Multiple Polylogarithms, Transactions of the American Mathematical Society, Vol. 353, No. 3, March 2001, pp. 907-941.
  255. J. M. Borwein, Marc Chamberland, doi:10.1155/2007/19381 Integer Powers of Arcsin, Int. J. Math. Math. Sci. 2007, #19381.
  256. J. M. Borwein, O-Yeat Chan, R. E. Crandall, doi:10.1080/10586458.2010.10390634 Higher-dimensional box integrals, Exper. Math. 19 (4) (2010) 431-466
  257. J. M. Borwein and S. T. Chapman, I prefer pi ..., Amer. Math. Monthly, 122 (2015), 195-216.
  258. J. M. Borwein and K.-K. S. Choi, On the Representations of xy+yz+zx, Experimental Math., 9 (2000), 153-158.
  259. J. M. Borwein and K.-K. S. Choi, On Dirichlet series for sums of squares, The Ramanujan Journal, special issue for Robert Rankin, Volume 7, Numbers 1-3 / March, 2003, pdf)
  260. J. M. Borwein, K.-K. S. Choi and W. Pigulla, Continued Fractions of Tails of Hypergeometric Series, pdf), Amer. Math. Monthly, 112 (2005), 493-501.
  261. J. M. Borwein and R. M. Corless, Review of ``An Encyclopedia of Integer Sequences by N. J. A. Sloane and Simon Plouffe", SIAM Review, 38 (1996), 333-337. (A review rather than a paper, but relevant.)
  262. J. M. Borwein and R. M. Corless, Emerging tools for experimental mathematics, Amer. Math. Monthly, 106 (No. 10, 1999), 889-909.
  263. Jonathan M. Borwein, Dirk Nuyens, Armin Straub, James Wan, Random Walks in the Plane, dmtcs:2862 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
  264. Jonathan M. Borwein, Dirk Nuyens, Armin Straub and James Wan, Random Walk Integrals, 2010. ("[We] would also like to thank you for the interesting and crucial role the OEIS played in this research", James Wan, personal communication.)
  265. Borwein, Jonathan M.; Nuyens, Dirk; Straub, Armin; Wan, James Some arithmetic properties of short random walk integrals. Ramanujan J. 26 (2011), no. 1, 109-132.
  266. Jonathan M. Borwein and Armin Straub, Mahler measures, short walks and log-sine integrals, PDF and Theor. Comput. Sci. 479, 4-21 (2013) doi:10.1016/j.tcs.2012.10.025
  267. Jonathan M. Borwein, Armin Straub and Christophe Vignat, Densities of short uniform random walks, Part II: Higher dimensions, Preprint, 2015;
  268. Robert Bosch, Tale of a Problem Solver, Arista Publishing, Miami FL, 2016.
  269. W. Bosma, Signed bits and fast exponentiation, 21st Journées Arithmétiques (Rome, 2001). J. Théor. Nombres Bordeaux 13 (2001), no. 1, 27-41.
  270. Wieb Bosma, Michel Dekking, Wolfgang Steiner, A remarkable integer sequence related to pi and sqrt(2), arXiv:1710.01498, 4 Oct 2017, also Integers (2018) 18A, Article #A4. (A086377, A189687)
  271. Lara Bossinger, Martina Lanini, Following Schubert varieties under Feigin's degeneration of the flag variety, arXiv:1802.04320 [math.RT], 2018. (A129180)
  272. A. Bostan, Computer Algebra for Lattice Path Combinatorics, Seminaire de Combinatoire Ph. Flajolet, March 28 2013;
  273. Alin Bostan, Calcul Formel pour la Combinatoire des Marches, Habilitation à Diriger des Recherches, Laboratoire d’Informatique de Paris Nord, Université Paris 13, December 2017;
  274. A. Bostan, S. Boukraa, J.-M. Maillard, J.-A. Weil, Diagonals of rational functions and selected differential Galois groups, arXiv preprint arXiv:1507.03227, 2015, doi:10.1088/1751-8113/48/50/504001, J. Phys. A 48 (50) (2015)
  275. Alin Bostan, F. Chyzak, M van Hoeij, L. Pech, Explicit formula for the generating series of diagonal 3D rook paths, Sem. Lothar.. de Combinat. 66 (2011) B66a
  276. Alin Bostan, Manuel Kauers, Automatic Classification of Restricted Lattice Walks arXiv:0811.2899, June 2009
  277. Alin Bostan, Alexander Marynych, Kilian Raschel, On the least common multiple of several random~integers, arXiv:1901.03002 [math.PR], 2019. (A001692)
  278. Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard, Stieltjes moment sequences for pattern-avoiding permutations, arXiv:2001.00393 [math.CO], 2020. (A001006, A001405, A002895, A005773, A005802, A022558, A047889, A047890, A052399, A060899, A072131, A126087, A128386, A129400, A129637, A151281, A151282, A151292, A151318, A151323, A230051)
  279. Alin Bostan, Jordan Tirrell, Bruce W. Westbury, Yi Zhang, On sequences associated to the invariant theory of rank two simple Lie algebras, arXiv:1911.10288 [math.CO], 2019. (A001181, A059710, A108304, A108307, A151366, A216947, A236408)
  280. Mina Saee Bostanabad, João Gouveia, Ting Kei Pong, Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices, arXiv:1807.00379 [math.OC], 2018. To explore the limits of our approach we tried a few more instances of the stable set problem. We tried Paley graphs, known to mimic some properties of random graphs, with some degree of success, and a few small-sized instances of graphs derived from error correcting codes, available at [OEIS].
  281. Nigel Boston, Explicit Galois Groups of Infinite p-Extensions Unramified at p, preprint.
  282. Nigel Boston and Jing Hao, The Weight Distribution of Quasi-quadratic Residue Codes, arXiv:1705.06413 [cs.IT], 2017.
  283. O. Bottema, The Malfatti problem, Forum Geom. 1, 43-50, (2001).
  284. H. Bottomley, Some Smarandache-type multiplicative sequences, Smarandache Notions Journal, Vol. 13, 2002, pp. 134-139.
  285. Zakariae Bouazzaoui, Fibonacci Sequences And Real Quadratic p-Rational Fields, arXiv:1902.04795 [math.NT], 2019.
  286. Zakariae Bouazzaoui, Fibonacci numbers and real quadratic p-rational fields, Periodica Mathematica Hungarica (2020). doi:10.1007/s10998-020-00320-7
  287. Karem Boubaker and Lin Zhang, Fermat-linked relations for the Boubaker polynomial sequences via Riordan matrices analysis, Arxiv preprint arXiv:1203.2082, 2012.
  288. Khadidja Boubellouta, Mohamed Kerada, Some Identities and Generating Functions for Padovan Numbers, Tamap Journal of Mathematics and Statistics (2019) Article SI04. doi:10.29371/2019.16.SI04 (A000931)
  289. Rachelle R. Bouchat and Tricia Muldoon Brown, Minimal Free Resolutions of 2 × n Domino Tilings, arXiv:1708.07054 [math.AC], 2017.
  290. Rachelle R. Bouchat, Tricia Muldoon Brown, Fibonacci numbers and resolutions of domino ideals, Journal of Algebra Combinatorics Discrete Structures and Applications (2019) Vol. 6, No. 2, 63-74. Abstract (A000045)
  291. Youssef Boudabbous, Maurice Pouzet, The morphology of infinite tournaments; application to the growth of their profile, European Journal of Combinatorics 31 (2) (2010) 461-481 doi:10.1016/j.ejc.2009.03.027
  292. O. Bouillot, The Algebra of Multitangent Functions, J. Algebra 410 (2014) 148-238 doi:10.1016/j.jalgebra.2013.12.016
  293. Jacques Boulanger and Jean-Luc Chabert. On the representation of integers as linear combinations of consecutive values of a polynomial. Trans. Amer. Math. Soc. 356 (2004) 5071-5088.
  294. Belgacem Bouras, A New Characterization of Catalan Numbers Related to Hankel Transforms and Fibonacci Numbers, Journal of Integer Sequences, 16 (2013), #13.3.3.
  295. Jean-Emile Bourgine, PA Pearce, E Tartaglia, Logarithmic Minimal Models with Robin Boundary Conditions, arXiv preprint arXiv:1601.04760, 2016
  296. Sadek Bouroubi, "Integer Partitions and Convexity", J. Integer Sequences, Volume 10, 2007, Article 07.6.3.
  297. Sadek Bouroubi, Ali Debbache, An unexpected meeting between the P31-set and the cubic-triangular numbers, arXiv:2001.11407 [math.NT], 2020. (A000217)
  298. Thierry Bousch, LA TOUR DE STOCKMEYER, Seminaire Lotharingien de Combinatoire 77 (2017), Article B77d;
  299. M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar 2-face maps, Discrete Mathematics, 222 (2000), 1-25.
  300. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees, Proceedings FPSAC02, 133-147, (2002). (PostScript, Pdf)
  301. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.
  302. Bousquet, Michel; and Lamathe, Cedric; On symmetric structures of order two. Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176.
  303. Bousquet-Mélou, Mireille, Four classes of pattern-avoiding permutations under one roof: generating trees with two labels. Permutation patterns (Otago, 2003). Electron. J. Combin. 9 (2002/03), no. 2, Research paper 19, 31 pp.
  304. Mireille Bousquet-Melou. Square lattice walks avoiding a quadrant. Journal of Combinatorial Theory, Series A, Elsevier, 2016, Special issue for the 50th anniversary of the journal, 144, pp. 37-79. <hal-01225710v3>
  305. M. Bousqeut-Melou, A. Claesson, M. Dukes, S. Kitaev, Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations Formal Power Series and Algeb. Comb. (2009) and J. Comb. Theory A 117 (7) (2010) 884-909 doi: 10.1016/j.jcta.2009.12.007
  306. Mireille Bousquet-Melou and Marni Mishna, Walks with small steps in the quarter plane (preliminary version), arXiv:0810.4387 [math.CO]
  307. Mireille Bousquet-Melou, Svante Linusson and Eran Nevo, On the independence complex of square grids, Journal of Algebraic Combinatorics, Volume 27, Number 4 / June, 2008.
  308. M. Bousquet-Mélou and G. Schaeffer, Walks on the slit plane, Probab. Theory Related Fields, 124 (2002), no. 3, 305-344.
  309. Adrien Boussicault, P Laborde-Zubieta, Periodic Parallelogram Polyominoes, arXiv preprint arXiv:1611.03766, 2016
  310. J. Bouttier, Énumération des méandres: une approche à partir des méthodes de physique théorique, Mémoire d'exposé bibliographique du DEA de Physique Théorique, 2001.
  311. J. Bouttier and E. Guitter, A note on irreducible maps with several boundaries, arXiv preprint arXiv:1305.4816, 2013
  312. Mathilde Bouvel, Cedric Chauve, Marni Mishna and Dominique Rossin, Average-case analysis of perfect sorting by reversals, Arxiv preprint arXiv:1201.0940, 2012
  313. Bouvel, Mathilde; Ferrari, Luca On the enumeration of d-minimal permutations. Discrete Math. Theor. Comput. Sci. 15 (2013), no. 2, 33-48.
  314. Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, Simone Rinaldi, Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence, arXiv:1702.04529 [math.CO], 2017.
  315. M Bouvel, V Guerrini, S Rinaldi, Slicings of parallelogram polyominoes, or how Baxter and Schroeder can be reconciled, arXiv preprint arXiv:1511.04864, 2015
  316. Bouvel, Mathilde; Guibert, Olivier Refined enumeration of permutations sorted with two stacks and a D8-symmetry. Ann. Comb. 18 (2014), no. 2, 199-232.
  317. M. Bouvel, M. Mishna, C. Nicaud, Some simple varieties of trees arising in permutation analysis, FPSAC 2013 Paris, France DMTCS Proc. AS, 2013, 855-866, Also in 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. Discrete Mathematics and Theoretical Computer Science, s (FPSAC 2013), pp. 825-836, <hal-01229665>
  318. Mathilde Bouvel , Elisa Pergola, Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents (2008); arXiv:0806.1494 and Theor. Comput. Sci. 411 (26-28) (2010) 2487-2501 doi:10.1016/j.tcs.2010.03.008
  319. Denis Bouyssou, Thierry Marchant, Marc Pirlot, The size of the largest antichains in products of linear orders, arXiv:1903.07569 [math.CO], 2019. (A077042)
  320. Juliana Bowles and Marco B. Caminati, A Verified Algorithm Enumerating Event Structures, arXiv:1705.07228 [cs.LO], 2017.
  321. Garry Bowlin, Maximum Frustration in Bipartite Signed Graphs, Electronic Journal of Combinatorics, 19(4) (2012), #P10.
  322. G. Bowlin and M. G. Brin, Coloring Planar Graphs via Colored Paths in the Associahedra, arXiv preprint arXiv:1301.3984, 2013
  323. D. Bowman and A. Regev, Counting symmetry classes of dissections of a convex regular polygon, arXiv preprint arXiv:1209.6270, 2012, and Adv. Appl. Math. 56 (2014) 35-55 doi:10.1016/j.aam.2014.01.004
  324. C. Boyapati, S. Khurshid and D. Marinov, Korat: Automated testing Based on Java Predicates, ACM International Symposium on Software Testing and Analysis (ISSTA), Rome, Italy, July 2002. (This paper won an ACM Distinguished Paper Award) [PostScript, PDF]
  325. Rachael Boyd, Richard Hepworth, Combinatorics of injective words for Temperley-Lieb algebras, arXiv:2006.04261 [math.AT], 2020. (A001045)
  326. Christian Boyer, "Some Notes on the Magic Squares of Squares Problem", The Mathematical Intelligencer, Vol. 27, No. 2, Spring 2005, pages 52-64, Springer, New-York, 2005
  327. C. Boyer, New upper bounds for Taxicab and CabTaxi numbers, JIS 11 (2008) 08.1.6
  328. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János, Einstein metrics on spheres. Ann. of Math. (2) 162 (2005), no. 1, 557-580.
  329. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János; Thomas, Evan, Einstein metrics on exotic spheres in dimensions 7, 11 and 15. Experiment. Math. 14 (2005), no. 1, 59-64.
  330. Peter Boyland, Gabriella Pintér, István Laukó, Ivan Roth, Jon E. Schoenfield, and Stephen Wasielewski, On the Maximum Number of Non-intersecting Diagonals in an Array, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.4.
  331. Keegan Boyle, On The Virtual Cosmetic Surgery Conjecture. arXiv:1701.02361v1, 2017. (version 2 omits the reference to the OEIS)
  332. Latham Boyle, Paul J Steinhardt, Self-Similar One-Dimensional Quasilattices, arXiv preprint arXiv:1608.08220, 2016.
  333. Philip Boyle Smith, David Tong, What Symmetries are Preserved by a Fermion Boundary State?, arXiv:2006.07369 [hep-th], 2020. (A031360)
  334. Marek Bożejko, Światosław R. Gal, Wojciech Młotkowski, Positive definite functions on Coxeter groups with applications to operator spaces and noncommutative probability, arXiv:1704.06845 [math.OA], 2017.
  335. M. Bozejko and T. Hasebe, On free infinite divisibility for classical Meixner distributions, arXiv preprint arXiv:1302.4885, 2013
  336. Stevo Bozinovski and Adrijan Božinovski, Artificial Intelligence and infinity: Infinite series generated by Turing Machines, SoutheastCon, 2017. doi:10.1109/SECON.2017.7925371
  337. Stevo Bozinovski, Adrijan Bozinovski, Brain Rhythms, Pascal Triangle, and Brain-Computer Interface, 54th Int'l Scientific Conference on Information, Communication, and Energy Systems and Technologies (ICEST, Ohrid, North Macedonia 2019), 191-193. PDF (A277267, A279521)
  338. Stevo Bozinovski, Adrijan Bozinovski, A Non-asymptotic Space Complexity of a Backtracking Algorithm for the N-queens Problem, 54th Int'l Scientific Conference on Information, Communication, and Energy Systems and Technologies (ICEST, Ohrid, North Macedonia 2019), 176-178, PDF (A000170)
  339. D. Bozkurt, C. M. da Fonseca, F. Yilmaz, The determinants of circulant and skew-circulant matrices with tribonacci numbers, Mathematical Sciences And Applications E-Notes, Volume 2 No. 2 pp. 67-75 (2014); PDF
  340. L. Bracci, L. E. Picasso, A simple iterative method to write the terms of any order of perturbation theory in quantum mechanics, The European Physical Journal Plus, October 2012, 127:119, doi:10.1140/epjp/i2012-12119-6
  341. Harry W. Braden, Victor Z. Enolskii and Andrew N.W. Hone, Bilinear recurrences and addition formulae for hyperelliptic sigma functions (2005), arXiv:math/0501162.
  342. Tom Braden, Artem Vysogorets, Kazhdan-Lusztig polynomials of matroids under deletion, arXiv:1909.09888 [math.CO], 2019. (A005043)
  343. Phillip G. Bradford, Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability, arXiv:1802.05239 [cs.DS], 2018. (A007583)
  344. B. Bradie, Extensions and Refinements of some properties of sums involving Pell Numbers, Miss. J. Math. Sci 22 (1) (2010) 37-43 Euclid
  345. D. M. Bradley, A Class of Series Acceleration Formulae for Catalan's Constant, The Ramanujan Journal, Vol. 3, Issue 2, June 1999, pp. 159-173.
  346. D. M. Bradley, Experimental Mathematics via Inverse Symbolic Computation, Invited Talk, Department of Mathematics and Statistics, University of Maine, Orono, Maine, June 12, 1997.
  347. Patrick Erik Bradley and Norbert Paul, Comparing G-maps with other topological data structures, Geoinformatica, 2013: doi:10.1007/s10707-013-0191-1
  348. Paul Bradley, Prime Number Sums, arXiv:1809.01012 [math.GR], 2018. (A073364)
  349. Paul Bradley and Peter Rowley, Orbits on k-subsets of 2-transitive Simple Lie-type Groups, 2014;
  350. James P. Bradshaw, Philipp Lampe, Dusan Ziga, Snake graphs and their characteristic polynomials, arXiv:1910.11823 [math.CO], 2019. (A152063)
  351. Richard Brak, A Universal Bijection for Catalan Structures, arXiv:1808.09078 [math.CO], 2018. (A000108)
  352. R. Brak, A. C. Oppenheim and A. L. Owczarek, Anisotropic step, surface contact and area weighted directed walks on the triangular lattice, Int. J. Mod. Phys. B, Vol. 16, N. 9 (2002), 1269-1299.
  353. M. Brand, Munchhausen Matrices, Electronic Journal of Combinatorics, 19(4) (2012), #P40.
  354. Matthew Brand, Choosing 1 of N with and without lucky numbers, arXiv:1808.07994 [math.NT], 2018. (A002326)
  355. Michael Brand, Lower bounds on the Munchhausen problem, arXiv preprint arXiv:1304.7075, 2013. Also AUSTRALASIAN JOURNAL OF COMBINATORICS, Volume 59(1) (2014), Pages 81-85.
  356. M. Brand, Friedman numbers have density 1, - Discrete Applied Mathematics, Volume 161, Issues 16-17, November 2013, Pages 2389-2395.
  357. Petter Brändén, Jonathan Leake, Igor Pak, Lower bounds for contingency tables via Lorentzian polynomials, arXiv:2008.05907 [math.CO], 2020. (A001500, A037302)
  358. Brändén, Petter; Mansour, Toufik, Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A 110 (2005), no. 1, 127-145.
  359. Petter Branden, Toufik Mansour, Finite automata and pattern avoidance in words, Journal of Combinatorial Theory, Series A, Volume 110, Issue 1, April 2005, Pages 127-145.
  360. Adam Brandenburger, The Strategist: Strategy from Combination, 2018. PDF (A000522)
  361. J. H. Brandts, Nonobtuse and acute simplices and triangulations, NWO (2010)
  362. J. Brandts and C. Cihangir, Counting triangles that share their vertices with the unit n-cube, in Conference Applications of Mathematics 2013 in honor of the 70th birthday of Karel Segeth. Jan Brandts, Sergey Korotov, et al., eds., Institute of Mathematics AS CR, Prague 2013;
  363. Jan Brandts, A Cihangir, Enumeration and investigation of acute 0/1-simplices modulo the action of the hyperoctahedral group, arXiv preprint arXiv:1512.03044, 2015
  364. Maria Bras-Amoros, Fibonacci-like behavior of the number of numerical semigroups of a given genus, Semigroup Forum, Volume 76, Number 2 / March, 2008.
  365. Maria Bras-Amorós, J Fernández-González, Computation of numerical semigroups by means of seeds, arXiv preprint arXiv:1607.01545, 2016
  366. Leigh Marie Braswell and Tanya Khovanova, Cookie Monster Devours Naccis, The College Mathematics Journal, Volume 45, Number 2, March 2014, pp. 129-135 and arXiv:1305.4305
  367. J. S. Brauchart, P. D. Dragnev, E. B. Saff, An Electrostatics Problem on the Sphere Arising from a Nearby Point Charge, arXiv preprint arXiv:1402.3367, 2014
  368. Brauchart, J. S.; Dragnev, P. D.; Saff, E. B.; van de Woestijne, C. E. doi:10.1007/s10474-012-0195-6 A fascinating polynomial sequence arising from an electrostatics problem on the sphere. Acta Math. Hung. 137, No. 1-2, 10-26 (2012)
  369. Benjamin Braun, Hugo Corrales, Scott Corry, Luis David García Puente, Darren Glass, Nathan Kaplan, Jeremy L. Martin, Gregg Musiker, Carlos E. Valencia. Counting Arithmetical Structures on Paths and Cycles. arXiv:1701.06377, 2017.
  370. Benjamin Braun, WK Hough, Matching and Independence Complexes Related to Small Grids, arXiv preprint arXiv:1606.01204, 2016.
  371. Benjamin Braun, Fu Liu, h*-Polynomials With Roots on the Unit Circle, arXiv:1807.00105 [math.CO], 2018. "Experimental data combined with an OEIS search leads us to the following conjecture..."
  372. Georg Braun, On the Growth of a Ballistic Deposition Model on Finite Graphs, arXiv:2001.09836 [math.PR], 2020. (A230137)
  373. V Braun, P Candelas, X de la Ossa, Two One-Parameter Special Geometries, arXiv preprint arXiv:1512.08367, 2015.
  374. Sarah Brauner, Forrest Glebe, David Perkinson, Enumerating linear systems on graphs, arXiv:1906.04768 [math.CO], 2019. (seq) We would ... like to acknowledge our extensive use of the ... On-line Encyclopedia of Integer Sequences
  375. Eric F. Bravo and Jhon J. Bravo, Some arithmetic functions of factorials in Lucas sequences, Glasnik Matematički (2020) Vol. 5(75)(202), 1-12. PDF (A000010, A000108, A000203, A001065)
  376. Eric F. Bravo, Carlos A. Gómez, Florian Luca, Product of Consecutive Tribonacci Numbers With Only One Distinct Digit, J. Int. Seq., Vol. 22 (2019), Article 19.6.3. HTML (A010785, A101292)
  377. Jhon J. Bravo, Sergio Guzmán, Florian Luca, Repdigit Keith numbers, Lithuanian Mathematical Journal, April 2013, Volume 53, Issue 2, pp. 143-148.
  378. Jhon J. Bravo, Jose L. Herrera, José L. Ramírez, Combinatorial Interpretation of Generalized Pell Numbers, J. Int. Seq., Vol. 23 (2020), Article 20.2.1. HTML (A000045, A000129, A038207, A077939, A102036)
  379. William Joseph Bray, Resolving a Chaotic Fractal out of the Total Global Debt, 2018. HTML (A086181, A098587)
  380. Bremner, Murray R. Algebras, dialgebras, and polynomial identities, Serdica Math. J. 38, No. 1-3, 91-136 (2012)
  381. M. R. Bremner, Free associative algebras, noncommutative Grobner bases, and universal associative envelopes for nonassociative structures, arXiv preprint arXiv:1303.0920, 2013
  382. Murray Bremner and Vladimir Dotsenko, Boardman--Vogt tensor products of absolutely free operads, arXiv:1705.04573 [math.KT], 2017.
  383. M. R. Bremner, H. A. Eigendy, Alternating quaternary algebra structures on irreducible representations of sl_2(C), Lin. Alg. Applic. 433 (2010) 1686-1705 doi:10.1016/j.laa.2010.06.014
  384. Murray R. Bremner, Hader A. Elgendy, Special Identities for Comtrans Algebras, arXiv:1806.10204 [math.RA], 2018. (A025035)
  385. Bremner, Murray R.; Hentzel, Irvin R.; Peresi, Luiz A., Dimension formulas for the free nonassociative algebra. Comm. Algebra 33 (2005), no. 11, 4063-4081.
  386. M. Bremner, S. Madariaga, Permutation of elements in double semigroups, arXiv preprint arXiv:1405.2889, 2014
  387. M. Bremner, S. Madariaga, Lie and Jordan products in interchange algebras, arXiv preprint arXiv:1408.3069, 2014
  388. M. Bremner, S. Madariaga, L. A. Peresi, Structure theory for the group algebra of the symmetric group, with applications to polynomial identities for the octonions, arXiv preprint arXiv:1407.3810, 2014
  389. Murray Bremner, Martin Markl, Distributive laws between the Three Graces, arXiv:1809.08191 [math.AT], 2018. (A001813, A011781, A226909, A276277)
  390. Bremner, Murray R.; Peresi, Luiz A. Special identities for quasi-Jordan algebras. Comm. Algebra 39 (2011), no. 7, 2313-2337.
  391. M. R. Bremner, L. A. Peresi and J. Sanchez-Ortega, Malcev dialgebras, Arxiv preprint arXiv:1108.0586, 2011 and Lin. Multin. Alg. 60 (10) (2012) 1125 doi:10.1080/03081087.2011.651721
  392. T. Daniel Brennan, Christian Ferko, Savdeep Sethi, A Non-Abelian Analogue of DBI from TT, arXiv:1912.12389 [hep-th], 2019. See also SciPost Phys. (2020) Vol. 8, 052. doi:10.21468/SciPostPhys.8.4.052 (A000260, A002293)
  393. R. P. Brent, Generalising Tuenter's binomial sums, arXiv preprint arXiv:1407.3533, 2014 and J. Int. Seq. 18 (2015) # 15.3.2
  394. Richard P. Brent, Asymptotic approximation of central binomial coefficients with rigorous error bounds, arXiv preprint arXiv:1608.04834, 2016.
  395. Richard P. Brent, The Multiplication Table Problem Revisited, Australian National University and CARMA, University of Newcastle (Australia, 2019). PDF (A027417)
  396. R. P. Brent, M. Coons, W. Zudilin, Asymptotics of a Mahler Function, Slides of talk presented at AustMS/NZMS 2014, Melbourne, 8 December 2014; PDF
  397. Richard P. Brent, M. L. Glasser, Anthony J. Guttmann, A Conjectured Integer Sequence Arising From the Exponential Integral, arXiv:1812.00316 [math.NT], 2018. (A000012, A000272, A067653, A067764, A073003, A293125, A321937, A321938, A321939, A321940, A321941, A321942)
  398. Richard P. Brent and David Harvey, Fast computation of Bernoulli, Tangent and Secant numbers, Arxiv preprint arXiv:1108.0286, 2011
  399. R. P. Brent and J. H. Osborn, Bounds on minors of binary matrices, Arxiv preprint arXiv:1208.3330, 2012
  400. R. P. Brent and J. H. Osborn, On minors of maximal determinant matrices, Arxiv preprint arXiv:1208.3819, 2012
  401. R. P. Brent, J. H. Osborn and W. D. Smith, Lower bounds on maximal determinants of +-1 matrices via the probabilistic method, arXiv preprint arXiv:1211.3248, 2012
  402. R. P. Brent and C. Pomerance, The multiplication table, and random factored integers,, 2012.
  403. R. P. Brent, C. Pomerance, Some mysteries of multiplication, and how to generate random factored integers, Slides of a talk given in Feb. 2015;
  404. Richard P. Brent, Carl Pomerance, Jonathan Webster, Algorithms for the Multiplication Table Problem, 2018. PDF (A027417)
  405. Richard P. Brent, AB Yedidia, Computation of Maximal Determinants of Binary Circulant Matrices, arXiv preprint arXiv:1801.00399, 2018.
  406. Francesco Brenti, Angela Carnevale, Odd length: odd diagrams and descent classes, National University of Ireland, (Galway, Ireland, 2020). PDF (A001405, A335926)
  407. Francesco Brenti, Angela Carnevale, Bridget Eileen Tenner, Odd diagrams, Bruhat order, and pattern avoidance, arXiv:2009.08865 [math.CO], 2020. (A335926)
  408. Marco Bressan, Stefano Leucci, Alessandro Panconesi, Faster motif counting via succinct color coding and adaptive sampling, arXiv:2009.03052 [cs.DS], 2020. (A001349)
  409. Gabriella Bretti, Pierpaolo Natalini, Paolo Emilio Ricci, Adjoint Peters and Pidduk polynomials, International Journal of Advances in Mathematics (2019) Vol. 2019, No. 5, 22-34. PDF
  410. Breuer, Felix; Dall, Aaron Bounds on the coefficients of tension and flow polynomials. J. Algebraic Combin. 33 (2011), no. 3, 465-482.
  411. Breuer, Felix; Dall, Aaron; Kubitzke, Martina doi:10.1016/j.disc.2012.04.027 Hypergraph coloring complexes. Discrete Math. 312, No. 16, 2407-2420 (2012).
  412. Florian Breuer, Periods of Ducci sequences and odd solutions to a Pellian equation, 2018. PDF (A130229)
  413. Florian Breuer, Igor E. Shparlinski, Lower bounds for periods of Ducci sequences, arXiv:1909.04462 [math.NT], 2019. (A038553)
  414. Y. V. Brezhnev, Uniformization: on the Burnside curve y^2=x^5-x (2001), arXiv:math/0111150.
  415. F. Brglez, Of n-dimensional Dice, Combinatorial Optimization, and Reproducible Research: An Introduction, ELEKTROTEHNISKI VESTNIK 78(4): 181-192, 2011;
  416. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the S_n-module structure of the noncommutative harmonics (2007),arXiv:0704.1101.
  417. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the image-module structure of the noncommutative harmonics, Journal of Combinatorial Theory, Series A, Volume 115, Issue 6, August 2008, Pages 1077-1085.
  418. Emmanuel Briand, Samuel A. Lopes, Mercedes Rosas, Normally ordered forms of powers of differential operators and their combinatorics, arXiv:1811.00857 [math.CO], 2018. (A000070)
  419. Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, Jeffrey Shallit, The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations, arXiv:1707.03894 [math.MT], 2017.
  420. Florian Bridoux, Nicolas Durbec, Kevin Perrot, Adrien Richard, Complexity of Maximum Fixed Point Problem in Boolean Networks, Conference on Computability in Europe (CiE 2019) Computing with Foresight and Industry, 132-143. doi:10.1007/978-3-030-22996-2_12 (A006126)
  421. Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier, (I2M), Commutative automata networks, arXiv:2004.09806 [cs.CC], 2020. (A018926)
  422. Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot, Sylvain Sené, Complexity of limit-cycle problems in Boolean networks, arXiv:2001.07391 [cs.DM], 2020. (A000670)
  423. Éric Brier, Rémi Géraud-Stewart, David Naccache, Alessandro Pacco, Emanuele Troiani, Stuttering Conway Sequences Are Still Conway Sequences, arXiv:2006.06837 [math.DS], 2020. (A005150, A006715)
  424. Éric Brier, Rémi Géraud-Stewart, David Naccache, Alessandro Pacco, Emanuele Troiani, The Look-and-Say The Biggest Sequence Eventually Cycles, arXiv:2006.07246 [math.DS], 2020. (A000002, A005150, A006715)
  425. Christopher Briggs, Y Hirano, H Tsutsui, Positive Solutions to Some Systems of Diophantine Equations, Journal of Integer Sequences, 2016 Vol 19 #16.8.4
  426. Keith Briggs, Connectivity of random graphs, Nov 2004
  427. Curtis Bright, Raymond Devillers, and Jeffrey Shallit, Minimal elements for the prime numbers, Experimental Mathematics 25:3 (2016), pp. 321-331.
  428. Brightwell, Graham; Cohen, Gerard; Fachini, Emanuela; Fairthorne, Marianne; Korner, Janos; Simonyi, Gabor; and Toth, Agnes; Permutation capacities of families of oriented infinite paths. SIAM J. Discrete Math. 24 (2010), no. 2, 441-456.
  429. Robert Brignall, A Survey of Simple Permutations (2008); arXiv:0801.0963
  430. Robert Brignall, Vít Jelínek, Jan Kynčl, David Marchant, Zeros of the Möbius function of permutations, arXiv:1810.05449 [math.CO], 2018. (A000255, A002464)
  431. Robert Brignall, Jakub Sliacan, Juxtaposing Catalan Permutation Classes with Monotone Ones, Electronic Journal of Combinatorics 24(2) (2017), #P2.11. Also arXiv:1611.05370 [math.CO], 2016. (A278301)
  432. Robert Brignall, Jakub Sliacan, Combinatorial specifications for juxtapositions of permutation classes, arXiv:1902.02705 [math.CO], 2019. (A278301)
  433. P. H. Brill, Chi ho Cheung, Myron Hlynka, Q. Jiang, Reversibility Checking for Markov Chains, Communications on Stochastic Analysis (2018) Vol. 12, No. 2, Art. 2, 129-135. Abstract (A002807)
  434. Brini, Andrea; Tanzini, Alessandro. Exact results for topological strings on resolved Y^(p,q) singularities. Commun. Math. Phys. 289, No. 1, 205-252 (2009). doi:10.1007/s00220-009-0814-4
  435. David Brink, Five peculiar theorems on simultaneous representation of primes by quadratic forms. J. Number Theory, 2008, to appear. Links: doi:10.1016/j.jnt.2008.04.007, (video abstract).
  436. Brink, David The inverse football pool problem. J. Integer Seq. 14 (2011), no. 8, Article 11.8.8, 9 pp.
  437. D. Brink, A (probably) exact solution to the Birthday Problem, The Ramanujan Journal, June 2012, Volume 28, Issue 2, pp 223-238
  438. Gunnar Brinkmann, Generating regular directed graphs, Discrete Math., 313 (2012), 1-7.
  439. Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur and Hadrien Melot, House of Graphs: a database of interesting graphs, ArXiv preprint arXiv:1204.3549, 2012.
  440. Gunnar Brinkmann and Brendan D. McKay, "Counting Unlabelled Topologies and Transitive Relations", J. Integer Sequences, Volume 8, 2005, Article 05.2.1.
  441. Marcus Brinkmann, Extended Affine and CCZ Equivalence up to Dimension 4, Ruhr University Bochum (2019). Abstract (A002884, A028365, A053763)
  442. Marcus Brinkmann and Gregor Leander, On the classification of APN functions up to dimension five, Designs, Codes and Cryptography, Volume 49, Numbers 1-3 / December, 2008.
  443. J. R. Britnell, A formal identity involving commuting triples of permutations, Preprint 2012,
  444. J. R. BRITNELL, M. WILDON, Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in types A, B and D, arXiv 1507.04803, 2015.
  445. Charles Brittenham, Andrew T. Carroll, T. Kyle Petersen, Connor Thomas, Unimodality via Alternating Gamma Vectors, Electron. J. Combin., Volume 23, Issue 2 (2016), Paper #P2.40
  446. Thomas Britz, Fibonacci numbers: Brief history and counting problems, Parabola (2020) Vol. 56, Issue 1. PDF (A000045)
  447. S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for succession rules, Discr. Math., 298 (2005), 142-154.
  448. Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi, Burrows-Wheeler Transform of Words Defined by Morphisms, International Workshop on Combinatorial Algorithms (IWOCA 2019): Combinatorial Algorithms, 393-404. doi:10.1007/978-3-030-25005-8_32
  449. Brlek, Srecko; Frosini, Andrea; Rinaldi, Simone; Vuillon, Laurent, Tilings by translation: enumeration by a rational language approach. Electron. J. Combin. 13 (2006), no. 1, Research Paper 15, 24 pp.
  450. D. J. Broadhurst, arXiv:hep-th/9604128 On the enumeration of irreducible k-fold Euler sums and their roles in knot theory and field theory.
  451. D. J. Broadhurst, arXiv:hep-th/9612012 Conjectured enumeration of irreducible multiple zeta values, from knots and Feynman diagrams.
  452. D. J. Broadhurst, arXiv:q-alg/9709031 Conjectured enumeration of Vassiliev invariants.
  453. D. J. Broadhurst, arXiv:hep-ph/9909336 Four-loop Dyson-Schwinger-Johnson anatomy.
  454. David Broadhurst, Solutions by radicals at singular values k_N from new class invariants for N \equiv 3 mod 8 (2008); arXiv:0807.2976
  455. David Broadhurst, Dickman polylogarithms and their constants, ArXiv preprint arXiv:1004.0519
  456. D. Broadhurst, Multiple Deligne values: a data mine with empirically tamed denominators, arXiv preprint arXiv:1409.7204, 2014
  457. David Broadhurst, Multiple Landen values and the tribonacci numbers, preprint arXiv:1504.05303, 2015.
  458. David Broadhurst, L-series from Feynman diagrams with up to 22 loops, 7 June 2017.
  459. D. J. Broadhurst and D. Kreimer: arXiv:hep-th/9609128 Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops. Phys. Lett. B 393, No.3-4, 403-412 (1997).
  460. D. J. Broadhurst and D. Kreimer: arXiv:hep-th/9810087 Renormalization automated by Hopf algebra.]
  461. D. J. Broadhurst and D. Kreimer: arXiv:hep-th/9912093 Combinatoric explosion of renormalization tamed by Hopf algebra: 30-loop Pade-Borel resummation; Physics Letters B, Volume 475, Issues 1-2, 24 February 2000, Pages 63-70.
  462. D. J. Broadhurst and D. Kreimer, arXiv:hep-th/0001202 Towards cohomology of renormalization: bigrading the combinatorial Hopf algebra of rooted trees. Comm. Math. Phys. 215 (2000), no. 1, 217-236.
  463. A. Broder, M. Mitzenmacher and L. Moll, Unscrambling Address Lines, In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), January 1999. (PostScript , Pdf)
  464. Brodmann, Markus, Castelnuovo-Mumford regularity and degrees of generators of graded submodules. Illinois J. Math. 47 (2003), no. 3, 749-767.
  465. A. Brodsky, S. Durocher and E. Gethner, The Rectilinear Crossing Number of K10 is 62, The Electronic Journal of Combinatorics, Volume 8(1), 2001, R#23.
  466. D. M. Broline and D. E. Loeb, arXiv:math.CO/9502225 The Combinatorics of Mancala-Type Games: Ayo, Tchoukaitlon and 1/pi, UMAP Journal, 16.1 (1995) 21-36.
  467. I. Broster, A. Burns, Timing analysis of real-time communication under electromagnetic interference, Real-time Systems 30 (2005) 55-81, doi:10.1007/s11241-005-0504-z
  468. H. J. Brothers, Pascal's triangle: The hidden stor-e, The Mathematical Gazette, March 2012.
  469. H. J. Brothers, Pascal's Prism, The Mathematical Gazette, July 2012.
  470. H. J. Brothers, Pascal's Prism: Supplementary Material,'s_Prism_(supplement).pdf.
  471. C. Brouder, W. J. Keith and A. Mestre, Closed forms for a multigraph enumeration, arXiv preprint arXiv:1301.0874, 2013
  472. Kevin A. Broughan, "The Gcd-Sum Function", J. Integer Sequences, Volume 4, 2001, Article 01.2.2.
  473. Kevin A. Broughan, "Characterizing the Sum of Two Cubes", J. Integer Sequences, Volume 6, 2003, Article 03.4.6.
  474. Kevin A. Broughan, "The Average Order of the Dirichlet Series of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.4.2.
  475. S. A. Broughton, D. M. Haney, L. T. McKeough and B. S. Mayfield, Divisible Tilings in the Hyperbolic Plane, New York J. Math. 6 (2000) 237-283.
  476. J. Brousek, R. Cada, T. Kaiser, Z. Ryjácek, Diskrétní matematika, Lecture Notes.
  477. Nicolas Broutin, Philippe Flajolet, The height of random binary unlabelled trees (2008); arXiv:0807.2365
  478. Broutin, Nicolas; Flajolet, Philippe doi:10.1002/rsa.20393 The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms 41, No. 2, 215-252 (2012).
  479. Andries E. Brouwer, J. Daniel Christensen, Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice, arXiv:1702.03018 [math.CO], 2017.
  480. A. E. Brouwer, The Enumeration of Locally Transitive Tournaments. Math. Centr. Report ZW138, Amsterdam, April 1980.
  481. A. E. Brouwer, G. Horvath, Il. Molnar-Saska, C. Szabo, On Three-rowed chomp, INTEGERS 5 (2005) #G07
  482. Benjamin Braun, Brian Davis, Antichain Simplices, arXiv:1901.01417 [math.CO], 2019. (A002182, A004394, A040047)
  483. C. A. Brown, C. S. Carrillo Vazquez, R. Goswami, S. Heil, M. Scheepers, The Sortability of Graphs and Matrices under Context Directed Swaps, arXiv:1904.03287 [math.CO], 2019. (A249165)
  484. D. R. L. Brown, Bounds on surmising remixed keys, 2015, Preprint,
  485. David E. Brown, Eric Culver, Bryce Frederickson, Sidney Tate, Brent J. Thomas, Entropy of Tournament Digraphs, arXiv:1812.09458 [math.CO], 2018. (A000571)
  486. F. C. S. Brown, T. M. A. Fink and K. Willbrand, arXiv:math/0607763 On arithmetic and asymptotic properties of up-down numbers, [math.CO] (2006); Discrete Math. 307 (2007), no. 14, 1722-1736.
  487. Francis Brown, Irrationality proofs for zeta values, moduli spaces and dinner parties, arXiv preprint arXiv:1412.6508, 2014
  488. Brown, Francis; Schnetz, Oliver doi:10.1215/00127094-1644201 A K_3 in phi^4. Duke Math. J. 161, No. 10, 1817-1862 (2012)
  489. Graeme Brown, The Congruent Number Problem, 2014;
  490. Jason I. Brown, Danielle Cox, Andrew Hoefel, Neil McKay, Rebecca Milley, Richard Nowakowski, Angela A. Siegel, A Note on Polynomial Profiles of Placement Games, Games of No Chance 5 (2017) Vol. 70, See p. 246. Abstract
  491. Brown, Lindsey; Ha, Hoang; Hodge, Jonathan K. Single-peaked preferences over multidimensional binary alternatives. Discrete Appl. Math. 166 (2014), 14-25.
  492. Paul Brown and Trevor Fenner, Fast Generation of Unlabelled Free Trees using Weight Sequences, arXiv:2010.07211 [cs.DS], 2020. (A000055, A000081)
  493. Sierra Brown, Spencer Daugherty, Eugene Fiorini, Barbara Maldonado, Diego Manzano-Ruiz, Sean Rainville, Riley Waechter, Tony W. H. Wong, Nimber Sequences of Node-Kayles Games, J. Int. Seq., Vol. 23 (2020), Article 20.3.5. HTML (A002186, A002187, A071426, A071441, A071461, A286332, A316533, A316629, A316632, A316781, A317367)
  494. Tricia M. Brown, Kaleidoscopes, Chessboards, and Symmetry, Journal of Humanistic Mathematics, Volume 6 Issue 1 ( January 2016), pages 110-126. doi:10.5642/jhummath.201601.08 . Available at:
  495. TM Brown, On the unimodality of convolutions of sequences of binomial coefficients, arXiv preprint arXiv:1810.08235, 201.
  496. Tricia Muldoon Brown, The Problem of Pawns, arXiv:1811.09606 [math.CO], 2019. (A002894), also in The Electronic Journal of Combinatorics (2019) Vol. 26, Issue 3, #P3.21. PDF
  497. Tricia Muldoon Brown, Queens, Attack!, The Mathematical Intelligencer (2020). doi:10.1007/s00283-019-09963-y (A018807)
  498. Browning, Joshua; Stones, Douglas S.; Wanless, Ian M. Bounds on the number of autotopisms and subsquares of a Latin square. Combinatorica 33 (2013), no. 1, 11-22.
  499. Thomas Browning, Counting Parabolic Double Cosets in Symmetric Groups, arXiv:2010.13256 [math.CO], 2020. (A000670, A036969, A120733, A156289, A260700)
  500. Brualdi, Richard A.; Fritscher, Eliseu Hankel and Toeplitz X-rays of permutations. Linear Algebra Appl. 449 (2014), 350-380.
  501. Emanuele Brugnoli, Enumerating the Walecki-Type Hamiltonian Cycle Systems, Journal of Combinatorial Designs, Volume 25, Issue 11, November 2017, p. 481–493. doi:10.1002/jcd.21558
  502. H. Bruhn, L. Gellert, J. Günther, Jacobsthal numbers in generalised Petersen graphs, arXiv preprint arXiv:1503.03390, 2015 and J. Graph Theory (2016) doi:10.1002/jgt.22017
  503. P. Bruillard, S.-H. Ng, E. Rowell, Z. Wang, On modular categories, arXiv preprint arXiv:1310.7050, 2013
  504. Henk Bruin, C Carminati, C Kalle, Matching for generalised beta-transformations, arXiv preprint arXiv:1610.01872, 2016
  505. F. Brunault, La fonction 'tau' de Ramanujan, Séminaire des doctorants de l'équipe de théorie des nombres de Chevaleret. (ps, pdf)
  506. Marie-Louise Bruner, Central binomial coefficients also count (2431,4231,1432,4132)-avoiders, preprint arXiv:1505.04929, 2015. (A000984)
  507. Marie-Louise Bruner, Martin Lackner, On the Likelihood of Single-Peaked Preferences, preprint arXiv:1505.05852, 2015. (A006318)
  508. Brunnock, R.; Lettington, M. C.; Schmidt, K. M. On square roots and norms of matrices with symmetry properties. Linear Algebra Appl. 459 (2014), 175-207.
  509. D. Bruns, W. Mostowski, M. Ulbrich, Implementation-level verification of algorithms with KeY, International Journal on Software Tools for Technology Transfer, November 2013.
  510. Winfried Bruns, Pedro A. García-Sánchez, and Luca Moci, The monoid of monotone functions on a poset and arithmetic multiplicities for uniform matroids, arXiv:1902.00864 [math.CO], 2019. See also Journal of Algebra (2020) Vol. 569, 377-400. doi:10.1016/j.jalgebra.2020.10.026 (A014466)
  511. Wlodzimierz Bryc, Raouf Fakhfakh, Wojciech Mlotkowski, Cauchy-Stieltjes families with polynomial variance functions and generalized orthogonality, arXiv:1708.05343 [math.PR], 2017. Also in Probability and Mathematical Statistics (2019), Vol. 39, No. 2, 237-258. Abstract (A001764, A098746, A106228)
  512. Taylor Brysiewicz, Necklaces count polynomial parametric osculants, arXiv:1807.03408 [math.AG], 2018. (A022553, noted as "A24558")
  513. Taylor Brysiewicz, Fulvio Gesmundo, The Degree of Stiefel Manifolds, arXiv:1909.10085 [math.AG], 2019. (A006125)
  514. J. Brzozowski, M. Szykula, Large Aperiodic Semigroups, arXiv preprint arXiv:1401.0157, 2013.
  515. AJ Bu, Robert Dougherty-Bliss, Enumerating Restricted Dyck Paths with Context-Free Grammars, arXiv:2009.09061 [math.CO], 2020. (A001006, A004148)
  516. A. B. Buan and H. Krause, Tilting and cotilting for quivers of type Ãn, J. Pure Appl. Algebra 190 (2004), no. 1-3, 1-21.
  517. B Buca, T Prosen, Connected correlations, fluctuations and current of magnetization in the steady state of boundary driven XXZ spin chains, arXiv preprint arXiv:1509.04911, 2015
  518. Andrew Buchanan, Tanya Khovanova and Alex Ryba, Saturated Domino Coverings, Arxiv preprint arXiv:1112.2115, 2011
  519. R. H. Buchholz and R. L Rathbun, An infinite set of Heron triangles with two rational medians, Amer. Math. Monthly 104 (1997), no. 2, 107-115.
  520. Kevin Buchin, Man-Kwun Chiu, Stefan Felsner, Günter Rote, André Schulz, The Number of Convex Polyominoes with Given Height and Width, arXiv:1903.01095 [math.CO], 2019. (A000108, A000984, A001263, A005436, A008459, A091044, A093118, A324010)
  521. VM Buchstaber, AV Ustinov, Coefficient rings of formal group laws, Sbornik: Mathematics, Volume 206, Number 11;
  522. M. Buckley, R. Garner, S. Lack, R. Street, Skew-monoidal categories and the Catalan simplicial set, arXiv preprint arXiv:1307.0265, 2013
  523. Timothy Budd, Winding of simple walks on the square lattice, arXiv:1709.04042 [math.CO], 2017.
  524. Enrico Paolo C. Bugarin, On quotient cohomology of substitution tiling spaces, Dissertation, Fakultät für Mathematik, Universität Bielefeld, May 2014;
  525. Y. Bugeaud and M. Queffélec, On Rational Approximation of the Binary Thue-Morse-Mahler Number, Journal of Integer Sequences, 16 (2013), #13.2.3.
  526. Yann Bugeaud, Christophe Reutenauer, Samir Siksek, A Sturmian sequence related to the uniqueness conjecture for Markoff numbers, Theoretical Computer Science, Volume 410, Issues 30-32, 20 August 2009, Pages 2864-2869.
  527. Michael Bukata, Ryan Kulwicki, Nicholas Lewandowski, Lara Pudwell, Jacob Roth, Teresa Wheeland, Distributions of Statistics over Pattern-Avoiding Permutations, arXiv:1812.07112 [math.CO], 2018. (A001263, A007318, A008292, A034867, A076791, A091156, A091894, A092107, A093560, A109446, A119462, A236406, A299927)
  528. Agnieszka Bukietyńska, The test of inversion in the analysis of investment funds, Central and Eastern European Journal of Management and Economics, Vol. 5, No. 3, 277-289, September 2017. PDF (A008302)
  529. Grady Bullington, "The Connell Sum Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.2.6.
  530. Fokko J. van de Bult, Dion C. Gijswijt, John P. Linderman, N. J. A. Sloane and Allan R. Wilks, "A Slow-Growing Sequence Defined by an Unusual Recurrence", J. Integer Sequences, Volume 10, 2007, Article 07.1.2. [pdf, ps].
  531. Fokko van de Bult and Jaap Korevaar, Mean value one of prime-pair constants (2008); arXiv:0806.1667
  532. Laurent Bulteau, Stéphane Vialette, Recognizing binary shuffle squares is NP-hard, Theoretical Computer Science (2019). doi:10.1016/j.tcs.2019.01.012
  533. J.-P. Bultel, A, Chouria, J.-G. Luque and O. Mallet, Word symmetric functions and the Redfield-Polya theorem, 2013; PDF
  534. Jean-Paul Bultel, Ali Chouria, Jean-Gabriel Luque, Olivier Mallet. Redfield-Pólya theorem in WSym. In Alain Goupil and Gilles Schaeffer. eds., 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), pp.563-574, 2013, DMTCS Proceedings. <hal-01229736>
  535. Xavier Bultel, Jannik Dreier, Matthieu Giraud, Marie Izaute, Timothée Kheyrkhah, Pascal Lafourcade, Dounia Lakhzoum, Vincent Marlin, Ladislav Motá, Security Analysis and Psychological Study of Authentication Methods with PIN Codes, RCIS 2018 - IEEE 12th International Conference on Research Challenges in Information Science, 2018. <hal-01777898> PDF (A019538
  536. Lukas Bulwahn, Cardinality of Equivalence Relations, 2016; Preprint;
  537. Lukas Bulwahn, Spivey's Generalized Recurrence for Bell Numbers, Archive of Formal Proofs, 2016;
  538. Jim Bumgardner, Variations of the Componium, 2013
  539. D. Bundala, M. Codish, L. Cruz-Filipe et al., Optimal-Depth Sorting Networks, arXiv preprint arXiv:1412.5302, 2014.
  540. Amanda Burcroff, (k,lambda)-Anti-Powers and Other Patterns in Words, arXiv:1807.07945 [math.CO], 2018. (A274543)
  541. Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada, Generating a Gray code for prefix normal words in amortized polylogarithmic time per word, arXiv:2003.03222 [cs.DS], 2020. (A095151, A194850, A238110)
  542. Peter Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada, On prefix normal words and prefix normal forms, Preprint, 2016;
  543. P. Burcsi, G. Fici, Z. Lipták, F. Ruskey, J. Sawada, Normal, Abby Normal, Prefix Normal, arXiv preprint arXiv:1404.2824, 2014.
  544. D. Burde, W.A. Moens, The structure of Lie algebras with a derivation satisfying a polynomial identity, arXiv:2009.05434 [math.RA], 2020. (A048954)
  545. A. P. Burger, M. P. Kidd and J. H. van Vuuren, Enumeration of self-orthogonal Latin squares, Submitted to Journal of Combinatorial Designs.
  546. Burger, A. P.  ; Van Der Merwe, M.; Van Vuuren, J. H. doi:10.1016/j.dam.2012.04.022 An asymptotic analysis of the evolutionary spatial prisoner’s dilemma on a path. Discrete Appl. Math. 160, No. 15, 2075-2088 (2012).
  547. A. Burgess, P. Danziger, E. Mendelsohn, B. Stevens, Orthogonally Resolvable Cycle Decompositions, 2013;
  548. P Bürgisser, C Ikenmeyer, Fundamental invariants of orbit closures, arXiv preprint arXiv:1511.02927, 2015
  549. Emily Burgunder, Ralf Holtkamp, Partial magmatic bialgebras (2007), arXiv:0708.4191.
  550. Paula Burkhardt, Alice Zhuo-Yu Chan, Gabriel Currier, Stephan Ramon Garcia, Florian Luca, Hong Suh, Visual properties of generalized Kloosterman sums, preprint arXiv:1505.00018, 2015. (A000032, A180363)
  551. Madeleine Burkhart, Joel Foisy, Enumerating spherical n-links, Involve, Vol. 11 (2018), No. 2, 195–206. doi:10.2140/involve.2018.11.195 (A000055)
  552. Evgeniy Burlachenko, Riordan arrays and generalized Euler polynomials, arXiv:1709.02229 [math.NT], 2017.
  553. E. Burlachenko, Riordan arrays, Chebyshev polynomials, Fibonacci bases, arXiv:1903.10435 [math.NT], 2019. (A260492)
  554. E. Burlachenko, Composition polynomials of the RNA matrix and B-composition polynomials of the Riordan pseudo-involution, arXiv:1907.12272 [math.NT], 2019. (A112007)
  555. Charles Burnette and Chung Wong, Abelian Squares and Their Progenies, arXiv:1609.05580, 2016.
  556. Chris Burns and Benjamin Purcell, Counting the number of winning binary strings in the 1-dimensional same game, Fib. Q., 45 (2007), 233-238.
  557. Jonathan Burns, Assembly Graph Words - Single Transverse Component (Counts),
  558. Jonathan Burns, Egor Dolzhenko, Natasa Jonoska, Tilahun Muche and Masahico Saito, Four-Regular Graphs with Rigid Vertices Associated to DNA Recombination, May 23, 2011; PDF, Discrete Appl. Math. 161, No. 10-11, 1378-1394 (2013) doi:10.1016/j.dam.2013.01.003.
  559. Jonathan Burns and Tilahun Muche, Counting Irreducible Double Occurrence Words, Arxiv preprint arXiv:1105.2926, 2011.
  560. Alex J. Burrage, Ana Salagean and Raphael C.-W. Phan, On the Stability of m-Sequences, in CRYPTOGRAPHY AND CODING, Lecture Notes in Computer Science, 2011, Volume 7089/2011, 259-274, doi:10.1007/978-3-642-25516-8_16.
  561. Stuart A. Burrell, Han Yu, Digit expansions of numbers in different bases, arXiv:1905.00832 [math.NT], 2019. (A146025, A146026, A146027, A146028, A146029, A230360)
  562. Sophie Burrill, A generating tree approach to k-nonnesting set partitions, Poster SFU Comp. Math. Day, 9 aug 2011
  563. Sophie Burrill, Sergi Elizalde, Marni Mishna and Lily Yen, A generating tree approach to k-nonnesting partitions and permutations, Arxiv preprint arXiv:1108.5615, 2011
  564. S. Burrill, S. Melczer, M. Mishna, A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape, arXiv preprint arXiv:1411.6606, 2014
  565. S. Burrill and L. Yen, Constructing Skolem sequences via generating trees, arXiv preprint arXiv:1301.6424, 2013
  566. W. Burrows, C. Tuffley, Maximising common fixtures in a round robin tournament with two divisions, arXiv preprint arXiv:1502.06664, 2015
  567. Burstein, Alexander, Restricted Dumont permutations. Ann. Comb. 9 (2005), no. 3, 269-280.
  568. Alexander Burstein, Distribution of peak heights modulo k and double descents on k-Dyck paths, arXiv:2009.00760 [math.CO], 2020. (A001263, A108767, A120986)
  569. Alexander Burstein, Opel Jones, Enumeration of Dumont permutations avoiding certain four-letter patterns, arXiv:2002.12189 [math.CO], 2020. (A001003, A007482)
  570. A. Burstein and S. Elizalde, Total occurrence statistics on restricted permutations, arXiv preprint arXiv:1305.3177, 2013
  571. Alexander Burstein, Sergi Elizalde and Toufik Mansour, arXiv:math.CO/0610234 Restricted Dumont permutations, Dyck paths and noncrossing partitions, Discrete Math. 306 (2006), no. 22, 2851-2869.
  572. Alexander Burstein, Sergey Kitaev and Toufik Mansour, Independent sets in certain classes of (almost) regular graphs (2003), arXiv:math/0310379.
  573. Alexander Burstein and Isaiah Lankham, Restricted Patience Sorting and Barred Pattern Avoidance (2005), arXiv:math/0512122.
  574. Alexander Burstein, Megan Martinez, Pattern classes equinumerous to the class of ternary forests, Permutation Patterns Virtual Workshop, Howard University (2020). pdf (A091320, A108410, A120986)
  575. Damian Bursztyn, Fran¸cois Goasdou´e, Ioana Manolescu. Optimizing Reformulation-based Query Answering in RDF. [Research Report] RR-8646, INRIA Saclay. 2014. <hal-01091214>
  576. B. A. Burton and M. Hiron, Exploring informatics olympiad tasks: exploring the black art, Olymp. Inform. 2 (2008) 16-36
  577. Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5. (A000012, A000032, A000045, A000073, A000078, A000213, A000288, A000322, A001590, A001591, A001592, A001630, A001644, A002605, A007486, A010924, A015577, A020992, A021006, A023424, A026150, A028859, A028860, A030195, A057087, A057088, A057089, A057090, A057092, A057093, A066178, A073817, A074048, A074584, A077835, A079262, A080040, A081172, A083337, A084128, A085480, A086192, A086213, A086347, A094013, A100532, A100683, A104144, A104621, A105565, A105754, A105755, A106435, A106568, A108051, A108306, A116556, A121907, A122189, A122265, A123620, A123871, A123887, A124312, A125145, A134924, A141036, A141523, A145027, A164540, A164545, A164593, A168082, A168083, A168084, A170931, A181140, A214727, A214825, A214826, A214827, A214828, A214899)
  578. Chris Busenhart, Lorenz Halbeisen, Norbert Hungerbühler, Oliver Riesen, On primitive solutions of the Diophantine equation x2+ y2 = M, Eidgenössische Technische Hochschule (ETH Zürich, Switzerland, 2020). PDF (A188948, A188949, A230622, A230623, A230710, A230711, A230962, A230963)
  579. N. Bushaw, CE Larson, N Van Cleemput et al., Automated Conjecturing VII: The Graph Brain Project & Big Mathematics, arXiv preprint arXiv:1801.01814, 2017.
  580. R. O. E. Bustos-Espinoza, G. M. Ramírez Ávila, A New Seed Found in an Integer Sequence, (2019). Abstract (A164095)
  581. P. Butera, M. Pernici, Sums of permanental minors using Grassmann algebra, arXiv preprint arXiv:1406.5337, 2014.
  582. Jon T. Butler, Tsutomu Sasao, Realizing all Index Generation Functions by the Row-Shift Method, IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL 2019). doi:10.1109/ISMVL.2019.00032 (A051418)
  583. Steve Butler, Jeongyoon Choi, Kimyung Kim, Kyuhyeok Seo, Enumerating multiplex juggling patterns, arXiv:1702.05808 [math.CO], 2017.
  584. Steve Butler, Fan Chung, Jay Cummings, Ron Graham, Juggling card sequences (2015); arXiv:1504.01426
  585. Steve Butler, Jason Ekstrand, Steven Osborne, Counting Tilings by Taking Walks in a Graph, A Project-Based Guide to Undergraduate Research in Mathematics, Birkhäuser, Cham (2020), 153-176. doi:10.1007/978-3-030-37853-0_5 (A000045, A000129, A005178, A045846, A219924)
  586. Steve Butler and Ron Graham, Enumerating (multiplex) juggling sequences (2008); arXiv:0801.2597 and Ann. Comb. 13 (4) (2010) 413-424 doi:10.1007/s00026-009-0040-y
  587. Butler, Steve, Ron Graham, Gerhard Guettler, and Colin Mallows. Irreducible Apollonian configurations and packings, Discrete and Computational Geometry, 44 (2010), 487-507.
  588. Steve Butler, R Graham, CH Yan, Parking distributions on trees, European Journal of Combinatorics 65 (2017), 168-185.
  589. Steve Butler, Ron Graham and Nan Zang, Jumping sequences (2008); arXiv:0807.2890 and JIS 11 (2008) 08.4.5
  590. S. Butler, P. Karasik, A note on nested sums, J. Int. Seq. 13 (2010), 10.4.4
  591. S. Butler and S. Osborne, Counting tilings by taking walks, PDF, 2012

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.