This site is supported by donations to The OEIS Foundation.

CiteR

From OeisWiki

Jump to: navigation, search


Contents

CiteR

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 R.
  • 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. Sunil Kumar R and K Balakrishnan, Betweenness Centrality of Cartesian Product of Graphs, arXiv preprint arXiv:1603.04258, 2016
  2. Julius F. T. Rabago, On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang's Conjecturem arXiv preprint arXiv:1604.06659, 2016
  3. D. G. Radcliffe, The growth of digital sums of powers of two, https://radcliffe.github.io/digitsumpower2.pdf, Preprint 2015. Also arXiv preprint arXiv:1605.02839, 2016.
  4. Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler, Counting Markov Equivalence Classes by Number of Immoralities, arXiv preprint arXiv:1611.07493v2, 2016
  5. Y. Raekow, A taxonomy of non-cooperatively computable functions, Presented at WEWoRC 2011.
  6. Paul Raff, arXiv:0809.2551 Spanning Trees in Grid Graphs
  7. Kari Ragnarsson and Bridget Eileen Tenner, Obtainable Sizes of Topologies on Finite Sets (2008); arXiv:0802.2550; Journal of Combinatorial Theory, Series A 117 (2010) 138-151 doi:10.1016/j.jcta.2009.05.002
  8. Kari Ragnarsson and Bridget Eileen Tenner, Homotopy Type of the Boolean Complex of a Coxeter System (2008); arXiv:0806.0906; Advances in Mathematics 222 (2009) 409-430 doi:10.1016/j.aim.2009.05.007
  9. Ragnarsson, Kári; Tenner, Bridget Eileen, Homology of the Boolean complex. J. Algebraic Combin. 34 (2011), no. 4, 617-639.
  10. Marco Ragni and Andreas Klein, Predicting Numbers: An AI Approach to Solving Number Series, Lecture Notes in Computer Science, 2011, Volume 7006, Advances in Artificial Intelligence, Pages 255-259; doi:10.1007/978-3-642-24455-1_24.
  11. M. Ragni, G. Strube, Cognitive Complexity and Analogies in Transfer Learning, KI-Künstliche Intelligenz, 2013; doi:10.1007/s13218-013-0288-6
  12. M. Rahmani, The Akiyama-Tanigawa matrix and related combinatorial identities, Linear Algebra and its Applications 438 (2013) 219-230.
  13. Jay Rahn, The Hurrian Pieces, ca. 1350 BCE: Part Two, From Numbered Strings to Tuned Strings; http://aawmjournal.com/articles/2011b/Rahn_AAWM_Vol_1_2.pdf
  14. Jay Rahn, Coordinating Analyses of Tunings with Analyses of Pieces, Fourth International Conference on Analytical Approaches to World Music (2016)
  15. E. M. Rains and N. J. A. Sloane, "On Cayley's Enumeration of Alkanes (or 4-Valent Trees)", J. Integer Sequences, Volume 2, 1999, Article 99.1.1.
  16. E. M. Rains, N. J. A. Sloane and J. Stufken, The Lattice of N-Run Orthogonal Arrays, J. Statist. Planning Inference, 102 (2002), 477-500, doi:10.1016/S0378-3758(01)00119-7
  17. C. Raissi and J. Pei, Towards Bounding Sequential Patterns, http://www.cs.sfu.ca/~jpei/publications/SeqPatternBound-KDD11.pdf.
  18. A. Rajan, A. Rao, R. V. Rao, H. S. Jamadagni, Gaussian Approximation Using Integer Sequences, Advances in Signal Processing and Intelligent Recognition Systems, Advances in Intelligent Systems and Computing, Volume 264, 2014, pp. 213-224.
  19. Arulalan Rajan, R. Vittal Rao, Ashok Rao and H. S. Jamadagni, Fibonacci Sequence, Recurrence Relations, Discrete Probability Distributions and Linear Convolution, Arxiv preprint arXiv:1205.5398, 2012
  20. Aayush Rajasekaran, Jeffrey Shallit, and Tim Smith, Sums of Palindromes: an Approach via Nested-Word Automata, Preprint, 2017.
  21. Rajkovic, Predrag M.; Petkovic, Marko D.; Barry, Paul, The Hankel transform of the sum of consecutive generalized Catalan numbers. Integral Transforms Spec. Funct. 18 (2007), no. 3-4, 285-296.
  22. Sanjay Ramassamy, Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons, arXiv:1706.03386 [math.CO], 2017.
  23. José L. Ramírez, Some Combinatorial Properties of the k-Fibonacci and the k-Lucas Quaternions, An. Şt. Univ. Ovidius Constanţa, vol. 23 (2), 2015, 201-212. (A000045, A000032)
  24. José L. Ramírez, The Pascal Rhombus and the Generalized Grand Motzkin Paths, arXiv:1511.04577 [math.CO], 2015.
  25. J. L. Ramírez, G. N. Rubiano, Properties and Generalizations of the Fibonacci Word Fractal, The Mathematica J., Vol. 16 (2014).
  26. J. L. Ramirez, G. N. Rubiano and R. de Castro, A Generalization of the Fibonacci Word Fractal and the Fibonacci Snowflake, arXiv preprint arXiv:1212.1368, 2012
  27. Jose L. Ramirez, M Shattuck, A (p, q)-Analogue of the r-Whitney-Lah Numbers, Journal of Integer Sequences, 19, 2016, #16.5.6.
  28. J. L. Ramirez and V. F. Sirvent, Incomplete Tribonacci Numbers and Polynomials, Journal of Integer Sequences, Vol. 17, 2014, #14.4.2.
  29. J. L. Ramírez, V. F. Sirvent, A Generalization of the k-Bonacci Sequence from Riordan Arrays, The Electronic Journal of Combinatorics, 22(1) (2015), #P1.38
  30. Narad Rampersad and Elise Vaslet, "On Highly Repetitive and Power Free Words", Journal of Integer Sequences, Vol. 16 (2013), #13.2.7.
  31. J. Ramsden and H. Sharipov, Inverse problems associated with perfect cuboids, Arxiv preprint arXiv:1207.6764, 2012
  32. J. Ramsden and H. Sharipov, On singularities of the inverse problems associated with perfect cuboids, Arxiv preprint arXiv:1208.1859, 2012.
  33. J. Ramsden and R, Sharipov, On two algebraic parametrizations for rational solutions of the cuboid equations, Arxiv preprint arXiv:1208.2587, 2012
  34. S. V. S. Ranganathan, D. Divsalar, R. D. Wesel, On the Girth of (3, L) Quasi-Cyclic LDPC Codes based on Complete Protographs, arXiv preprint arXiv:1504.04975v2, 2015
  35. Jaime Rangel-Mondragon, Polyominoes and Related Families, The Mathematica Journal, 9:3 (2005), 609-640.
  36. J. Rangel-Mondragon, Selected Themes in Computational Non-Euclidean Geometry: Part 1, The Mathematica Journal 15 (2013); http://www.mathematica-journal.com/data/uploads/2013/07/Rangel-Mondragon_Selected-1.pdf
  37. Mani Ranjbar, WG Macready, L Clark, F Gaitan, Generalized Ramsey numbers through adiabatic quantum optimization, arXiv preprint arXiv:1606.01078, 2016
  38. Rankin, Stuart; Flint, Ortho; Schermann, John, Enumerating the prime alternating knots. II. J. Knot Theory Ramifications 13 (2004), no. 1, 101-149.
  39. B. S. Rao, Heptagonal numbers in the Pell sequence and diophantine equations 2x^2 = y^2(5y-3)^2 +- 2, Fib. Quarterly, 43 (2005), 194-201.
  40. B. S. Rao, Heptagonal numbers in the associated Pell sequence ..., Fib. Quarterly, 43 (2005), 302-306.
  41. Theophanes E. Raptis, Unitary Cellular Automata and Convolution Algebras, arXiv preprint arXiv:1608.05259, 2016
  42. M Rasheed, N Clement, A Bhowmick, C Bajaj, Quantifying and Visualizing Uncertainties in Molecular Models, arXiv preprint arXiv:1508.03882, 2015
  43. Muhibur Rasheed, N Clement, A Bhowmick, C Bajaj, Statistical Framework for Uncertainty Quantification in Computational Molecular Modeling, in Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, Pages 146-155, Seattle, WA, USA — October 02 - 05, 2016 ACM New York, NY, USA doi:10.1145/2975167.2975182
  44. J. Rasku, T. Karkkainen, P. Hotokka, Solution Space Visualization as a Tool for Vehicle Routing Algorithm Development, Proc. FORS-40, 2013; http://www.fors40.org/wp-content/uploads/2013/01/FORS40_Proceedings_ISBN_978-952-265-436-6.pdf#page=14
  45. Rauhut, Holger, Random sampling of sparse trigonometric polynomials. Appl. Comput. Harmon. Anal. 22 (2007), no. 1, 16-42.
  46. Vlady Ravelomanana, the Projet PAI Amadeus Collaboration, The Average Size of Giant Components Between the Double-Jump (2006), arXiv:cs/0607057.
  47. S. Rawat, B. Nautiyal, A. Sah and S. Pundir, Power Summation---A Computer Dimension, International Journal of Computer Applications (0975 - 8887), Volume 58- No.6, November 2012; http://research.ijcaonline.org/volume58/number6/pxc3883496.pdf
  48. R. C. Read, On general dissections of a polygon, Aequat. Math. 18 (1978), 370-388.
  49. Reading, Nathan, Lattice congruences of the weak order. Order 21 (2004), no. 4, 315-344 (2005).
  50. Reading, Nathan, Lattice congruences, fans and Hopf algebras. J. Combin. Theory Ser. A 110 (2005), no. 2, 237-273.
  51. Reading, Nathan Noncrossing partitions and the shard intersection order. J. Algebraic Combin. 33 (2011), no. 4, 483-530.
  52. F. Rebatel and E. Thiel, On dimension partitions in discrete metric spaces, 2012.
  53. D. Recoskie and J. Sawada, The Taming of Two Alley CATs, 2012, http://www.socs.uoguelph.ca/~sawada/papers/alley.pdf
  54. A. Reddick and Y. Xiong, The search for one as a prime number: from ancient Greece to modern times, Electronic Journal of Undergraduate Mathematics, Volume 16, 1 { 13, 2012.
  55. Reeds, James A.; Fishburn, Peter C. Counting split interval orders. Order 18 (2001), no. 2, 129-135.
  56. A. Regev, Young tableaux and 1/e, preprint.
  57. A. Regev, Asymptotics of Young tableaux in the strip, the d-sums arXiv:1004.4476
  58. Regev, A.; Identities for the number of standard Young tableaux in some (k,l)-hooks. Sem. Lothar. Combin. 63 (2010), Art. B63c, 8 pp.
  59. A. Regev, Enumerating triangulations by parallel diagonals, Arxiv preprint arXiv:1208.3915, 2012, J. Int. Seq. 15 (2012) #12.8.5
  60. A. Regev, The central component of a triangulation, arXiv preprint arXiv:1210.3349, 2012, and <a href="https://cs.uwaterloo.ca/journals/JIS/VOL16/Regev/regev4.html">J. Int. Seq. 16 (2013) #13.4.1</a>
  61. A. Regev, Remarks on two-eared triangulations, arXiv preprint arXiv:1309.0743, 2013
  62. Alon Regev, Amitai Regev, Doron Zeilberger, Identities in character tables of S_n, arXiv preprint arXiv:1507.03499, 2015
  63. A Regev, D Zeilberger, Surprising Relations Between Sums-Of-Squares of Characters of the Symmetric Group Over Two-Rowed Shapes and Over Hook Shapes, arXiv preprint arXiv:1510.07061, 2015
  64. P. Regner, Phylogenetic Trees: Selected Combinatorial Problems, master thesis, TU Vienna, April 2012.
  65. Julie Rehmeyer, The Pattern Collector; The Encyclopedia of Integer Sequences outgrows its creator
  66. Samuel Reid, On Generalizing a Temporal Formalism for Game Theory to the Asymptotic Combinatorics of S5 Modal Frames, arXiv preprint arXiv:1305.0064, 2013
  67. Daniel Reidenbach, Johannes C. Schneider, Morphically primitive words, Theoretical Computer Science, Volume 410, Issues 21-23, 17 May 2009, Pages 2148-2161.
  68. K. Reihani, K-theory of Furstenberg transformation group C^*-algebras, Arxiv preprint arXiv:1109.4473, 2011
  69. Markus Reineke, The use of geometric and quantum group techniques for wild quivers (2003), arXiv:math/0304193.
  70. Reineke, Markus Cohomology of quiver moduli, functional equations, and integrality of Donaldson-Thomas type invariants. Compos. Math. 147 (2011), no. 3, 943-964.
  71. Andrew Reiter, On (mod n) spirals, 2014; http://www.cw-complex.com/modNspirals/modNspirals.pdf; also posting to Number Theory Mailing List, Mar 23 2014.
  72. Jeffrey B. Remmel, Consecutive Up-down Patterns in Up-down Permutations, Electron. J. Combin., 21 (2014), #P3.2.
  73. Jeffrey B. Remmel, JLB Tiefenbruck, Q-analogues of convolutions of Fibonacci numbers, - Australasian Journal of Combinatorics, Volume 64(1) (2016), Pages 166–193.
  74. Jeffrey B. Remmel, S Zheng, Rises in forests of binary shrubs, arXiv preprint arXiv:1611.09018, 2016
  75. Qingchun Ren, Ordered Partitions and Drawings of Rooted Plane Trees, arXiv preprint arXiv:1301.6327, 2013
  76. XIAO-ZHI REN and YONG-GAO CHEN. On near-perfect numbers with two distinct prime factors, Bulletin of the Australian Mathematical Society, available on CJO2013. doi:10.1017/S0004972713000178.
  77. Gabriel Renault, Jeux combinatoires dans les graphes, Thesis, Dr. of Math. and Informatique, L'Université Bordeaux, 2013; http://www.labri.fr/perso/grenault/manuscript.pdf.
  78. P. Repetowicz, U. Grimm and M. Schreiber, arXiv:cond-mat/9901001 High-temperature expansion for Ising models on quasiperiodic tilings, J. Phys. A: Math. Gen. 32 (1999) 4397-4418.
  79. Guillermo Restrepo and Leonardo A. Pachon, Mathematical Aspects of the Periodic Law (2006), arXiv:math.GR/0611410.
  80. C. Reutenauer and M. Robado, On an algebraicity theorem of Kontsevich, FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 241-248; http://www.math.nagoya-u.ac.jp/fpsac12/download/contributed/dmAR0122.pdf.
  81. Alexander Rezchikov, Vadim Kushnikov, Vladimir Ivaschenko, Aleksey Bogomolov, Leonid Filimonyuk, Olga Dolinina, Ekaterina Kulakova, Konstantin Kachur, The Approach to Provide and Support the Aviation Transportation System Safety Based on Automation Models, In: Silhavy R., Silhavy P., Prokopova Z., Senkerik R., Kominkova Oplatkova Z. (eds) Software Engineering Trends and Techniques in Intelligent Systems. CSOC 2017. Advances in Intelligent Systems and Computing, vol. 575. doi:10.1007/978-3-319-57141-6_26
  82. B. Reznick, Some new canonical forms for polynomials, Arxiv preprint arXiv:1203.5722, 2012
  83. RHODES, JOHN RICHARD, (2012) On the Kernel of the Symbol Map for Multiple Polylogarithms, Durham theses, Durham University. Available at Durham E-Theses Online: http://etheses.dur.ac.uk/3905/
  84. Brian Rice, Primitive prime divisors in polynomial arithmetic dynamics, Integers, El. J. Combin. Number Theory 7 (2007) #A26
  85. C. Richard and U. Grimm, arXiv:math.CO/0302302 On the Entropy and Letter Frequencies of Ternary Square-Free Words], math.CO/0302302, Electron. J. Combin. 11 (2004), no. 1, Research Paper 14, 19 pp.
  86. D. Richards, Coordination and Shared Mental Models, American Journal of Political Science, 45 (2001), 259-76.
  87. S. L. Richardson Jr, Enumeration of the generalized Catalan numbers, MSc Thesis, West Virginia Univ, 2005
  88. T. M. Richardson, The Reciprocal Pascal Matrix, arXiv preprint arXiv:1405.6315, 2014
  89. T. M. Richardson, The Super Patalan Numbers, arXiv preprint arXiv:1410.5880, 2014
  90. Thomas M. Richardson, The three'R's and the Riordan dual, arXiv preprint arXiv:1609.01193, 2016
  91. L. B. Richmond and J. Shallit, Counting Abelian Squares (2008); arXiv:0807.5028
  92. Gwenaël Richomme, A Characterization of Infinite LSP Words, arXiv:1705.05786 [cs.FL], 2017.
  93. G. Richomme, K. Saari, L. Q. Zamboni, doi:10.1016/j.aam.2010.01.006 Balance and Abelian complexity of the Tribonacci word, Adv. Appl Math. 45 (2) (2010) 212-231
  94. H Richter, Analyzing coevolutionary games with dynamic fitness landscapes, arXiv preprint arXiv:1603.06374, 2016
  95. Hendrik Richter, Dynamic landscape models of coevolutionary games, arXiv preprint arXiv:1611.09149, 2016
  96. Lukas Riegler, Simple enumeration formulae related to Alternating Sign Monotone Triangles and standard Young tableaux, Dissertation, Universitat Wien, 2014.
  97. Riera, Constanza; Parker, Matthew G. Generalized bent criteria for Boolean functions. I. IEEE Trans. Inform. Theory 52 (2006), no. 9, 4142-4159.
  98. Michel Rigo, Syntactical and automatic properties of sets of polynomials over finite fields, Finite Fields and Their Applications, Volume 14, Issue 1, January 2008, Pages 258-276.
  99. Michel Rigo, Formal Languages, Automata and Numeration Systems, 2 vols. Wiley 2014.
  100. Michel Rigo, Invariant games and non-homogeneous Beatty sequences, Slides of a talk, Journée de Mathématiques Discrètes, 2015; PDF
  101. Michel Rigo, Relations on words, arXiv preprint arXiv:1602.03364, 2016
  102. M. Rigo, P. Salimov, and E. Vandomme, "Some Properties of Abelian Return Words", Journal of Integer Sequences, Vol. 16 (2013), #13.2.5.
  103. S. Rinaldi, Succession rules: the whole story, Phd thesis, Università di Firenze, 2002.
  104. C. M. Ringel, The Catalan combinatorics of the hereditary artin algebras, arXiv preprint arXiv:1502.06553, 2015
  105. Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv:1406.3081
  106. John Riordan, Enumeration of plane trees by branches and endpoints, Journal of Combinatorial Theory, Series A, Volume 19, Issue 2, September 1975, Pages 214-222.
  107. J. Riordan, The blossoming of Schroeder's fourth problem, Acta Math., 137 (1976), 1-16.
  108. J. Riordan, A budget of rhyme scheme counts, pp. 455 - 465 of Second International Conference on Combinatorial Mathematics, New York, April 4-7, 1978. Edited by Allan Gewirtz and Louis V. Quintas. Annals New York Academy of Sciences, 319, 1979.
  109. Marco Ripà, The n x n x n Points Problem Optimal Solution, viXra:1508.0201, 2015.
  110. M. Ripa and G. Morelli, Retro-analytical Reasoning IQ tests for the High Range, 2013, http://www.iqsociety.org/general/documents/Retro_analytical_Reasoning_IQ_tests_for_the_High_Range.pdf.
  111. S. M. Ripon, Generalization of a class of logarithmic integrals, Integral Transforms and Special Functions, Vol. 26, #4, 2014; doi:10.1080/10652469.2014.989390
  112. Adrian Riskin, A note on heterogeneous decompositions into spanning trees (2006), arXiv:math/0605398.
  113. Thomas Risse, Least Square Approximation with Zernike Polynomials Using SAGE, http://www.weblearn.hs-bremen.de/risse/papers/SiP27/Zernike.pdf.
  114. B. Rittaud, "On the Average Growth of Random Fibonacci Sequences", J. Integer Sequences, Volume 10, 2007, Article 07.2.4.
  115. Benoit Rittaud, Elise Janvresse, Emmanuel Lesigne and Jean-Christophe Novelli, Quand les maths se font discretes, Le Pommier, 2008 (ISBN 978-2-7465-0370-0).
  116. Benoit Rittaud and Laurent Vivier, Circular words and applications, Arxiv preprint arXiv:1108.3618, 2011
  117. Benoit Rittaud and Laurent Vivier, Circular words and three applications: factors of the Fibonacci word, F -adic numbers, and the sequence 1, 5, 16, 45, 121, 320,. . . . Functiones et Approximatio Commentarii Mathematici 47 (2012) no. 2, 207-231 doi:10.7169/facm/2012.47.2.6; http://hal.archives-ouvertes.fr/docs/00/56/63/14/PS/CircularWords.ps.
  118. L. M. Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081, 2014; Integers, 15 (2015), #A46.
  119. Kelly Roach doi:10.1145/1504347.1504371 Solving integrals with the quantum computer algebra system, ACM Commun. Comp. Alg. 42 (3) (2008), in text citation
  120. Robbins, Jakayla R., Enumerating orientations of the free spikes. European J. Combin. 28 (2007), no. 3, 868-875.
  121. Jakayla R. Robbins, Representable orientations of the free spikes, Discrete Mathematics, Volume 308, Issue 22, 28 November 2008, Pages 5174-5183.
  122. Neville Robbins, "On Partition Functions and Divisor Sums", J. Integer Sequences, Volume 5, 2002, Article 02.1.4.
  123. David P. Roberts, "Wild Partitions and Number Theory", J. Integer Sequences, Volume 10, 2007, Article 07.6.6.
  124. D. P. Roberts, A. Venkatesh, Hurwitz monodromy and full number fields, http://math.stanford.edu/~akshay/research/full.pdf, 2014
  125. G. O. Roberts and J. S. Rosenthal, Small and pseudo-small sets for Markov chains, Stochastic Models 17: 121-145, 2001.
  126. Siobhan Roberts, Genius at Play: The Curious Mind of John Horton Conway, Bloomsbury, NY, 2015.
  127. Siobhan Roberts, How to Build a Search Engine for Mathematics, Nautilus, Oct 22, 2015.
  128. A. Robertson, D. Saracino and D. Zeilberger, Refined Restricted Permutations, In memory of Rodica Simion, Ann. Comb. 6 (2002), no. 3-4, 427-444.
  129. J. P. Robinson, Some postage stamp 2-bases JIS 12 (2009) 09.1.1
  130. R. W. Robinson, Counting Feynman Diagrams.
  131. Rochowicz, John A. Jr. (2015), Harmonic Numbers: Insights, Approximations and Applications, Spreadsheets in Education (eJSiE): Vol. 8: Iss. 2, Article 4; http://epublications.bond.edu.au/ejsie/vol8/iss2/4
  132. Ø. J. Rødseth, Enumeration of M-partitions, Discrete Math., 306 (2006), 694-698.
  133. Ø. J. Rødseth, Sloane's box stacking problem, Discrete Math., 306 (2006), 2005-2009.
  134. Ø. J. Rødseth, "Minimal r-Complete Partitions", J. Integer Sequences, Volume 10, 2007, Article 07.8.3.
  135. Ø. J. Rødseth and James A. Sellers, "On a Restricted m-Non-Squashing Partition Function", J. Integer Sequences, Volume 8, 2005, Article 05.5.4.
  136. Ø. J. Rødseth, J. A. Sellers and K. M. Courtright, Arithmetic properties of non-squashing partitions into distinct parts, Ann. Comb. 8 (2004), no. 3, 347-353.
  137. D. G. Rogers, Similarity relations on finite ordered sets, Journal of Combinatorial Theory, Series A, Volume 23, Issue 1, July 1977, Pages 88-98. Erratum, loc. cit., 25 (1978), 95-96.
  138. D. G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math., 22 (1978), 301-310.
  139. D. G. Rogers, Rhyming schemes: Crossings and coverings, Discrete Mathematics, Volume 33, Issue 1, 1981, Pages 67-77.
  140. D. G. Rogers and L. W. Shapiro, Some correspondences involving the Schroeder numbers and relations, in Lect. Notes Math., Vol. 686 (1978), pp. 267-276.
  141. D. G. Rogers and L. W. Shapiro, Deques, trees and lattice paths, in Combinatorial Mathematics, VIII (Geelong, 1980), pp. 293-303, Lecture Notes in Math., 884, Springer, Berlin-New York, 1981.
  142. N. Rolin, A. Ugolnikova, Tilings by 1x1 and 2x2 squares (2014)
  143. Adam Roman, Igor T. Podolak and Agnieszka Deszynska, On the number of clusterings in a hierarchical classification model with overlapping clusters, SCHEDAE INFORMATICAE VOLUME 20 2011, http://www.wuj.pl/UserFiles/File/Schedae%2020/20_07_RomanPodolakDeszynska.pdf.
  144. Fabio Roman, On certain ratios regarding integer numbers which are both triangulars and squares, arXiv:1703.06701 [math.NT], 2017.
  145. Dan Romik, "Some Formulas for the Central Trinomial and Motzkin Numbers", J. Integer Sequences, Volume 6, 2003, Article 03.2.4.
  146. Dan Romik, The dynamics of Pythagorean triples (2004), arXiv:math/0406512.
  147. Roney-Dougal, Colva M.; Unger, William R. The affine primitive permutation groups of degree less than 1000. J. Symbolic Comput. 35 (2003), no. 4, 421-439.
  148. Feng Rong, A note on the topological classification of complex polynomial differential equations with only centre singularities, Journal of Difference Equations and Applications, Volume 18, Issue 11, 2012; doi:10.1080/10236198.2012.721782
  149. D Rorabaugh, Toward the Combinatorial Limit Theory of Free Words, arXiv preprint arXiv:1509.04372, 2015
  150. Jay Rosen, The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model, Journal of Combinatorial Theory, Series A, Volume 20, Issue 3, May 1976, Pages 377-384.
  151. Kenneth H. Rosen (Ed.), Handbook of Discrete and Combinatorial Mathematics CRC Press, 1999
  152. K. Rosen, Elementary Number Theory, Addison-Wesley, 2000. Pages 9 and 620.
  153. Zvi Rosen and Yan X. Zhang, Convex Neural Codes in Dimension 1, arXiv:1702.06907 [math.CO], 2017.
  154. Hjalmar Rosengren, Elliptic pfaffians and solvable lattice models, arXiv preprint arXiv:1605.02915, 2016
  155. A. Roshan, P. H. Jones and C. D. Greenman, An Exact, Time-Independent Approach to Clone Size Distributions in Normal and Mutated Cells, arXiv preprint arXiv:1311.5769, 2013
  156. K. A. Ross, Conjunctive Selection Conditions in Main Memory, Proceedings of the 2002 PODS Conference, June 2002.
  157. Kenneth A Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 36–42. doi:10.4169/math.mag.85.1.36.
  158. K. A. Ross and D. E. Knuth, A Programming and Problem Solving Seminar. Trivia Hunt (Appendix A), Stanford University Technical Report STAN-CS-89-1269, July 1989.
  159. R. A. Rota, On modeling emergent neocortical complexity with complex adaptive systems, MS Thesis, San Diego State Univ., Fall 2012; http://sdsu-dspace.calstate.edu/bitstream/handle/10211.10/3226/Rota_Robert.pdf?sequence=1
  160. Rotbart, Aviv Generator sets for the alternating group. Sém. Lothar. Combin. 65 (2010/12), Art. B65b, 16 pp.
  161. Marcello Rotondo and Shin'ichi Nojiri, A toy model of discretized gravity in two dimensions and its extensions, Modern Physics Letters A, 32, 1750149 (2017). doi:10.1142/S0217732317501498, preprint: arXiv:1703.06374 [hep-th], 2017.
  162. A. Rovenchak, Enumeration of plane partitions with a restricted number of parts, arXiv preprint arXiv:1401.4367, 2014
  163. JT Rowell, Solution Sequences for the Keyboard Problem and its Generalizations, Journal of Integer Sequences, 18 (2105), #15.10.7.
  164. Eric S. Rowland, A simple prime-generating recurrence (2007), arXiv:0710.3217.
  165. Eric S. Rowland, A natural prime-generating recurrence, JIS 11 (2008) 08.2.8
  166. Eric Rowland, Bell numbers modulo 8, in Combinatorics and Algorithmics of Strings, 2014, page 42; PDF
  167. Eric Rowland, A matrix generalization of a theorem of Fine, arXiv:1704.05872 [math.NT], 2017.
  168. E. Rowland, R. Yassawi, Automatic congruences for diagonals of rational functions, arXiv preprint arXiv:1310.8635, 2013
  169. E. Rowland, D. Zeilberger, A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences, arXiv preprint arXiv:1311.4776, 2013
  170. Gordon F. Royle, "Counting Set Covers and Split Graphs", J. Integer Sequences, Volume 3, 2000, Article 00.2.6.
  171. Martin Rubey, Extended Rate, more GFUN (2007), arXiv:math/0702086.
  172. Martin Rubey, Nestings of Matchings and Permutations and North Steps in PDSAWs (2007); arXiv:0712.2804
  173. Rubey, Martin The number of ribbon Schur functions. Sém. Lothar. Combin. 64 (2010/11), Art. B64c, 11 pp.
  174. M. Rubinchik, A. M. Shur, Eertree: An Efficient Data Structure for Processing Palindromes in Strings, arXiv preprint arXiv:1506.04862, 2015
  175. Michelle Rudolph-Lilith, On the Product Representation of Number Sequences, with Application to the Fibonacci Family, arXiv preprint arXiv:1508.07894, 2015
  176. M. Rudolph-Lilith, L. E. Muller, On an explicit representation of central (2k+1)-nomial coefficients, arXiv preprint arXiv:1403.5942, 2014
  177. Rudolph-Lilith, Michelle, and Lyle E. Muller, On a link between Dirichlet kernels and central multinomial coefficients, Discrete Mathematics 338.9 (2015): 1567-1572, doi:10.1016/j.disc.2015.04.001.
  178. Carlos Alexis Gómez Ruiz and Florian Luca, Fibonacci factoriangular numbers, Indagationes Mathematicae, Volume 28, Issue 4, August 2017, p. 796-804. doi:10.1016/j.indag.2017.05.002
  179. Josef Rukavicka, On Number of Rich Words, arXiv:1701.07778 [math.CO], 2017.
  180. Frank Ruskey and Chris Deugau, The combinatorics of certain k-ary meta-Fibonacci sequences, J. Int. Sequenc. 12 (2009) #09.4.3
  181. Frank Ruskey, C. R. Miers and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math., 14 (2001) 240-245.
  182. Frank Ruskey and Mark Weston, Spherical Venn Diagrams with Involutory Isometries, Electronic Journal of Combinatorics, 18 (2011), #P191; http://www.combinatorics.org/Volume_18/PDF/v18i1p191.pdf
  183. Frank Ruskey and Aaron Williams, An explicit universal cycle for the (n-1)-permutations of an n-set (2007), arXiv:0710.1842.
  184. Frank Ruskey and Aaron Williams, doi:10.1145/1798596.1798598 An explicit universal cycle for the (n-1)-permutations of an n-set, ACM Trans. Algor. 6 (3) (2010) # 45
  185. Ruskey, Frank; Williams, Aaron The feline Josephus problem. Theory Comput. Syst. 50 (2012), no. 1, 20-34.
  186. Frank Ruskey and J. Woodcock, Counting Fixed-Height Tatami Tilings, Electronic Journal of Combinatorics, Paper R126 (2009) 20 pages.
  187. Frank Ruskey and Jennifer Woodcock, The Rand and block distances of pairs of set partitions, in International Workshop on Combinatorial Algorithms, Victoria, LNCS 7056 (2011) p 287 -299 doi:10.1007/978-3-642-25011-8_23
  188. Frank Ruskey, Jennifer Woodcock and Yuji Yamauchi, Counting and computing the Rand and block distances of pairs of set partitions, Journal of Discrete Algorithms, Volume 16, October 2012, Pages 236-248
  189. Matthew Christopher Russell, Using experimental mathematics to conjecture and prove theorems in the theory of partitions and commutative and non-commutative recurrences, PhD Dissertation, Mathematics Department, Rutgers University, May 2016; https://pdfs.semanticscholar.org/fdeb/e20954dacb7ec7a24afe2cf491b951c5a28d.pdf. Also (better) http://www.math.rutgers.edu/~zeilberg/Theses/MatthewRussellThesis.pdf
  190. Vincent Russo and Loren Schwiebert, Beatty sequences, Fibonacci numbers and the golden ratio, http://www-personal.umich.edu/~vprusso/Fibonacci.pdf
  191. John S. Rutherford, Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type, Acta Cryst. (2009). A65, 156163.
  192. A. Ryabov, P. Chvosta, Tracer dynamics in a single-file system with absorbing boundary, arXiv preprint arXiv:1402.1949, 2014
  193. David Ryan, Mathematical Harmony Analysis, arXiv preprint arXiv:1603.08904, 2016
  194. David Ryan, An algorithm to assign musical prime commas to every prime number and construct a universal and compact free Just Intonation musical notation, arXiv:1612.01860 [cs.SD], 2017.
  195. Nathan C Ryan, The Height of Divisors of x^n-1 (A114536)
  196. G. Rzadkowski, Two formulas for Successive Derivatives and Their Applications, JIS 12 (2009) 09.8.2
  197. Grzegorz Rzadkowski, M Urlinska, A Generalization of the Eulerian Numbers- arXiv preprint arXiv:1612.06635, 2016

About this page

  • This is part of the series of OEIS Wiki pages that list works citing the OEIS.
  • Additions to these pages are welcomed.
  • But if you add anything to these pages, please be very careful — remember that this is a scientific database. Spell authors' names, titles of papers, journal names, volume and page numbers, etc., carefully, and preserve the alphabetical ordering.
  • If you are unclear about what to do, contact one of the Editors-in-Chief before proceeding.
  • Works are arranged in alphabetical order by author's last name.
  • Works with the same set of authors are arranged by date, starting with the oldest.
  • The full list of sections is: A Ba Bi Ca Ci D E F G H I J K L M N O P Q R Sa Sl T U V W X Y Z.
  • For further information, see the main page for Works Citing OEIS.
Retrieved from "https://oeis.org/wiki/CiteR"
Personal tools