This site is supported by donations to The OEIS Foundation.

CiteBi

From OeisWiki

Jump to: navigation, search


Contents

CiteBi

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.

References

  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; 10.1007/978-3-319-07599-0_13
  2. M. P. Bianchi, H.-J. Bockenhauer, J. Hromkovic and L. Keller, Online Coloring of Bipartite Graphs With and Without Advice, http://people.ksp.sk/~misof/junk/bipartite.pdf, 2012.
  3. P. Biane, P. Dehornoy, Dual Garside structure of braids and free cumulants of products, arXiv preprint arXiv:1407.1604, 2014
  4. Bidkhori, Hoda; Sullivant, Seth Eulerian-Catalan numbers. Electron. J. Combin. 18 (2011), no. 1, Paper 187, 10 pp.
  5. Yonah Biers-Ariel, A New Quantity Counted by OEIS Sequence A006012, arXiv:1706.07064 [math.CO], 2017.
  6. 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.
  7. 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.
  8. 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 (http://www.sciencepublishinggroup.com/j/pamj); doi:10.11648/j.pamj.20130206.11
  9. L. J. Billera, J. T. Moore, C. D. Moraites, Y. Wang and K. Williams, Maximal unbalanced families, arXiv preprint arXiv:1209.2309, 2012
  10. S. C. Billey, K. Burdzy and B. E. Sagan, Permutations with given peak set, Arxiv preprint arXiv:1209.0693, 2012.
  11. S. C. Billey, M. Konvalinka, and F. E. Matsen, On the enumeration of tanglegrams and tangled chains, arXiv:1507.04976 (2015).
  12. Sara C. Billey, M Konvalinka, TK Petersen, W Slofstra, B. E. Tenner, Parabolic double cosets in Coxeter groups, Discrete Mathematics and Theoretical Computer Science, Submitted, 2016; http://www.math.washington.edu/~billey/papers/DoubleCosets.pdf
  13. Sara C. Billey, Peter R. W. McNamara, The contributions of Stanley to the fabric of symmetric and quasisymmetric functions, preprint arXiv:1505.01115 (A005118)
  14. 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 theorem to date.]
  15. Stefano Bilotta, Variable-length Non-overlapping Codes, arXiv preprint arXiv:1605.03785, 2016
  16. S. Bilotta, E. Pergola and R. Pinzani, A new approach to cross-bifix-free sets, Arxiv preprint arXiv:1112.3168, 2011
  17. S. Bilotta, E. Pergola, R. Pinzani, S. Rinaldi, Recurrence relations versus succession rules, arXiv preprint arXiv:1301.2967, 2013
  18. 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.
  19. Vladislav Bína, Jiří Přibil, Note on enumeration of labeled split graphs, Comment. Math. Univ. Carolin. 56,2 (2015) 133 –137. (A047864)
  20. Aran Bingham, Commutative n-ary Arithmetic, University of New Orleans Theses and Dissertations, Paper 1959, 2015. (A003215)
  21. 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
  22. 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.
  23. D Birmajer, JB Gil, PRW McNamara, MD Weiner, Enumeration of colored Dyck paths via partial Bell polynomials, arXiv preprint arXiv:1602.03550, 2016
  24. D. Birmajer, J. B. Gil, M. D. Weiner, Linear recurrence sequences via Bell polynomials, arXiv preprint arXiv:1405.7727, 2014
  25. 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)
  26. 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.
  27. D. Birmajer, J. B. Gil, M. D. Weiner, Colored partitions of a convex polygon by noncrossing diagonals, arXiv preprint arXiv:1503.05242, 2015
  28. Daniel Birmajer, Juan B. Gil, Michael D. Weiner, (an + b)-color compositions, arXiv:1707.07798 [math.CO], 2017.
  29. 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.
  30. 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."]
  31. Rony A. Bitan and Michael M. Schein, On the flat cohomology of binary norm forms, arXiv:1702.05080 [math.NT], 2017.
  32. 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.
  33. A. Bjorner and R. P. Stanley, A Combinatorial Miscellany in ``New directions in mathematics, Cambridge Univ. Press, to appear. Preprint 1998.
  34. Hadley Black, Implementation of Internal and Semi-External Hierarchical Clustering, DIMACS REU Final Report, 2016; https://users.soe.ucsc.edu/~hablack/unpublished_works/DIMACSreport.pdf
  35. SIMON R. BLACKBURN, JOHN R. BRITNELL, AND MARK WILDON, THE PROBABILITY THAT A PAIR OF ELEMENTS OF A FINITE GROUP ARE CONJUGATE, Arxiv preprint arXiv:1108.1784, 2011
  36. 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.
  37. 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.
  38. Blanchard, Peter Floodstrand, Pseudo-arithmetic sets and Ramsey theory. J. Combin. Theory Ser. A 106 (2004), no. 1, 49-57.
  39. 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)
  40. 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.
  41. R. Blanco, Complexity of Villamayor's algorithm in the monomial case (2007), arXiv:0704.3416.
  42. 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
  43. Blasiak, Pawel; Flajolet, Philippe Combinatorial models of creation-annihilation. Sém. Lothar. Combin. 65 (2010/12), Art. B65c, 78 pp.
  44. 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.
  45. P. Blasiak, K. A. Penson and A. I. Solomon, arXiv:quant-ph/0212072 The Boson Normal Ordering Problem and Generalized Bell Numbers
  46. P. Blasiak, K. A. Penson and A. I. Solomon, arXiv:quant-ph/0303030 Dobinski-type relations and the Log-normal distribution
  47. 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.
  48. 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]
  49. 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).
  50. A. Blass, N. Dobrinen, D. Raghavan, The next best thing to a P-point, arXiv preprint arXiv:1308.3790, 2013
  51. 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
  52. 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.
  53. D. Blessing, E. Insko, K. Johnson, C. Mauretour, On (t,r) Broadcast Domination Numbers of Grids, arXiv preprint arXiv:1401.2499, 2014
  54. Nathan Bliss, J Verschelde, Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods, arXiv preprint arXiv:1606.05563, 2016
  55. Bloch, Ethan D., The angle defect for odd-dimensional simplicial manifolds. Discrete Comput. Geom. 35 (2006), no. 2, 311-328.
  56. S. Bloch, P. Vanhove, The elliptic dilogarithm for the sunset graph, arXiv preprint arXiv:1309.5865, 2013
  57. V. Blondel, Structured Numbers. Properties of a hierarchy of internal operations on binary trees, Acta Informatica, 35, pp. 1-15, 1998. (ps, pdf)
  58. A. Blondin Massé, S. Brlek, S. Labbé, M. Mendès France, Fibonacci Snowflakes, Ann. Sci. Math. Quebec 35 (2011) no 2, 141-152
  59. J. Bloom, A, Burstein, Egge triples and unbalanced Wilf-equivalence, arXiv preprint arXiv:1410.0230, 2014
  60. J. Bloom and S. Elizalde, Pattern avoidance in matchings and partitions, arXiv preprint arXiv:1211.3442, 2012
  61. J. Bloom, V. Vatter, Two Vignettes On Full Rook Placements, arXiv preprint arXiv:1310.6073, 2013
  62. Benjamin A. Blumer, Michael S. Underwood and David L. Feder, Single-qubit unitary gates by graph scattering, arXiv:1111.5032, 2011
  63. Johannes Blumlein, Algebraic relations between harmonic sums and associated quantities, Computer Physics Communications, Volume 159, Issue 1, 1 May 2004, Pages 19-54.
  64. 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.
  65. H. Boas and S. Geller, A Survey of Mathematical Problems, Instructor's Guide.
  66. 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.
  67. Florin P. Boca, An AF algebra associated with the Farey tessellation (2005), arXiv:math/0511505.
  68. 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.
  69. E. Bod, Explicit formulas for parametrized families of irreducible algebraic Appell, Lauricella and Horn functions, arXiv preprint arXiv:1304.2540, 2013
  70. J.-P. Bode, Strategien für Aufbauspiele mit Mosaik-Polyominos, Doctoral Dissertation, 2000.
  71. J. Bodeen, S. Butler, T. Kim, X. Sun, S. Wang, Tiling a strip with triangles, El. J. Combinat. 21 (1) (2014) P1.7
  72. Arnaud Bodin, Number of irreducible polynomials in several variables over finite fields (2007), arXiv:0706.0157, Amer. Math. Monthly, 115 (2008), 653-660.
  73. 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
  74. 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
  75. O. Bodini, A. Genitrini, F. Peschanski, The Combinatorics of Non-determinism, http://www-apr.lip6.fr/~genitrini/publi/fsttcs2013-bogepe.pdf, 2013.
  76. O. Bodini, A. Genitrini, F. Peschanski, A Quantitative Study of Pure Parallel Processes, arXiv preprint arXiv:1407.1873, 2014
  77. 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.
  78. Manuel Bodirsky, Eric Fusy, Mihyun Kang et al., Enumeration of Unlabeled Outerplanar Graphs (2005), arXiv:math/0511422.
  79. M. Bodirsky, Clemens Gröpl and Mihyun Kang, Generating Labeled Planar Graphs Uniformly at Random, Theoret. Comput. Sci. 379 (2007), no. 3, 377-386.
  80. 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.
  81. Bodirsky, Manuel; Kang, Mihyun, Generating outerplanar graphs uniformly at random. Combin. Probab. Comput. 15 (2006), no. 3, 333-343.
  82. 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".)
  83. Andreas Bøe, The Right Left (Published on Amazon, 2014). Science fiction novel that mentions the OEIS.
  84. R. H. Boels, Three particle superstring amplitudes with massive legs, Arxiv preprint arXiv:1201.2655, 2012
  85. R. H. Boels, On the field theory expansion of superstring five point amplitudes, arXiv preprint arXiv:1304.7918, 2013
  86. R. H. Boels, T. Hansen, String theory in target space, arXiv preprint arXiv:1402.6356, 2014
  87. 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
  88. 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.
  89. Bogart, Tristram; Contois, Mark; Gubeladze, Joseph Hom-polytopes. Math. Z. 273 (2013), no. 3-4, 1267-1296.
  90. Nicholas Bohall, On Gaussian Primes, Senior Thesis, June 2016, Department of Mathematics, University of Washington.
  91. Martin Böhm, Graph labeling, Bachelor Thesis, Department of Applied Mathematics, Charles University in Prague, 2011.
  92. Walter M. Böhm, Interesting Topics for Bachelor Theses, 2016; http://statmath.wu.ac.at/~boehm/topics.pdf
  93. K Böhmová, C Dalfó, C Huemer, On cyclic Kautz digraphs, Preprint 2016; http://upcommons.upc.edu/bitstream/handle/2117/80848/Kautz-subdigraphs.pdf
  94. Samuel Boissiere, Etienne Mann and Fabio Perroni, Crepant resolutions of weighted projective spaces and quantum deformations (2006), arXiv:math/0610617.
  95. 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.
  96. 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
  97. 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
  98. Radica Bojicic, Marko D. Petkovic and Paul Barry, The Hankel transform of aerated sequences, Preprint 2013, http://tesla.pmf.ni.ac.rs/people/dexter/papers/121110Watrad-part2.pdf
  99. 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
  100. P Boldi, S Vigna, On the lattice of antichains of finite intervals, arXiv preprint arXiv:1510.03675, 2015
  101. E. Bolker, V. Guillemin and T. Holm, arXiv:math.CO/0206103 How is a graph like a manifold?, preprint.
  102. 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.
  103. 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.
  104. Tommaso Bolognesi, A pseudo-random network mobile automaton with linear growth, Information Processing Letters, Volume 109, Issue 13, 15 June 2009, Pages 668-674.
  105. Tommaso Bolognesi, V Ciancia, Nominal Cellular Automata, arXiv preprint arXiv:1608.03320, 2016
  106. S. Bolus, A QOBDD-based Approach to Simple Games, Dissertation, Doktor der Ingenieurwissenschaften der Technischen Fakultaet der Christian-Albrechts-Universitaet zu Kiel, http://www.informatik.uni-kiel.de/~stb/files/diss_bolus.pdf, 2012.
  107. 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.
  108. M. Bona, Non-overlapping permutation patterns, PU. M. A. Vol. 22 (2012), 99-105; http://www.mat.unisi.it/newsito/puma/public_html/22_2/bona.pdf.
  109. M. Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015.
  110. Miklos Bona, Balanced vertices in labeled rooted trees, arXiv:1705.09688 [math.CO], 2017.
  111. Miklos Bona and Philippe Flajolet, Isomorphism and Symmetries in Random Phylogenetic Trees (2009) arXiv:0901.0696
  112. Miklos Bóna, R Gómez, MD Ward, Workshop in Analytic and Probabilistic Combinatorics BIRS-16w5048 , 2016; http://www.birs.ca/workshops/2016/16w5048/report16w5048.pdf
  113. M. Bóna, C. Homberger, J. Pantone, V. Vatter, Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration, arXiv preprint arXiv:1310.7003, 2013
  114. 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.
  115. 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.
  116. Miklos Bona, Rebecca Smith, An Involution on Involutions and a Generalization of Layered Permutations, arXiv preprint arXiv:1605.06158, 2016
  117. Maria Paola Bonacina and Nachum Dershowitz, Canonical Inference for Implicational Systems, in Automated Reasoning, Lecture Notes in Computer Science, Volume 5195/2008, Springer-Verlag.
  118. 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.
  119. A. Bonato and B. Yang, Graph searching and related problems, PDF
  120. Nicolas Bonichon, M Bousquet-Mélou, P Dorbec, On the number of planar Eulerian orientations, arXiv preprint 2016
  121. Nicolas Bonichon and Benjamin Lévêque, A bijection for essentially 4-connected toroidal triangulations, arXiv:1707.08191 [cs.DM], 2017.
  122. 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.
  123. A. R. Booker, On Mullin's second sequence of primes, Arxiv preprint arXiv:1107.3318, 2011, INTEGERS 12A (2012): John Selfridge Memorial Issue, #A4.
  124. Andrew R. Booker, A variant of the Euclid-Mullin sequence containing every prime, arXiv preprint arXiv:1605.08929, 2016
  125. A. R. Booker, S. A. Irvine, The Euclid-Mullin graph, arXiv preprint arXiv:1508.03039, 2015
  126. Julius Borcea, Boris Shapiro, Classifying real polynomial pencils (2004), arXiv:math/0404215.
  127. Olivier Bordellès, "A Note on the Average Order of the gcd-sum Function", J. Integer Sequences, Volume 10, 2007, Article 07.3.3.
  128. Olivier Bordelles, An Asymptotic Formula for Short Sums of Gcd-Sum Functions, Journal of Integer Sequences, Vol. 15 (2012), #12.6.8.
  129. O. Bordelles and B. Cloitre, Bounds for the Kolakoski Sequence, J. Integer Sequences, 14 (2011), #11.2.1.
  130. 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.
  131. Magnus Bordewich, Martin Dyer and Marek Karpinski, Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs (2005), arXiv:math/0501081.
  132. Börger, Reinhard Continuous selections, free vector lattices and formal Minkowski differences. J. Convex Anal. 18 (2011), no. 3, 855-864.
  133. N. Borie, Combinatorics of simple marked mesh patterns in 132-avoiding permutations, arXiv preprint arXiv:1311.6292, 2013
  134. 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. <http://ajc.maths.uq.edu.au/pdf/64/ajc v64 p140.pdf>. <hal-01222921>
  135. Nicolas Borie, The Hopf Algebra of graph invariants, arXiv preprint arXiv:1511.05843, 2015
  136. Nicolas Borie, Three-dimensional Catalan numbers and product-coproduct prographs, arXiv:1704.00212 [math.CO], 2017.
  137. Michael Borinsky, Generating asymptotics for factorially divergent sequences, arXiv preprint arXiv:1603.01236, 2016
  138. Michael Borinsky, Renormalized asymptotic enumeration of Feynman diagrams, arXiv:1703.00840 [hep-th], 2017.
  139. Bornemann, F., The SIAM 100-Digit Challenge: A Decade Later, Jahresber. Dtsch. Math. Ver. (2016) 118: 87. doi:10.1365/s13291-016-0137-2
  140. G. Boros and V. H. Moll. Irresistible Integrals, Cambridge, 2004.
  141. 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.
  142. A Borowiec, W Mlotkowski, New Eulerian numbers of type D, arXiv preprint arXiv:1509.03758, 2015
  143. 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]
  144. J. Borwein, Aesthetics for the Working Mathematician, April 2001. [ps pdf]
  145. J. Borwein, The Impact of Technology on the Doing of Mathematics, April 2000. [ps pdf]
  146. 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]
  147. 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; http://www.carma.newcastle.edu.au/jon/hhm.pdf
  148. J. M. Borwein, A short walk can be beautiful, 2015; https://www.carma.newcastle.edu.au/jon/beauty.pdf
  149. J. M. Borwein, Adventures with the OEIS, Preprint, March 2016.
  150. 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.
  151. J. Borwein and P. Borwein, Some observations on computer aided analysis, Notices Amer. Math. Soc. 39 (1992), 825-829.
  152. J. M. Borwein and D. M. Bailey, Mathematics by Experiment, Peters, Boston, 2004.
  153. J. Borwein, D. Bailey and R. Girgensohn, Experimentation in Mathematics: Computational Paths to Discovery, Peters, Boston, 2004.
  154. J. M. Borwein and P. B. Borwein, Challenges in Mathematical Computing, Computing in Science and Engineering 3 (2001), 48-53. (PostScript , Pdf)
  155. J. M. Borwein, P. R. Borwein and K. Dilcher, Pi, Euler numbers and asymptotic expansions, Amer. Math. Monthly, 96 (1989), 681-687.
  156. 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.
  157. 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.
  158. J. M. Borwein, Marc Chamberland, doi:10.1155/2007/19381 Integer Powers of Arcsin, Int. J. Math. Math. Sci. 2007, #19381.
  159. 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
  160. J. M. Borwein and S. T. Chapman, I prefer pi ..., Amer. Math. Monthly, 122 (2015), 195-216.
  161. J. M. Borwein and K.-K. S. Choi, On the Representations of xy+yz+zx, Experimental Math., 9 (2000), 153-158.
  162. 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)
  163. 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.
  164. 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.)
  165. J. M. Borwein and R. M. Corless, Emerging tools for experimental mathematics, Amer. Math. Monthly, 106 (No. 10, 1999), 889-909.
  166. 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)
  167. 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.)
  168. 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.
  169. Jonathan M. Borwein and Armin Straub, Mahler measures, short walks and log-sine integrals, http://carma.newcastle.edu.au/~jb616/wmi-paper.pdf.
  170. Jonathan M. Borwein, Armin Straub and Christophe Vignat, Densities of short uniform random walks, Part II: Higher dimensions, Preprint, 2015; http://www.carma.newcastle.edu.au/jon/dwalks.pdf
  171. Robert Bosch, Tale of a Problem Solver, Arista Publishing, Miami FL, 2016.
  172. 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.
  173. Wieb Bosma, Michel Dekking, Wolfgang Steiner, A remarkable integer sequence related to pi and sqrt(2), arXiv:1710.01498, 4 Oct 2017.
  174. A. Bostan, Computer Algebra for Lattice Path Combinatorics, Seminaire de Combinatoire Ph. Flajolet, March 28 2013; https://www-apr.lip6.fr/sem-comb-slides/IHP-bostan.pdf
  175. 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)
  176. 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
  177. Alin Bostan, Manuel Kauers, Automatic Classification of Restricted Lattice Walks arXiv:0811.2899
  178. Nigel Boston, Explicit Galois Groups of Infinite p-Extensions Unramified at p, preprint.
  179. Nigel Boston and Jing Hao, The Weight Distribution of Quasi-quadratic Residue Codes, arXiv:1705.06413 [cs.IT], 2017.
  180. O. Bottema, The Malfatti problem, Forum Geom. 1, 43-50, (2001).
  181. H. Bottomley, Some Smarandache-type multiplicative sequences, Smarandache Notions Journal, Vol. 13, 2002, pp. 134-139.
  182. Karem Boubaker and Lin Zhang, Fermat-linked relations for the Boubaker polynomial sequences via Riordan matrices analysis, Arxiv preprint arXiv:1203.2082, 2012
  183. Youssef Boudabbous, Maurice Pouzet, The morphology of infinite tournaments; application to the growth of their profile, European Journal of Combinatorics, In Press, Corrected Proof, Available online 17 May 2009.
  184. O. Bouillot, The Algebra of Multitangent Functions, http://www.math.u-psud.fr/~bouillot/OB_The_Algebra_of_Multitangent_Functions.pdf, 2013
  185. 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.
  186. Belgacem Bouras, A New Characterization of Catalan Numbers Related to Hankel Transforms and Fibonacci Numbers, Journal of Integer Sequences, 16 (2013), #13.3.3.
  187. Jean-Emile Bourgine, PA Pearce, E Tartaglia, Logarithmic Minimal Models with Robin Boundary Conditions, arXiv preprint arXiv:1601.04760, 2016
  188. Sadek Bouroubi, "Integer Partitions and Convexity", J. Integer Sequences, Volume 10, 2007, Article 07.6.3.
  189. Thierry Bousch, LA TOUR DE STOCKMEYER, Seminaire Lotharingien de Combinatoire 77 (2017), Article B77d; http://www.emis.de/journals/SLC/wpapers/s77bousch.pdf
  190. M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar 2-face maps, Discrete Mathematics, 222 (2000), 1-25.
  191. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees, Proceedings FPSAC02, 133-147, (2002). (PostScript, Pdf)
  192. M. Bousquet and C. Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.
  193. Bousquet, Michel; and Lamathe, Cedric; On symmetric structures of order two. Discrete Math. Theor. Comput. Sci. 10 (2008), 153-176.
  194. 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.
  195. Adrien Boussicault, P Laborde-Zubieta, Periodic Parallelogram Polyominoes, arXiv preprint arXiv:1611.03766, 2016
  196. 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.
  197. 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>
  198. 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)
  199. Mireille Bousquet-Melou and Marni Mishna, Walks with small steps in the quarter plane (preliminary version), arXiv:0810.4387 [math.CO]
  200. 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.
  201. M. Bousquet-Mélou and G. Schaeffer, Walks on the slit plane, Probab. Theory Related Fields, 124 (2002), no. 3, 305-344.
  202. 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.
  203. J. Bouttier and E. Guitter, A note on irreducible maps with several boundaries, arXiv preprint arXiv:1305.4816, 2013
  204. Mathilde Bouvel, Cedric Chauve, Marni Mishna and Dominique Rossin, Average-case analysis of perfect sorting by reversals, Arxiv preprint arXiv:1201.0940, 2012
  205. Bouvel, Mathilde; Ferrari, Luca On the enumeration of d-minimal permutations. Discrete Math. Theor. Comput. Sci. 15 (2013), no. 2, 33-48.
  206. 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.
  207. M Bouvel, V Guerrini, S Rinaldi, Slicings of parallelogram polyominoes, or how Baxter and Schroeder can be reconciled, arXiv preprint arXiv:1511.04864, 2015
  208. Bouvel, Mathilde; Guibert, Olivier Refined enumeration of permutations sorted with two stacks and a D8-symmetry. Ann. Comb. 18 (2014), no. 2, 199-232.
  209. 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, http://www.liafa.univ-paris-diderot.fr/fpsac13/pdfAbstracts/dmAS0179.pdf. 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>
  210. Mathilde Bouvel , Elisa Pergola, Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents (2008); arXiv:0806.1494
  211. Juliana Bowles and Marco B. Caminati, A Verified Algorithm Enumerating Event Structures, arXiv:1705.07228 [cs.LO], 2017.
  212. Garry Bowlin, Maximum Frustration in Bipartite Signed Graphs, Electronic Journal of Combinatorics, 19(4) (2012), #P10.
  213. G. Bowlin and M. G. Brin, Coloring Planar Graphs via Colored Paths in the Associahedra, arXiv preprint arXiv:1301.3984, 2013
  214. D. Bowman and A. Regev, Counting symmetry classes of dissections of a convex regular polygon, arXiv preprint arXiv:1209.6270, 2012
  215. 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]
  216. 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
  217. C. Boyer, New upper bounds for Taxicab and CabTaxi numbers, JIS 11 (2008) 08.1.6
  218. Boyer, Charles P.; Galicki, Krzysztof; Kollár, János, Einstein metrics on spheres. Ann. of Math. (2) 162 (2005), no. 1, 557-580.
  219. 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.
  220. 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.
  221. Keegan Boyle, On The Virtual Cosmetic Surgery Conjecture. arXiv:1701.02361v1, 2017. (version 2 omits the reference to the OEIS)
  222. Latham Boyle, Paul J Steinhardt, Self-Similar One-Dimensional Quasilattices, arXiv preprint arXiv:1608.08220, 2016
  223. M. Bozejko and T. Hasebe, On free infinite divisibility for classical Meixner distributions, arXiv preprint arXiv:1302.4885, 2013
  224. Stevo Bozinovski and Adrijan Božinovski, Artificial Intelligence and infinity: Infinite series generated by Turing Machines, SoutheastCon, 2017. doi:10.1109/SECON.2017.7925371
  225. 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
  226. 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
  227. Harry W. Braden, Victor Z. Enolskii and Andrew N.W. Hone, Bilinear recurrences and addition formulae for hyperelliptic sigma functions (2005), arXiv:math/0501162.
  228. 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.
  229. D. M. Bradley, Experimental Mathematics via Inverse Symbolic Computation, Invited Talk, Department of Mathematics and Statistics, University of Maine, Orono, Maine, June 12, 1997.
  230. Patrick Erik Bradley and Norbert Paul, Comparing G-maps with other topological data structures, Geoinformatica, 2013: doi:10.1007/s10707-013-0191-1
  231. Paul Bradley and Peter Rowley, Orbits on k-subsets of 2-transitive Simple Lie-type Groups, 2014; http://eprints.ma.man.ac.uk/2167/01/covered/MIMS_ep2014_42.pdf
  232. 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.
  233. M. Brand, Munchhausen Matrices, Electronic Journal of Combinatorics, 19(4) (2012), #P40.
  234. 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.
  235. M. Brand, Friedman numbers have density 1, - Discrete Applied Mathematics, Volume 161, Issues 16-17, November 2013, Pages 2389-2395.
  236. Brändén, Petter; Mansour, Toufik, Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A 110 (2005), no. 1, 127-145.
  237. 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.
  238. J. H. Brandts, Nonobtuse and acute simplices and triangulations, NWO (2010)
  239. 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; http://www.math.cas.cz/~am2013/proceedings/contributions/brandts.pdf.
  240. 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
  241. Maria Bras-Amoros, Fibonacci-like behavior of the number of numerical semigroups of a given genus, Semigroup Forum, Volume 76, Number 2 / March, 2008.
  242. Maria Bras-Amorós, J Fernández-González, Computation of numerical semigroups by means of seeds, arXiv preprint arXiv:1607.01545, 2016
  243. 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
  244. 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
  245. 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.
  246. Benjamin Braun, WK Hough, Matching and Independence Complexes Related to Small Grids, arXiv preprint arXiv:1606.01204, 2016
  247. V Braun, P Candelas, X de la Ossa, Two One-Parameter Special Geometries, arXiv preprint arXiv:1512.08367, 2015
  248. Jhon J. Bravo, Sergio Guzmán, Florian Luca, Repdigit Keith numbers, Lithuanian Mathematical Journal, April 2013, Volume 53, Issue 2, pp. 143-148
  249. M. R. Bremner, Free associative algebras, noncommutative Grobner bases, and universal associative envelopes for nonassociative structures, arXiv preprint arXiv:1303.0920, 2013
  250. Murray Bremner and Vladimir Dotsenko, Boardman--Vogt tensor products of absolutely free operads, arXiv:1705.04573 [math.KT], 2017.
  251. Bremner, Murray R.; Hentzel, Irvin R.; Peresi, Luiz A., Dimension formulas for the free nonassociative algebra. Comm. Algebra 33 (2005), no. 11, 4063-4081.
  252. M. Bremner, S. Madariaga, Permutation of elements in double semigroups, arXiv preprint arXiv:1405.2889, 2014
  253. M. Bremner, S. Madariaga, Lie and Jordan products in interchange algebras, arXiv preprint arXiv:1408.3069, 2014
  254. 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
  255. Bremner, Murray R.; Peresi, Luiz A. Special identities for quasi-Jordan algebras. Comm. Algebra 39 (2011), no. 7, 2313-2337.
  256. M. R. Bremner, L. A. Peresi and J. Sanchez-Ortega, Malcev dialgebras, Arxiv preprint arXiv:1108.0586, 2011
  257. R. P. Brent, Generalising Tuenter's binomial sums, arXiv preprint arXiv:1407.3533, 2014
  258. Richard P. Brent, Asymptotic approximation of central binomial coefficients with rigorous error bounds, arXiv preprint arXiv:1608.04834, 2016
  259. 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
  260. Richard P. Brent and David Harvey, Fast computation of Bernoulli, Tangent and Secant numbers, Arxiv preprint arXiv:1108.0286, 2011
  261. R. P. Brent and J. H. Osborn, Bounds on minors of binary matrices, Arxiv preprint arXiv:1208.3330, 2012
  262. R. P. Brent and J. H. Osborn, On minors of maximal determinant matrices, Arxiv preprint arXiv:1208.3819, 2012
  263. 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
  264. R. P. Brent and C. Pomerance, The multiplication table, and random factored integers, http://maths-people.anu.edu.au/~brent/pd/multiplication.pdf, 2012.
  265. R. P. Brent, C. Pomerance, Some mysteries of multiplication, and how to generate random factored integers, Slides of a talk given in Feb. 2015; http://maths-people.anu.edu.au/~brent/pd/multiplication-HK.pdf
  266. Breuer, Felix; Dall, Aaron Bounds on the coefficients of tension and flow polynomials. J. Algebraic Combin. 33 (2011), no. 3, 465-482.
  267. Y. V. Brezhnev, Uniformization: on the Burnside curve y^2=x^5-x (2001), arXiv:math/0111150.
  268. F. Brglez, Of n-dimensional Dice, Combinatorial Optimization, and Reproducible Research: An Introduction, ELEKTROTEHNISKI VESTNIK 78(4): 181-192, 2011; http://ev.fe.uni-lj.si/4-2011/Brglez.pdf
  269. Emmanuel Briand, Mercedes Rosas, Mike Zabrocki, On the S_n-module structure of the noncommutative harmonics (2007),arXiv:0704.1101.
  270. 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.
  271. 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.
  272. Christopher Briggs, Y Hirano, H Tsutsui, Positive Solutions to Some Systems of Diophantine Equations, Journal of Integer Sequences, 2016 Vol 19 #16.8.4
  273. Keith Briggs, Connectivity of random graphs, Nov 2004
  274. Curtis Bright, Raymond Devillers, and Jeffrey Shallit, Minimal elements for the prime numbers, Experimental Mathematics 25:3 (2016), pp. 321-331.
  275. 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.
  276. Robert Brignall, A Survey of Simple Permutations (2008); arXiv:0801.0963
  277. Robert Brignall, Jakub Sliacan, Juxtaposing Catalan Permutation Classes with Monotone Ones, Electronic Journal of Combinatorics 24(2) (2017), #P2.11
  278. 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, http://www.youtube.com/watch?v=l_yRq0oqKx4 (video abstract).
  279. Brink, David The inverse football pool problem. J. Integer Seq. 14 (2011), no. 8, Article 11.8.8, 9 pp.
  280. D. Brink, A (probably) exact solution to the Birthday Problem, The Ramanujan Journal, June 2012, Volume 28, Issue 2, pp 223-238
  281. Gunnar Brinkmann, Generating regular directed graphs, Discrete Math., 313 (2012), 1-7.
  282. Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur and Hadrien Melot, House of Graphs: a database of interesting graphs, ArXiv preprint arXiv:1204.3549, 2012.
  283. Gunnar Brinkmann and Brendan D. McKay, "Counting Unlabelled Topologies and Transitive Relations", J. Integer Sequences, Volume 8, 2005, Article 05.2.1.
  284. 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.
  285. J. R. Britnell, A formal identity involving commuting triples of permutations, Preprint 2012, http://www.maths.bris.ac.uk/~majrb/CommTrip.pdf
  286. 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.
  287. 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
  288. S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for succession rules, Discr. Math., 298 (2005), 142-154.
  289. 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.
  290. 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.
  291. D. J. Broadhurst, arXiv:hep-th/9612012 Conjectured enumeration of irreducible multiple zeta values, from knots and Feynman diagrams.
  292. D. J. Broadhurst, arXiv:q-alg/9709031 Conjectured enumeration of Vassiliev invariants.
  293. D. J. Broadhurst, arXiv:hep-ph/9909336 Four-loop Dyson-Schwinger-Johnson anatomy.
  294. David Broadhurst, Solutions by radicals at singular values k_N from new class invariants for N \equiv 3 mod 8 (2008); arXiv:0807.2976
  295. David Broadhurst, Dickman polylogarithms and their constants, ArXiv preprint arXiv:1004.0519
  296. D. Broadhurst, Multiple Deligne values: a data mine with empirically tamed denominators, arXiv preprint arXiv:1409.7204, 2014
  297. David Broadhurst, Multiple Landen values and the tribonacci numbers, preprint arXiv:1504.05303, 2015.
  298. 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).
  299. D. J. Broadhurst and D. Kreimer: arXiv:hep-th/9810087 Renormalization automated by Hopf algebra.]
  300. 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.
  301. 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.
  302. 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)
  303. Brodmann, Markus, Castelnuovo-Mumford regularity and degrees of generators of graded submodules. Illinois J. Math. 47 (2003), no. 3, 749-767.
  304. 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.
  305. 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.
  306. H. J. Brothers, Pascal's triangle: The hidden stor-e, The Mathematical Gazette, March 2012.
  307. H. J. Brothers, Pascal's Prism, The Mathematical Gazette, July 2012.
  308. H. J. Brothers, Pascal's Prism: Supplementary Material, http://www.brotherstechnology.com/docs/Pascal's_Prism_(supplement).pdf.
  309. C. Brouder, W. J. Keith and A. Mestre, Closed forms for a multigraph enumeration, arXiv preprint arXiv:1301.0874, 2013
  310. Kevin A. Broughan, "The Gcd-Sum Function", J. Integer Sequences, Volume 4, 2001, Article 01.2.2.
  311. Kevin A. Broughan, "Characterizing the Sum of Two Cubes", J. Integer Sequences, Volume 6, 2003, Article 03.4.6.
  312. 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.
  313. 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.
  314. J. Brousek, R. Cada, T. Kaiser, Z. Ryjácek, Diskrétní matematika, Lecture Notes.
  315. Nicolas Broutin, Philippe Flajolet, The height of random binary unlabelled trees (2008); arXiv:0807.2365
  316. 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.
  317. A. E. Brouwer, The Enumeration of Locally Transitive Tournaments. Math. Centr. Report ZW138, Amsterdam, April 1980.
  318. A. E. Brouwer, G. Horvath, Il. Molnar-Saska, C. Szabo, On Three-rowed chomp, INTEGERS 5 (2005) #G07
  319. D. R. L. Brown, Bounds on surmising remixed keys, 2015, Preprint, http://eprint.iacr.org/2015/375.pdf
  320. 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.
  321. Francis Brown, Irrationality proofs for zeta values, moduli spaces and dinner parties, arXiv preprint arXiv:1412.6508, 2014
  322. Graeme Brown, The Congruent Number Problem, 2014; http://www.graemebrownart.com/congruent.pdf
  323. Brown, Lindsey; Ha, Hoang; Hodge, Jonathan K. Single-peaked preferences over multidimensional binary alternatives. Discrete Appl. Math. 166 (2014), 14-25.
  324. 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: http://scholarship.claremont.edu/jhm/vol6/iss1/8
  325. 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.
  326. Brualdi, Richard A.; Fritscher, Eliseu Hankel and Toeplitz X-rays of permutations. Linear Algebra Appl. 449 (2014), 350-380.
  327. 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
  328. 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
  329. P. Bruillard, S.-H. Ng, E. Rowell, Z. Wang, On modular categories, arXiv preprint arXiv:1310.7050, 2013
  330. Henk Bruin, C Carminati, C Kalle, Matching for generalised beta-transformations, arXiv preprint arXiv:1610.01872, 2016
  331. F. Brunault, La fonction 'tau' de Ramanujan, Séminaire des doctorants de l'équipe de théorie des nombres de Chevaleret. (ps, pdf)
  332. Marie-Louise Bruner, Central binomial coefficients also count (2431,4231,1432,4132)-avoiders, preprint arXiv:1505.04929, 2015. (A000984)
  333. Marie-Louise Bruner, Martin Lackner, On the Likelihood of Single-Peaked Preferences, preprint arXiv:1505.05852, 2015. (A006318)
  334. 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.
  335. D. Bruns, W. Mostowski, M. Ulbrich, Implementation-level verification of algorithms with KeY, International Journal on Software Tools for Technology Transfer, November 2013.
  336. J. Brzozowski, M. Szykula, Large Aperiodic Semigroups, arXiv preprint arXiv:1401.0157, 2013
  337. 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.
  338. 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
  339. Andrew Buchanan, Tanya Khovanova and Alex Ryba, Saturated Domino Coverings, Arxiv preprint arXiv:1112.2115, 2011
  340. 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.
  341. VM Buchstaber, AV Ustinov, Coefficient rings of formal group laws, Sbornik: Mathematics, Volume 206, Number 11; http://iopscience.iop.org/article/10.1070/SM2015v206n11ABEH004504/meta
  342. M. Buckley, R. Garner, S. Lack, R. Street, Skew-monoidal categories and the Catalan simplicial set, arXiv preprint arXiv:1307.0265, 2013
  343. Enrico Paolo C. Bugarin, On quotient cohomology of substitution tiling spaces, Dissertation, Fakultät für Mathematik, Universität Bielefeld, May 2014; http://pub.uni-bielefeld.de/luur/download?func=downloadFile&recordOId=2683514&fileOId=2683539
  344. 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.
  345. 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.
  346. Grady Bullington, "The Connell Sum Sequence", J. Integer Sequences, Volume 10, 2007, Article 07.2.6.
  347. 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].
  348. Fokko van de Bult and Jaap Korevaar, Mean value one of prime-pair constants (2008); arXiv:0806.1667
  349. J.-P. Bultel, A, Chouria, J.-G. Luque and O. Mallet, Word symmetric functions and the Redfield-Polya theorem, 2013; PDF
  350. 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>
  351. Lukas Bulwahn, Cardinality of Equivalence Relations, 2016; Preprint; https://www.isa-afp.org/browser_info/current/AFP/Card_Equiv_Relations/document.pdf
  352. Lukas Bulwahn, Spivey's Generalized Recurrence for Bell Numbers, Archive of Formal Proofs, 2016; https://www.isa-afp.org/browser_info/current/AFP/Bell_Numbers_Spivey/document.pdf
  353. Jim Bumgardner, Variations of the Componium, 2013
  354. P. Burcsi, G. Fici, Z. Lipták, F. Ruskey, J. Sawada, Normal, Abby Normal, Prefix Normal, arXiv preprint arXiv:1404.2824, 2014
  355. D. Bundala, M. Codish, L. Cruz-Filipe et al., Optimal-Depth Sorting Networks, arXiv preprint arXiv:1412.5302, 2014
  356. Peter Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada, On prefix normal words and prefix normal forms, Preprint, 2016; http://www.cis.uoguelph.ca/~sawada/papers/pnf.pdf
  357. A. P. Burger, M. P. Kidd and J. H. van Vuuren, Enumeration of self-orthogonal Latin squares, Submitted to Journal of Combinatorial Designs.
  358. A. Burgess, P. Danziger, E. Mendelsohn, B. Stevens, Orthogonally Resolvable Cycle Decompositions, 2013; http://www.math.ryerson.ca/~andrea.burgess/OCD-submit.pdf
  359. P Bürgisser, C Ikenmeyer, Fundamental invariants of orbit closures, arXiv preprint arXiv:1511.02927, 2015
  360. Emily Burgunder, Ralf Holtkamp, Partial magmatic bialgebras (2007), arXiv:0708.4191.
  361. 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)
  362. Charles Burnette and Chung Wong, Abelian Squares and Their Progenies, arXiv:1609.05580, 2016.
  363. Jonathan Burns, Assembly Graph Words - Single Transverse Component (Counts), http://shell.cas.usf.edu/~saito/DNAweb/SimpleAssemblyTable.txt.
  364. Jonathan Burns, Egor Dolzhenko, Natasa Jonoska, Tilahun Muche and Masahico Saito, Four-Regular Graphs with Rigid Vertices Associated to DNA Recombination, May 23, 2011; http://jtburns.myweb.usf.edu/assembly/papers/Graphs_and_DNA_Recomb_2011.pdf.
  365. Jonathan Burns and Tilahun Muche, Counting Irreducible Double Occurrence Words, Arxiv preprint arXiv:1105.2926, 2011.
  366. 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.
  367. Sophie Burrill, A generating tree approach to k-nonnesting set partitions, Poster SFU Comp. Math. Day, 9 aug 2011
  368. 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
  369. 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
  370. S. Burrill and L. Yen, Constructing Skolem sequences via generating trees, arXiv preprint arXiv:1301.6424, 2013
  371. W. Burrows, C. Tuffley, Maximising common fixtures in a round robin tournament with two divisions, arXiv preprint arXiv:1502.06664, 2015
  372. Burstein, Alexander, Restricted Dumont permutations. Ann. Comb. 9 (2005), no. 3, 269-280.
  373. A. Burstein and S. Elizalde, Total occurrence statistics on restricted permutations, arXiv preprint arXiv:1305.3177, 2013
  374. 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.
  375. Alexander Burstein, Sergey Kitaev and Toufik Mansour, Independent sets in certain classes of (almost) regular graphs (2003), arXiv:math/0310379.
  376. Alexander Burstein and Isaiah Lankham, Restricted Patience Sorting and Barred Pattern Avoidance (2005), arXiv:math/0512122.
  377. Damian Bursztyn, Fran¸cois Goasdou´e, Ioana Manolescu. Optimizing Reformulation-based Query Answering in RDF. [Research Report] RR-8646, INRIA Saclay. 2014. <hal-01091214>
  378. B. A. Burton and M. Hiron, Exploring informatics olympiad tasks: exploring the black art, Olymp. Inform. 2 (2008) 16-36
  379. 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)
  380. P. Butera, M. Pernici, Sums of permanental minors using Grassmann algebra, arXiv preprint arXiv:1406.5337, 2014
  381. Steve Butler, Jeongyoon Choi, Kimyung Kim, Kyuhyeok Seo, Enumerating multiplex juggling patterns, arXiv:1702.05808 [math.CO], 2017.
  382. Steve Butler, Fan Chung, Jay Cummings, Ron Graham, Juggling card sequences (2015); arXiv:1504.01426
  383. Steve Butler and Ron Graham, Enumerating (multiplex) juggling sequences (2008); arXiv:0801.2597
  384. Butler, Steve, Ron Graham, Gerhard Guettler, and Colin Mallows. Irreducible Apollonian configurations and packings, Discrete and Computational Geometry, 44 (2010), 487-507.
  385. Steve Butler, R Graham, CH Yan, Parking distributions on trees, European Journal of Combinatorics 65 (2017), 168-185.
  386. Steve Butler, Ron Graham and Nan Zang, Jumping sequences (2008); arXiv:0807.2890 and JIS 11 (2008) 08.4.5
  387. S. Butler, P. Karasik, A note on nested sums, J. Int. Seq. 13 (2010), 10.4.4
  388. 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.
Retrieved from "http://oeis.org/wiki/CiteBi"
Personal tools