This site is supported by donations to The OEIS Foundation.


From OeisWiki
Jump to: navigation, search

About this page

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


  1. Ahmad Sabri and Vincent Vajnovszki, More restricted growth functions: Gray codes and exhaustive generations, arXiv:1703.05856 [math.CO], 2017.
  2. Ahmad Sabri, Vincent Vajnovszki, Exhaustive generation for ballot sequences in lexicographic and Gray code order, 2018. PDF (A000085)
  3. R. Sachdeva and A.K. Agarwal, Combinatorics of certain restricted n-color composition functions, Discrete Mathematics, 340, (2017), 361-372.
  4. J. Sack and H. Ulfarsson, Refined inversion statistics on permutations, Arxiv preprint arXiv:1106.1995, 2011.
  5. Markus Saers, Dekai Wu and Chris Quirk, On the Expressivity of Linear Transductions, PDF.
  6. Pablo Saez, X. Vidaux, M. Vsemirnov, Optimal bounds for Buchi's problem in modular arithmetic, Journal of Number Theory Volume 149, April 2015, Pages 368-403.
  7. Bruce E. Sagan, Congruences via abelian groups, Journal of Number Theory, Volume 20, Issue 2, April 1985, Pages 210-237.
  8. Bruce Sagan, Proper partitions of a polygon and k-Catalan numbers (2004), arXiv:math/0407280.
  9. Sage, Common Graphs (Graph Generators)
  10. Barun Kumar Saha, Sudip Misra, Sujata Pal, SeeR: Simulated Annealing-Based Routing in Opportunistic Mobile Networks, IEEE Transactions on Mobile Computing, Vol. 16, No. 10, October 2017. doi:10.1109/TMC.2017.2673842
  11. Murat Sahin and Elif Tan, Conditional (strong) divisibility sequences, Fib. Q., 56 (No. 1, 2018), 18-31.
  12. Hanno Sahlmann, Entropy calculation for a toy black hole (2007), arXiv:0709.0076.
  13. Soumyadip Sahu, On Certain Reciprocal Sums, arXiv:1807.05454 [math.NT], 2018. (A248230, A248234)
  14. Monjul Saikia, Md. Anwar Hussain, "Location-Independent Key Distribution for Sensor Network Using Regular Graph", Progress in Computing, Analytics and Networking, Proceedings of ICCAN 2017 (2018), 1-8. doi:10.1007/978-981-10-7871-2
  15. R. Sainudiin, Algebra and Arithmetic of Plane Binary Trees, Slides of a talk, 2014;
  16. Raazesh Sainudiin, Statistical Regular Pavings in Bayesian Nonparametric Density Estimation, 2014;
  17. R. Sainudiin, Some Arithmetic, Algebraic and Combinatorial Aspects of Plane Binary Trees, Slides from a talk, Oct 27 2014;
  18. R Sainudiin, A Veber, A Beta-splitting model for evolutionary trees, arXiv preprint arXiv:1511.08828, 2015
  19. S. Saito, T. Tanaka, N. Wakabayashi, Combinatorial Remarks on the Cyclic Sum Formula for Multiple Zeta Values, J. Int. Seq. 14 (2011) # 11.2.4
  20. A. Sakhnovich, L. Sakhnovich, Nonlinear Fokker-Planck equation: stability, distance and corresponding extremal problem in the spatially inhomogeneous case, arXiv preprint arXiv:1307.1126, 2013
  21. Ana Salagean, David Gardner and Raphael Phan, Index Tables of Finite Fields and Modular Golomb Rulers, in Sequences and Their Applications - SETA 2012, Lecture Notes in Computer Science. Volume 7280, 2012, pp. 136-147.
  22. J. Salas and A. D. Sokal, arXiv:cond-mat/0004330 Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models I. General Theory and Square-Lattice Chromatic Polynomial], J. Statist. Phys. 104 (2001) 609-699.
  23. J. Salas and A. D. Sokal, Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models. V. Further Results for the Square-Lattice Chromatic Polynomial, J. Stat. Phys. 135 (2009) 279-373, arXiv:0711.1738
  24. H Salehian, R Chakraborty, E Ofori, D Vaillancourt, An efficient recursive estimator of the Fréchet mean on a hypersphere with applications to Medical Image Analysis, Preprint 2015;
  25. A Salerno, D Schindler, A Tucker, Symmetries of Rational Functions Arising in Ecalle's Study of Multiple Zeta Values;, 2015; In: Women in Numbers Europe: Research Directions, Springer, 2015
  26. Ville Salo, Decidability and Universality of Quasiminimal Subshifts, arXiv preprint arXiv:1411.6644, 2014.
  27. Ville Salo, Universal gates with wires in a row, arXiv:1809.08050 [math.GR], 2018. (A000031)
  28. D. Salomon, Variable-length Codes for Data Compression, Springer-Verlag.
  29. D. Salomon, G. Motta, doi:10.1007/978-1-84882-903-9, Handbook of data compression, Springer, 2010.
  30. V. Salov, Inevitable Dottie Number. Iterals of cosine and sine, arXiv:1212.1027, 2012
  31. E. Salturk and I. Siap, Generalized Gaussian Numbers Related to Linear Codes over Galois Rings, European Journal of Pure and Applied Mathematics, Vol. 5, No. 2, 2012, 250-259; ISSN 1307-5543;
  32. Paolo Salvatore and Roberto Tauraso, The operad Lie is free (2008); arXiv:0802.3010; Journal of Pure and Applied Algebra, Volume 213, Issue 2, February 2009, Pages 224-230.
  33. Rafaele Salvia, A catalogue of matchstick graphs, arXiv:1303.5965
  34. Ivano Salvo, Agnese Pacifico, Computing Integer Sequences: Filtering vs Generation (Functional Pearl), arXiv:1807.11792 [cs.PL], 2018. (A002858, A033629)
  35. B. Salvy, Automatic Asymptotics and Generating Functions, Algorithms seminar, 1992-1993, INRIA Research Report #2130, 47-50. (Ps, Pdf)
  36. B. Salvy, Découverte de récurrences
  37. B. Salvy and S. Yu. Slavyanov, A Combinatorial Problem in the Classification of Second-Order Linear ODE's, Research Report no. 2600, Institut National de Recherche en Informatique et en Automatique, 1995. 7 pages.
  38. B. Salvy and P. Zimmermann, Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Transactions on Mathematical Software, vol. 20, no. 2, 1994, pages 163-177.
  39. Samieinia, Shiva, The number of Khalimsky-continuous functions on intervals. Rocky Mountain J. Math. 40 (2010), no. 5, 1667-1687.
  40. S. Samieinia, doi:10.4171/PM/1858, The number of continuous curves in digital geometry, Port. Mathem. 67 (1) (2010) 75-89
  41. M. J. Samuel, Word posets, with applications to Coxeter groups, Arxiv preprint arXiv:1108.3638, 2011
  42. F. M. Sanchez, Remarkable Properties of the Eddington Number 137 and Electric Parameter 137.036 excluding the Multiverse Hypothesis, 2015;
  43. Selene Sanchez-Flores, The Lie module structure on the Hochschild cohomology groups of monomial algebras with radical square zero (2007), arXiv:0711.2810; Journal of Algebra, Volume 320, Issue 12, 15 December 2008, Pages 4249-4269.
  44. J. Sander, J. Steuding, R. Steuding, Diophantine aspects of the Calkin-Wilf iteration, El. Math. 66 (2) (2011) 45-55 doi:10.4171/EM/170
  45. David Sankoff and Lani Haque, Power Boosts for Cluster Tests, in Comparative Genomics, Lecture Notes in Computer Science, Volume 3678/2005, Springer-Verlag.
  46. C. Sanna, On Arithmetic Progressions of Integers with a Distinct Sum of Digits, Journal of Integer Sequences, Vol. 15 (2012), #12.8.1.
  47. Noriaki Sannomiya, H Katsura, Y Nakayama, Supersymmetry breaking and Nambu-Goldstone fermions with cubic dispersion, arXiv preprint arXiv:1612.02285, 2016
  48. Joseph M. Santmyer, A stirling like sequence of rational numbers, Discrete Mathematics, Volume 171, Issues 1-3, 20 June 1997, Pages 229-235.
  49. Santocanale, Luigi; Wehrung, Friedrich The extended permutohedron on a transitive binary relation. European J. Combin. 42 (2014), 179-206.
  50. L Santocanale, F Wehrung, G Grätzer, F Wehrung, Generalizations of the Permutohedron, in Grätzer G., Wehrung F. (eds) Lattice Theory: Special Topics and Applications. Birkhäuser, Cham, pp. 287-397; doi:10.1007/978-3-319-44236-5_8
  51. Andrés Santos, Density Expansion of the Equation of State, in A Concise Course on the Theory of Classical Liquids, Volume 923 of the series Lecture Notes in Physics, pp 33-96, 2016. doi:10.1007/978-3-319-29668-5_3
  52. F. Santos, C. Stump, V. Welker, Noncrossing sets and a Grassmann associahedron, arXiv preprint arXiv:1403.8133, 2014; also in FPSAC 2014, Chicago, USA; Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, 2014, 609-620.
  53. Biswajit Sanyal, S Majumder, WK Hon, Efficient Generation of Top-k Procurements in a Multi-item Auction, in WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016, Proceedings, Pages pp 181-193, 2016; doi:10.1007/978-3-319-30139-6_15
  54. Raman Sanyal, Axel Werner, Günter M. Ziegler, On Kalai's conjectures concerning centrally symmetric polytopes (2007), arXiv:0708.3661.
  55. Matthew Saponaro and Keith Decker, Analysis of Meta-level Communication for Distributed Resource Allocation Problems, AAMAS '17 Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 1728-1730.
  56. Sapounakis, A.; Tasoulas, I.; Tsikouras, P. Ordered trees and the inorder traversal. Discrete Math. 306 (2006), no. 15, 1732-1741.
  57. A. Sapounakis, I. Tasoulas and P. Tsikouras, "On the Dominance Partial Ordering of Dyck Paths", J. Integer Sequences, Volume 9, 2006, Article 06.2.5.
  58. A. Sapounakis, I. Tasoulas and P. Tsikouras, Counting strings in Dyck paths, Discrete Math., 307 (2007), 2909-2924.
  59. A. Sapounakis, I. Tasoulas, P. Tsikouras, Enumeration of strings in Dyck paths: A bijective approach, Discrete Mathematics, Volume 309, Issue 10, 28 May 2009, Pages 3032-3039.
  60. A. Sapounakis and P. Tsikouras, "On k-colored Motzkin words", J. Integer Sequences, Volume 7, 2004, Article 04.2.5.
  61. Sapounakis, A.; Tsikouras, P. Counting peaks and valleys in k-colored Motzkin paths. Electron. J. Combin. 12 (2005), Research Paper 16, 20 pp.
  62. Aristidis Sapounakis, Panagiotis Tsikouras, Ioannis Tasoulas, Kostas Manes, Strings of Length 3 in Grand-Dyck Paths and the Chung-Feller Property, Electr. J. Combinatorics, 19 (2012), #P2.
  63. G. M. Saridis et al., Survey and Evaluation of Space Division Multiplexing: From Technologies to Optical Networks, EEE COMMUNICATIONS SURVEYS & TUTORIALS, AUGUST 2015, doi:10.1109/COMST.2015.2466458
  64. T. Sasao and J. T. Butler, Applications of Zero-Suppressed Decision Diagrams, Synthesis Lectures on Digital Circuits and Systems, November 2014, 123 pages, doi:10.2200/S00612ED1V01Y201411DCS045
  65. Ulrike Sattler, Decidable classes of formal power series with nice closure properties, Diplomarbeit im Fach Informatik, Univ. Erlangen - Nuernberg, Jul 27 1994.
  66. J. Sauerberg and L. Shu, The long and the short on counting sequences, Amer. Math. Monthly 104 (1997), no. 4, 306-317.
  67. Cédric Saule, Mireille Regnier, Jean-Marc Steyaert, Alain Denise, Counting RNA pseudoknotted structures (extended abstract), dmtcs:2834 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
  68. Savage, Carla D. Generating permutations with k-differences. SIAM J. Discrete Math. 3 (1990), no. 4, 561--573. MR1069115 (92c:05003)
  69. Carla D. Savage and Gopal Viswanathan, The 1/k-Eulerian Polynomials, Electr. J. Combinatorics, 19 (2012), #P9.
  70. Carla D. Savage and Herbert S. Wilf, Pattern avoidance in compositions and multiset permutations (2005), arXiv:math/0504310.
  71. S. Savitz and M. Bintz, Exceptional Lattice Green's Functions, arXiv:1710.10260 [math-ph], 2017.
  72. Sawada, J., A simple Gray code to list all minimal signed binary representations. SIAM J. Discrete Math. 21 (2007), no. 1, 16-25 .
  73. Joe Sawada, Roy Li, Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms, Electr. J. Combinatorics, 19 (2012), #P43.
  74. Sawada, J.; Williams, A. Efficient oracles for generating binary bubble languages. Electron. J. Combin. 19 (2012), no. 1, Paper 42, 20 pp.
  75. J Sawada, A Williams, Successor rules for flipping pancakes and burnt pancakes, Preprint 2015;
  76. Nitin Saxena, Simone Severini, Igor Shparlinski, Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics (2007), arXiv:quant-ph/0703236.
  77. Artur Schaefer, Endomorphisms of The Hamming Graph and Related Graphs, arXiv preprint arXiv:1602.02186, 2016
  78. W. O. Scheeren, The Hidden Web: A Sourcebook, Published by Libraries Unlimited, Santa Barbara, CA, 2012.
  79. J. vom Scheidt, H.-J. Starkloff and R. Wunderlich, Stationary solutions of random differential equations with polynomial nonlinearities, Stochastic Analysis and Applications, 6(19):1059-1075, 2001.
  80. Edward Scheinerman, Efficient Local Representations of Graphs, In: Gera R., Hedetniemi S., Larson C. (eds) Graph Theory. Problem Books in Mathematics. Springer, 2016, doi:10.1007/978-3-319-31940-7_6
  81. Trevor Scheopner, The Cyclic Nature (and Other Intriguing Properties) of Descriptive Numbers, Princeton Undergraduate Mathematics Journal, Issue 1, Article 4, 2015. (A005151, A006711)
  82. Markus Schepke, Über Primzahlerzeugende Folgen, Bachelor Thesis, U. Hannover, (2009)
  83. Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner, A Note On Universal Point Sets for Planar Graphs, arXiv:1811.06482 [math.CO], 2018. (A000109, A000207, A006247, A007021, A027610)
  84. J. L. Schiffman, Exploring the Fibonacci sequence of order two with CAS technology,; no date.
  85. F. Schilder, Robust Text Analysis via Underspecification, in the Proceedings of the Workshop on Robust Methods in Analysis of Natutal Language Data (ROMAND 2000), A. Balim, V. Pallotta and H. Ghorbel (eds.), Lausanne, Switzerland, pages 105-120.
  86. Ernesto Schirmacher, Log-Concavity and the Exponential Formula, Journal of Combinatorial Theory, Series A, Volume 85, Issue 2, February 1999, Pages 127-134.
  87. Saul Schleimer, Bert Wiest, On the conjugacy problem in braid groups: Garside theory and subsurfaces, arXiv:1807.01500 [math.GT], 2018. (A080928)
  88. E. Schlemm, On the expected number of successes in a sequence of nested Bernoulli trials, arXiv preprint arXiv:1303.4979, 2013
  89. S. C. Schlicker, Numbers Simultaneously Polygonal and Centered Polygonal, Mathematics Magazine, Vol. 84, No. 5, December 2011 , pp. 339-?; doi:10.4169/math.mag.84.5.339
  90. S. Schlicker, L. Morales, D. Schultheis, polygonal chain sequences in the space of compact sets, JIS 12 (2009) 09.1.7.
  91. Michael J. Schlosser and Meesue Yoo, Elliptic Rook and File Numbers, Electronic Journal of Combinatorics, 24(1) (2017), #P1.31
  92. Natalie Schluter, The Taylor expansion for dropout is divergent, 2018. PDF (A019538)
  93. M. D. Schmidt, Generalized j-Factorial Functions, Polynomials, and Applications, J. Int. Seq. 13 (2010), 10.6.7.
  94. Maxie Schmidt, A computer algebra package for polynomial sequence recognition, MS Thesis, University of Illinois at Urbana-Champaign, 2014;
  95. Maxie D. Schmidt, Square Series Generating Function Transformations, arXiv preprint arXiv:1609.02803, 2016
  96. Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
  97. Maxie D. Schmidt, Factorization Theorems for Hadamard Products and Higher-Order Derivatives of Lambert Series Generating Functions, arXiv preprint arXiv:1712.00608, 2017
  98. Heinz Schmitz and Sebastian Niemann, A Bicriteria Traveling Salesman Problem with Sequence Priorities, in Metaheuristics in the Service Industry, Lecture Notes in Economics and Mathematical Systems, Volume 624.
  99. Schmutz, Eric Period lengths for iterated functions. Combin. Probab. Comput. 20 (2011), no. 2, 289-298.
  100. B. Schölkopf, Introduction to Machine Learning, 2011; PDF.
  101. Bernhard Schölkopf, Statistical and causal approaches to machine learning,, 2014 (see about 11 minutes into the talk).
  102. B. Schoenmakers, A tight lower bound for top-down skew heaps, Information Processing Letters, 61(5): 279-284, 14 March 1997.
  103. P. Schogt, The Wild Number Problem: math or fiction?, arXiv:1211.6583, 2012
  104. Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38 Les nombres brésiliens, Reprinted from Quadrature, no. 76, avril-juin 2010, pages 30-38, included here with permission from the editors of Quadrature.
  105. W. Schreiner, Computability and Complexity, Lecture Notes, Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria;
  106. Joachim Schröder, "Generalized Schröder Numbers and the Rotation Principle", J. Integer Sequences, Volume 10, 2007, Article 07.7.7.
  107. Joachim Schröder, The two-parameter class of Schröder inversions, Comment. Math. Univ. Carolinae 54 (2013) 5-19,
  108. A. Schuetz and G. Whieldon, Polygonal Dissections and Reversions of Series, arXiv preprint arXiv:1401.7194, 2014
  109. J. L. Schulman, The quantifier semigroup for bipartite graphs, Electronic Journal of Combinatorics, 18 (2011), #P123.
  110. A. Schulte, S. VanSchalkwyk, A. Yang, On the divisibility and valuations of the Franel numbers, in MSRI-UP Research Reports, 2014;
  111. Andrew J. Schultz and David A. Kofke, Fifth to eleventh virial coefficients of hard spheres, Phys. Rev. E 90, 023301, 4 August 2014
  112. P. R. F. Schumacher, A left weighted Catalan extension, Integers, 10 (2010), 771-792.
  113. P. R. F. Schumacher, Parking functions and generalized Catalan numbers, Dissertation, Texas A&M University (2009).
  114. Paul R. F. Schumacher, Descents in Parking Functions, Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.3. HTML (A001263)
  115. R Schumacher, Rapidly Convergent Summation Formulas involving Stirling Series, arXiv preprint arXiv:1602.00336, 2016
  116. Raphael Schumacher, Extension of Summation Formulas involving Stirling series, arXiv preprint arXiv:1605.09204, 2016
  117. Raphael Schumacher, The Formulas for the Distribution of the 3-Smooth, 5-Smooth, 7-Smooth and all other Smooth Numbers, arXiv preprint arXiv:1608.06928, 2016
  118. Raphael Schumacher, The self-counting identity, Fib. Quart., 55 (No. 2 2017), 157-167.
  119. T. Schwabhäuser, Preventing Exceptions to Robin's Inequality, arXiv preprint arXiv:1308.3678, 2013
  120. Schwartz, Moshe; Etzion, Tuvi, Two-dimensional cluster-correcting codes. IEEE Trans. Inform. Theory 51 (2005), no. 6, 2121-2132.
  121. Sylviane R. Schwer, Temporal Reasoning without Transitive Tables (2007), arXiv:0706.1290.
  122. Carlos Segovia, Numerical computations in cobordism categories,, 2013 ["It was a knock-out when after entering the sequence 2,5,15,51,187,715,... in the page OEIS, we found a great variety of different interpretations for it..."]
  123. Carlos Segovia, Counting words with vector spaces, 2013;
  124. C. Segovia, M. Winklmeier, Combinatorial Computations in Cobordism Categories, arXiv preprint arXiv:1409.2067, 2014
  125. Carlos Segovia and Monika Winklmeier, On the density of certain languages with p^2 letters, Electronic Journal of Combinatorics 22(3) (2015), #P3.16
  126. Amit Sehgal, Sunil Kumar, Sarita, Yashpal, Commutative Associative Binary Operations on a Set with Five Elements, J. Phys.: Conf. Ser. (2018) 1000 012063 doi:10.1088/1742-6596/1000/1/012063 (A023815)
  127. Jaroslav Seibert and Pavel Trojovsky, "On Multiple Sums of Products of Lucas Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.4.5.
  128. Makoto Sekiyama, Toshiya Ohtsuki, Hiroshi Yamamoto, "Analytical Solution of Smoluchowski Equations in Aggregation–Fragmentation Processes", Journal of the Physical Society of Japan, 86.10, ID 104003 (2017), doi:10.7566/JPSJ.86.104003.
  129. Thomas Selig, Jason P. Smith, Einar Steingrímsson, EW-tableaux, Le-tableaux, tree-like tableaux and the Abelian sandpile model, arXiv preprint arXiv:1711.01622 [math.CO], 2017. Also in The Electronic Journal of Combinatorics (2018) 25 (3), 1-32. (A186370)
  130. J. A. Sellers, Beyond Mere Convergence, PRIMUS (Problems, Resources and Issues in Mathematics Undergraduate Studies), XII, no. 2 (2002), 157-164.
  131. James A. Sellers, "Domino Tilings and Products of Fibonacci and Pell Numbers", J. Integer Sequences, Volume 5, 2002, Article 02.1.2.
  132. James A. Sellers, "Partitions Excluding Specific Polygonal Numbers As Parts", J. Integer Sequences, Volume 7, 2004, Article 04.2.4.
  133. D. Sensarma, S. S. Sarma, GMDES: A graph based modified Data Encryption Standard algorithm with enhanced security, IJRET: International Journal of Research in Engineering and Technology, Volume: 03 Issue: 03 | Mar-2014, eISSN: 2319-1163 | pISSN: 2321-7308;; 2014.
  134. S. Seo and H. Shin, Another refinement for Rooted Trees, arXiv:1106.1290, 2011.
  135. M. R. Sepanski, On Divisibility of Convolutions of Central Binomial Coefficients, Electronic Journal of Combinatorics, 21 (1) 2014, #P1.32.
  136. Paolo Serafini, An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes, Scientific Programming (2018), Article ID 3791075. doi:10.1155/2018/3791075 (A001006)
  137. Seroussi, Gadiel, On universal types. IEEE Trans. Inform. Theory 52 (2006), no. 1, 171-189.
  138. Seunghyun Seo, The Catalan Threshold Arrangement, Journal of Integer Sequences, 2017 Vol. 20, #17.1.1.
  139. Seunghyun Seo and Heesung Shin, Two involutions on vertices of ordered trees,
  140. Simone Severini, Universal quantum computation with unlabeled qubits (2006), arXiv:quant-ph/0601078.
  141. Simone Severini, Nondiscriminatory Propagation on Trees (2008); arXiv:0805.0181
  142. Simone Severini and Ferenc Sz\"oll\H{o}si, A further look into combinatorial orthogonality (2007), arXiv:0709.3651.
  143. Sarah Shader, Weighted Catalan Numbers and Their Divisibility Properties, Research Science Institute, MIT, 2014;
  144. J. Shallit, An interesting continued fraction, Math. Mag. 48 (1975), no. 4, 207-211.
  145. J. Shallit, Rational Numbers with Non-Terminating, Non-Periodic Modified Engel-Type Expansions, Fibonacci Quarterly 31 (1993), 37-40.
  146. J. Shallit, Number theory and formal languages, in D. A. Hejhal, J. Friedman, M. C. Gutzwiller, and A. M. Odlyzko, eds., Emerging Applications of Number Theory, IMA Volumes in Mathematics and Its Applications, V. 109, Springer-Verlag, 1999, pp. 547-570.
  147. J. Shallit, Remarks on inferring integer sequences.
  148. J. Shallit, Editing an Electronic Journal, Notices Amer. Math. Soc., 62 (2015), 169-171;
  149. Jeffrey Shallit, Lukas Spiegelhofer, Continuants, run lengths, and Barry's modified Pascal triangle, arXiv:1710.06203 [math.CO], 2017. (A114212, A119326)
  150. Michael Ian Shamos, Shamos’s Catalog of the Real Numbers, 2011.
  151. A. G. Shannon, Some recurrence relations for binary sequence matrices, NNTDM 17 (2011), 4, 913;
  152. Anthony G. Shannon, Ömür Deveci, Some variations on Fibonacci matrix graphs, Notes on Number Theory and Discrete Mathematics, Print ISSN 1310–5132, Online ISSN 2367–8275, Vol. 23, 2017, No. 4, 85–93
  153. A. G. Shannon, J. V. Leyendekkers, The Golden Ratio family and the Binet equation, Notes on Number Theory and Discrete Mathematics, Vol. 21, 2015, No. 2, 35–42
  154. A. G. Shannon and J. V. Leyendekkers, "On Legendre’s Conjecture", Notes on Number Theory and Discrete Mathematics, Vol. 23, No. 2 (2017): 117-125. PDF
  155. Yulin Shao, Soung Chang Liew, Taotao Wang, AlphaSeq: Sequence Discovery with Deep Reinforcement Learning, arXiv:1810.01218 [cs.LG], 2018. (A000040)
  156. Lou Shapiro, Some Open Questions about Random Walks, Involutions, Limiting Distributions, and Generating Functions, Advances in Applied Mathematics, Volume 27, Issues 2-3, August 2001, Pages 585-596.
  157. Lou Shapiro, Some open questions about random walks, involutions, limiting distributions and generating functions. Special issue in honor of Dominique Foata's 65th birthday (Philadelphia, PA, 2000). Adv. in Appl. Math. 27 (2001), no. 2-3, 585-596.
  158. Shapiro, Louis W., Bijections and the Riordan group. Random generation of combinatorial objects and bijective combinatorics. Theoret. Comput. Sci. 307 (2003), no. 2, 403-413.
  159. L. W. Shapiro and A. B. Stephens, Bootstrap percolation, the Schroeder numbers and the N-kings problem, SIAM J. Discrete Math., Vol. 4 (1991), pp. 275-280.
  160. L. W. Shapiro, C. J. Wang, A bijection between 3-Motzkin paths and Schröder paths with no peak at odd height, JIS 12 (2009) 09.3.2
  161. L. W. Shapiro and C. J. Wang, Generating identities via 2 X 2 matrices, Congressus Numerantium, 205 (2010), 33-46.
  162. L. W. Shapiro, W.-J. Woan and S. Getu, Runs, slides and moments, SIAM J. Alg. Discrete Methods, 4 (1983), 459-466.
  163. Nathaniel Shar, Experimental methods in permutation patterns and bijective proof, PhD Dissertation, Mathematics Department, Rutgers University, May 2016;
  164. N. Shar, D. Zeilberger, The (Ordinary) Generating Functions Enumerating 123-Avoiding Words with r Occurrences of Each of 1, 2,..., n are Always Algebraic, arXiv preprint arXiv:1411.5052, 2014
  165. R. Sharafdini, T. Doslic, Hosoya index of splices, bridges and necklaces, 2015;
  166. R. Sharipov, Perfect cuboids and irreducible polynomials, Arxiv preprint arXiv:1108.5348, 2011
  167. R. Sharipov, A note on the first cuboid conjecture, Arxiv preprint arXiv:1109.2534, 2011
  168. R. Sharipov, A note on the second cuboid conjecture. Part I, Arxiv preprint arXiv:1201.1229, 2012
  169. Ruslan Sharipov, Perfect cuboids and multisymmetric polynomials, Arxiv preprint arXiv:1205.3135, 2012
  170. R. Sharipov, On an ideal of multisymmetric polynomials associated with perfect cuboids, arXiv:1206.6769, 2012
  171. R. Sharipov, On the equivalence of cuboid equations and their factor equations, arXiv:1207.2102, 2012
  172. R. Sharipov, A biquadratic Diophantine equation associated with perfect cuboids, Arxiv preprint arXiv:1207.4081, 2012
  173. R. Sharipov, On a pair of cubic equations associated with perfect cuboids, Arxiv preprint arXiv:1208.0308, 2012.
  174. R. Sharipov, On two elliptic curves associated with perfect cuboids, Arxiv preprint arXiv:1208.1227, 2012
  175. R. Sharipov, A note on solutions of the cuboid factor equations, Arxiv preprint arXiv:1209.0723, 2012
  176. R. Sharipov, A note on rational and elliptic curves associated with the cuboid factor equations, arXiv:1209.5706, 2012
  177. Ruslan Sharipov, Asymptotic estimates for roots of the cuboid characteristic equation in the linear region, preprint arXiv:1505.02745, 2015. (A031173, A031174, A031175)
  178. Ruslan Sharipov, Reverse asymptotic estimates for roots of the cuboid characteristic equation in the case of the second cuboid conjecture, preprint arXiv:1505.00724, 2015. (A031173, A031174, A031175 )
  179. Ruslan Sharipov, A note on invertible quadratic transformations of the real plane, arXiv preprint arXiv:1507.01861, 2015
  180. Debashish Sharma, Mausumi Sen, Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede, Special Matrices 6.1 (2018): 77-92. Special Issue on Linear Algebra and its Applications (ICLAA 2017). doi:10.1515/spma-2018-0008 (A278636)
  181. A. Sharov, R. M. Roth, New upper bounds for grain-correcting and grain-detecting codes, in Proc. Internat. Sympos. Information Theory (ISIT), 2014;
  182. Mark Shattuck, "Bijective Proofs of Parity Theorems for Partition Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.1.5.
  183. Mark A. Shattuck, Tiling proofs of some formulas for the Pell numbers of odd index, Integers, 9 (2009), 53-64.
  184. Mark A. Shattuck, Proofs of some binomial identities using the method of least squares, Fib. Q., 48 (2010), 290-297.
  185. Mark Shattuck, Convolution identities for Stirling numbers of the first kind via involution, INTEGERS, 12, 2012, #A59.
  186. M. Shattuck, Combinatorial proofs of determinant formulas for the Fibonacci and Lucas polynomials, Fib. Q., 51 (2013), 63-71.
  187. M. Shattuck, On the zeros of some polynomials with combinatorial coefficients, Annales Mathematicae et Informaticae, 42 (2013) pp. 93-101,
  188. M. Shattuck, Combinatorial proofs of some Bell number formulas, arXiv preprint arXiv:1401.6588, 2014
  189. M. Shattuck, Combinatorial Proofs of Some Formulas for Triangular Tilings, Journal of Integer Sequences, 17 (2014), #14.5.5.
  190. M. Shattuck, Combinatorial identities for incomplete tribonacci polynomials, arXiv preprint arXiv:1406.2755, 2014.
  191. M. Shattuck, Generalized r-Lah numbers, arXiv preprint arXiv:1412.8721, 2014
  192. Mark Shattuck, Combinatorial proofs of some Stirling number formulas, Preprint (ResearchGate), 2014.
  193. Mark Shattuck, Some combinatorial formulas for the partial r-Bell polynomials, Notes on Number Theory and Discrete Mathematics, Vol. 23, 2017, No. 1, 63-76.
  194. Mark Shattuck, Identities for Generalized Whitney and Stirling Numbers, Journal of Integer Sequences, 2017, Vol. 20, #17.10.4.
  195. Mark A. Shattuck and Carl G. Wagner, "Parity Theorems for Statistics on Lattice Paths and Laguerre Configurations", J. Integer Sequences, Volume 8, 2005, Article 05.5.1.
  196. Mark A. Shattuck and Carl G. Wagner, "Periodicity and Parity Theorems for a Statistic on r-Mino Arrangements", J. Integer Sequences, Volume 9, 2006, Article 06.3.6.
  197. Mark A. Shattuck and Carl G. Wagner, "Some Generalized Fibonacci Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.3.
  198. Kennan Shelton and Michael Siler, Variations of a Coin-Removal Problem (2004), arXiv:math/0411052.
  199. Zhizhang Shen, Ke Qiu and Eddie Cheng, On the surface area of the (n,k)-star graph, Theoretical Computer Science, 2009.
  200. Rick L. Shepherd, Binary quadratic forms and genus theory, Master of Arts Thesis, University of North Carolina at Greensboro, 2013;
  201. Michael A. Sherbon, "Fundamental Nature of the Fine-Structure Constant," International Journal of Physical Research, 3, 2 (1): 1-9 (2014).
  202. Michael A. Sherbon, "Fundamental Physics and the Fine-Structure Constant," International Journal of Physical Research, 5 (2): 46-48 (2017).
  203. Michael A. Sherbon, "Fine-Structure Constant from Golden Ratio Geometry," International Journal of Mathematics and Physical Sciences Research, 5 (2): 89-100 (2018). doi:10.2139/ssrn.3148761
  204. Vladimir Shevelev, A Conjecture on Primes and a Step towards Justification (2007), arXiv:0706.0786.
  205. Vladimir Shevelev, On the Basis Polynomials in the Theory of Permutations with Prescribed Up-Down Structure, arXiv:math.CO/0801.0072
  206. Vladimir Shevelev, On Connection between the Numbers of Permutations and Full Cycles with Some Restrictions on Positions and Up-Down Structure arXiv:math.CO/0803.2396
  207. Vladimir Shevelev, On Unique Additive Representations of Positive Integers and Some Close Problems (2008); arXiv:0811.0290
  208. Vladimir Shevelev, Process of "Primoverization" of Numbers of the Form a^n-1 (2008); arXiv:0807.2332
  209. Vladimir Shevelev, An Upper Estimate for the Overpseudoprime Counting Function (2008); arXiv:0807.1975
  210. Vladimir Shevelev, Overpseudoprimes, Mersenne Numbers and Wieferich primes (2008); arXiv:0806.3412
  211. Vladimir Shevelev, Binary Additive Problems: Theorems of Landau and Hardy-Littlwood Type (2009) arXiv:0902.1046
  212. Vladimir Shevelev, Binary Additive Problems: Recursions for Numbers of Representations (2009) arXiv:0901.3102
  213. Vladimir Shevelev, On critical small intervals containing primes, arXiv:0908.2319 [math.NT]
  214. Vladimir Shevelev, The menage problem with a known mathematician, arXiv:1101.5321 [math.CO]
  215. Vladimir Shevelev, SPECTRUM OF PERMANENTS VALUES AND ITS EXTREMAL MAGNITUDES ..., Arxiv preprint arXiv:1104.4051, 2011.
  216. V. Shevelev, Combinatorial minors of matrix functions and their applications, Arxiv preprint arXiv:1105.3154, 2011
  217. Shevelev, Vladimir Binomial coefficient predictors. J. Integer Seq. 14 (2011), no. 2, Article 11.2.8, 8 pp.
  218. Vladimir Shevelev, Ramanujan and Labos Primes, Their Generalizations, and Classications of Primes, J. Integer Sequences, 15 (2012), #12.1.1.
  219. Vladimir Shevelev, The number of permutations with prescribed up-down structure as a function of two variables, INTEGERS, 12 (2012), #A1.
  220. Vladimir Shevelev, Representation of positive integers by the form x1...xk + x1 + ... + xk, arXiv:1508.03970, 2015
  221. Vladimir Shevelev, Representation of positive integers by the form x^3+y^3+z^3-3xyz, arXiv:1508.05748, 2015
  222. V. Shevelev, Exponentially S-numbers, preprint arXiv:1510.05914, 2015
  223. V. Shevelev, Set of all densities of exponentially S-numbers, arXiv preprint arXiv:1511.03860, 2015
  224. V Shevelev, A fast computation of density of exponentially S-numbers, arXiv preprint arXiv:1602.04244, 2016
  225. V Shevelev, Two analogs of Thue-Morse sequence, arXiv preprint arXiv:1603.04434, 2016
  226. Vladimir Shevelev, On Erdos's constant, arXiv preprint arXiv:1605.08884, 2016
  227. Vladimir Shevelev, S-exponential numbers, ACTA ARITHMETICA Online First version, 2016; doi:10.4064/aa8395-5-2016
  228. Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], June 2017.
  229. Vladimir Shevelev, On a Luschny question, arXiv:1708.08096, August 2017.
  230. Vladimir Shevelev, Gilberto Garcia-Pulgarin, Juan Miguel Velasquez-Soto and John H. Castillo, Overpseudoprimes, and Mersenne and Fermat numbers as primover numbers, Arxiv preprint arXiv:1206.0606, 2012, J. Int. Seq. 15 (2012) #12.7.7
  231. V. Shevelev, C. R. Greathouse IV and P. J. C. Moses, On intervals (kn,(k+1)n) containing a prime for all n>1, arXiv:1212.2785, 2012; Journal of Integer Sequences, Vol. 16 (2013), Article 13.7.3.
  232. VLADIMIR SHEVELEV AND PETER J. C. MOSES, On a sequence of polynomials with hypothetically integer coefficients, arXiv:1112.5715, 2011; INTEGERS, 13 (2013), #A9.
  233. VLADIMIR SHEVELEV AND PETER J. C. MOSES, Tangent power sums and their applications, Arxiv preprint arXiv:1207.0404, 2012
  234. V. Shevelev and P. J. C. Moses, A family of digit functions with large periods, arXiv:1209.5705, 2012
  235. Vladimir Shevelev and PJC Moses, ALICE AND BOB GO TO DINNER: A VARIATION ON MENAGE, INTEGERS, 2016, Vol. 16, #A72.
  236. Jessica Shi, Enumeration of unlabeled graph classes: A study of tree decompositions and related approaches, 2015, PDF
  237. Minjia Shi, Patrick Solé, The largest number of weights in cyclic codes, arXiv:1807.08418 [cs.IT], 2018. (A082116)
  238. Minjia Shi, Li Xu, Denis S. Krotov, The number of the non-full-rank Steiner triple systems. arXiv:1806.00009 [math.CO], 2018. (A002860, A030128, A036981)
  239. Minjia Shi, Zhongyi Zhang, Patrick Solé, Pisano period codes, arXiv:1709.04582 [cs.IT], 2017.
  240. Zheng Shi, Impurity entropy of junctions of multiple quantum wires, arXiv preprint arXiv:1602.00068, 2016
  241. Zheng Shi, I Affleck, A fermionic approach to tunneling through junctions of multiple quantum wires, arXiv preprint arXiv:1601.00510, 2016
  242. S. A. Shirali, Case Studies in Experimental Mathematics, 2013; PDF
  243. Ilya Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Electronic Notes in Discrete Mathematics, Volume 9, June 2001, Pages 19-35.
  244. I. Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Discrete Appl. Math. 155 (2007), no. 12, 1539-1548.
  245. Vladimir A. Shlyk, Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number. arXiv:1805.07989 [math.CO], 2018. (A002219, A108917, A203898, A300795)
  246. Z. Shomanov, Combinatorial formula for the partition function, arXiv:1508.03173 (2015)
  247. Taylor Short, The saturation number of carbon nanocones and nanotubes, arXiv:1807.11355 [math.CO], 2018. (A032765)
  248. Igor E. Shparlinski, "On the Sum of Iterations of the Euler Function", J. Integer Sequences, Volume 9, 2006, Article 06.1.6.
  249. I. Shpitser, R. J. Evans, T. S. Richardson, J. M. Robins, Introduction to nested Markov models, Behaviormetrika, Behaviormetrika Vol. 41, No. 1, 2014, 3-39.
  250. I. Shpitser, T. S. Richardson, J. M. Robins and R. Evans, Parameter and Structure Learning in Nested Markov Models, arXiv:1207.5058, 2012
  251. Punit Shrivastava, Exploring Jacobsthal and Jacobsthal-Lucas numbers on complex plane, American Journal of Mathematics and Mathematical Sciences, Volume 2, No. 1, January-June 2013, Pp. 87-90;
  252. D. Shtefan and I. Dobrovolska, The sums of the consecutive Fibonacci numbers, Fib. Q., 56 (2018), 229-236.
  253. Walter Shur, "Two Game-Set Inequalities", J. Integer Sequences, Volume 6, 2003, Article 03.4.1.
  254. Anton Shutov and Andrey Maleev, Coordination sequences and layer-by-layer growth of periodic structures, preprint, 2018
  255. SIAM News, Recognitions ["The numbers that came out were 4, 28, 232, 2092, 19864, . . . and we couldn't see a pattern. In desperation, we sent them to (now (a miracle program created by Neil Sloane). ..."]
  256. Irfan Siap and I. Aydoglu, Counting the generator matrices of Z_2 Z_8 codes, arXiv:1303.6985
  257. Sahar Siavashi, On the solutions of certain congruences, Master's Thesis, Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, 2017.
  258. M. Siebers and U. Schmid, Semi-analytic Natural Number Series Induction, in KI 2012: Advances in Artificial Intelligence, Lecture Notes in Computer Science Volume 7526, 2012, pp 249-252.
  259. Aaron N. Siegel, Mis\`ere canonical forms of partizan games (2007), arXiv:math/0703565.
  260. J. A. Siehler, The Finite Lamplighter Groups: A Guided Tour, College Mathematics Journal, Vol. 43, No. 3 (May 2012), pp. 203-211
  261. F. Sievers, G. M. Hughes, D. G. Higgins, Systematic Exploration of Guide-Tree Topology Effects for Small Protein Alignments, BMC Bioinformatics 2014, 15:338;
  262. Markus Sigg, On a conjecture of John Hoffman regarding sums of palindromic numbers, arXiv preprint arXiv:1510.07507, 2015
  263. Markus Sigg, Gasper's determinant theorem, revisited, arXiv:1804.02897 [math.CO], 2018. (A085000, A301370, A301371)
  264. John K. Sikora, On the High Water Mark Convergents of Champernowne's Constant in Base Ten, arXiv:1210.1263, 2012
  265. J. K. Sikora, Analysis of the High Water Mark Convergents of Champernowne's Constant in Various Bases, arXiv preprint arXiv:1408.0261, 2014
  266. John K. Sikora, On Calculating the Coefficients of a Polynomial Generated Sequence Using the Worpitzky Number Triangles. arXiv:1806.00887 [math.NT], 2018. (A000629, A005460, A008277, A019538, A028246, A130850)
  267. Jean-Louis Sikorav, Best rational approximations of an irrational number, arXiv:1807.06284 [math.NT], 2018. (A063674)
  268. Tomi Silander, Janne Leppä-aho, Elias Jääsaari, Teemu Roos, Quotient Normalized Maximum Likelihood Criterion for Learning Bayesian Network Structures, International Conference on Artificial Intelligence and Statistics, 2018. PDF (A000262)
  269. A. V. Sills and H. Wang, On the maximal Wiener index and related questions, Discrete Applied Mathematics, Volume 160, Issues 10-11, July 2012, Pages 1615-1623.
  270. Jannik Silvanus, Jens Vygen, Few Sequence Pairs Suffice: Representing All Rectangle Placements, arXiv:1708.09779 [math.CO], 2017. ["The authors are thankful to the On-Line Encyclopedia of Integer Sequences [12], which "]drew their attention to plane permutations.
  271. Tim Silverman, Counting Cliques in Finite Distant Graphs, arXiv preprint arXiv:1612.08085, 2016
  272. J. R. Silvester, Factorial Factors, Maths. Gazette 88 (2004) 119-123.
  273. R. Simion, Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations, The Electronic Journal of Combinatorics, Volume 7(1), 2000, R#9.
  274. Frank Simon, Algebraic Methods for Computing the Reliability of Networks, Dissertation, Doctor Rerum Naturalium (Dr. rer. nat.), Fakultät Mathematik und Naturwissenschaften der Technischen Universität Dresden,, 2012.
  275. Jamie Simpson, Modified Padovan words and the maximum number of runs in a word, Australasian J. Combinat. xx (2009)
  276. T. Simpson, Permutations with unique fixed and reflected points. Ars Combin. 39 (1995), 97-108.
  277. A. K. Singh, A. Das and A. Kumar, RAPIDITAS: RAPId Design-space-exploration Incorporating Trace-based Analysis and Simulation, 2013;
  278. Amit Kumar Singh, Akash Kumar and Thambipillai Srikanthan, Accelerating Throughput-aware Run-time Mapping for Heterogeneous MPSoCs, ACM Transactions on Design Automation of Electronic Systems, 2012,
  279. A. K. Singh, A. Kumar, J. Wu and T. Srikanthan, CADSE: communication aware design space exploration for efficient run-time MPSoC management, Frontiers of Computer Science, Volume 7, Issue 3 , pp. 416-430.
  280. Singh, Jitender, On an Arithmetic Convolution, J. Int. Seq. 17 (2014) # 14.6.7
  281. John R. Singler, Transition to turbulence, small disturbances, and sensitivity analysis II: The NavierStokes equations, Journal of Mathematical Analysis and Applications, Volume 337, Issue 2, 15 January 2008, Pages 1442-1456.
  282. D. Singmaster, Triangles with integer sides and sharing barrels, College Math. J. 21 (1990) 278-285.
  283. Márton Sipos, Josh Gahm, Narayan Venkat, Dave Oran, Network-Aware Feasible Repairs for Erasure-Coded Storage, IEEE/ACM Transactions on Networking (2018) Vol. 26, Issue 3, 1404-1417. doi:10.1109/TNET.2018.2830800
  284. Márton Ákos Sipos, Narayan Venkat, Joshua Bernard Gahm, John George Apostolopoulos, Efficient repair of erasure coded data based on coefficient matrix decomposition, US Patent #US20180121286A1, Cisco Technology Inc, 2016. HTML (A000041)
  285. G. Siudem, A. Fronczak, P. Fronczak, Exact low-temperature series expansion for the partition function of the two-dimensional zero-field s= 1/2 Ising model on the infinite square lattice, arXiv preprint arXiv:1410.7963, 2014
  286. G Siudem, A Fronczak, P Fronczak, Exact low-temperature series expansion for the partition function of the zero-field Ising model on the infinite square lattice, Scientific Reports, 6, 2016, Article number: 33523; doi:10.1038/srep33523
  287. Aditya Sivakumar, Dmitri Tymoczko, Intuitive Musical Homotopy, 2018. PDF (A005893)
  288. S. Sivasubramanian, Signed Excedance Enumeration in the Hyperoctahedral group, El. J. Combinat. 21 (2) (2014) # P2.10
  289. J.-M. Sixdeniers, K. A. Penson and A. I. Solomon, "Extended Bell and Stirling Numbers From Hypergeometric Exponentiation", J. Integer Sequences, Volume 4, 2001, Article 01.1.4.
  290. Jonas Sjostrand, Bruhat intervals as rooks on skew Ferrers boards (2006), arXiv:math/0601615.
  291. Matthew Skala, Graph Nimors, arXiv preprint arXiv:1604.04072, 2016
  292. M. B. Skopenkov, A. A. Pakharev, A. V. Ustinov, Through the resistors network, Mat. Pros. Ser. 3, issue 18, 2014 (33–65) [in Russian].
  293. Z. Skupien, Sums of Powered Characteristic Roots Count Distance-Independent Circular Sets, Discussiones Mathematicae Graph Theory. Volume 33, Issue 1, Pages 217-229, ISSN (Print) 2083-5892, doi:10.7151/dmgt.1658, April 2013.
  294. Z. Skupien, A. Zak, Pair-sums packing and rainbow cliques, in TOPICS IN GRAPH THEORY, A tribute to A. A. and T. E. Zykovs on the occasion of A. A. Zykov's 90th birthday, ed. R. Tyshkevich, Univ. Illinois, 2013, pages 131-144;

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.