This site is supported by donations to The OEIS Foundation.


From OeisWiki
Jump to: navigation, search

"When Erdenberger [6] appeared on the arXiv, John McKay immediately pointed out that this is the list of supersingular primes A002267, the primes that divide the order of the Monster..." [G. K. Sankaran, 2020]

"We used the Online Encyclopedia of Integer Sequences to trace related research..." [Luigi Santocanale, 2019]

"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..." [Carlos Segovia, 2013]

"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). ..." [SIAM News, 1999]

"The authors are thankful to the On-Line Encyclopedia of Integer Sequences [12], which drew their attention to plane permutations." [Jannik Silvanus and Jens Vygen, 2017]

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. Ahmad Sabri, Vincent Vajnovszki, On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order, Pure Mathematics and Applications (2019) Vol. 28, Issue 1, 109-119. doi:10.1515/puma-2015-0035 (A000085)
  4. R. Sachdeva and A.K. Agarwal, Combinatorics of certain restricted n-color composition functions, Discrete Mathematics, 340, (2017), 361-372.
  5. J. Sack and H. Ulfarsson, Refined inversion statistics on permutations, Arxiv preprint arXiv:1106.1995, 2011.
  6. Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan, Optimal Representations of a Traffic Distribution in Switch Memories, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications. doi:10.1109/INFOCOM.2019.8737645
  7. Markus Saers, Dekai Wu and Chris Quirk, On the Expressivity of Linear Transductions, PDF.
  8. 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.
  9. Bruce E. Sagan, Congruences via abelian groups, Journal of Number Theory, Volume 20, Issue 2, April 1985, Pages 210-237.
  10. Bruce Sagan, Proper partitions of a polygon and k-Catalan numbers (2004), arXiv:math/0407280 and Ars. Comb. 88 (2008) 109-124.
  11. The Sage Development Team, Common Graphs (Graph Generators), Graph Theory, Sage 9.2 Reference Manual (2020). Common Graphs (Graph Generators) (A000055, A000088, A000666, A001349, A002851, A0033995, A081621, A113201)
  12. The Sage Development Team, Graph Theory (Various families of graphs), Sage 9.2 Reference Manual (2020). HTML (A000055)
  13. 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
  14. Murat Sahin and Elif Tan, Conditional (strong) divisibility sequences, Fib. Q., 56 (No. 1, 2018), 18-31.
  15. Hanno Sahlmann, Entropy calculation for a toy black hole (2007), arXiv:0709.0076.
  16. Soumyadip Sahu, On Certain Reciprocal Sums, arXiv:1807.05454 [math.NT], 2018. (A248230, A248234)
  17. M. K. Sahukar and G. K. Panda, Repdigits in Euler functions of Pell numbers, Fib. Q., 57 (No. 2, 2019), 134-138.
  18. 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
  19. R. Sainudiin, Algebra and Arithmetic of Plane Binary Trees, Slides of a talk, 2014;
  20. Raazesh Sainudiin, Statistical Regular Pavings in Bayesian Nonparametric Density Estimation, 2014;
  21. R. Sainudiin, Some Arithmetic, Algebraic and Combinatorial Aspects of Plane Binary Trees, Slides from a talk, Oct 27 2014;
  22. R Sainudiin, A Veber, A Beta-splitting model for evolutionary trees, arXiv preprint arXiv:1511.08828, 2015
  23. 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
  24. 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
  25. 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.
  26. Ana Sălăgean, Ferruh Özbudak, Counting Boolean functions with faster points, Designs, Codes and Cryptography (2020). doi:10.1007/s10623-020-00738-7 (A316554)
  27. Sajad Salami, On special matrices related to Cauchy and Toeplitz matrices, Instítuto da Matemática e Estatística, Universidade Estadual do Rio de Janeiro (Brazil, 2019). PDF (A005249)
  28. 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.
  29. 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
  30. 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;
  31. 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
  32. Ville Salo, Decidability and Universality of Quasiminimal Subshifts, arXiv preprint arXiv:1411.6644, 2014.
  33. Ville Salo, Universal gates with wires in a row, arXiv:1809.08050 [math.GR], 2018. (A000031)
  34. Ville Salo, Subshifts with sparse traces, University of Turki, Finland (2019). PDF (A055979)
  35. Ville Salo, Cutting Corners, arXiv:2002.08730 [math.DS], 2020. (A295928)
  36. D. Salomon, Variable-length Codes for Data Compression, Springer-Verlag.
  37. D. Salomon, G. Motta, doi:10.1007/978-1-84882-903-9, Handbook of data compression, Springer, 2010.
  38. V. Salov, Inevitable Dottie Number. Iterals of cosine and sine, arXiv:1212.1027, 2012
  39. 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;
  40. 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.
  41. Rafaele Salvia, A catalogue of matchstick graphs, arXiv:1303.5965
  42. Ivano Salvo, Agnese Pacifico, Computing Integer Sequences: Filtering vs Generation (Functional Pearl), arXiv:1807.11792 [cs.PL], 2018. (A002858, A033629)
  43. B. Salvy, Automatic Asymptotics and Generating Functions, Algorithms seminar, 1992-1993, INRIA Research Report #2130, 47-50. (Ps, Pdf)
  44. B. Salvy, Découverte de récurrences
  45. 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.
  46. 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.
  47. B. Sambale, Pseudo-Sylow numbers, Amer. Math. Monthly 126 (2019), 60-65.
  48. Benjamin Sambale, On a theorem of Ledermann and Neumann, arXiv:1909.13220 [math.GR], 2019. (A137315)
  49. Samieinia, Shiva, The number of Khalimsky-continuous functions on intervals. Rocky Mountain J. Math. 40 (2010), no. 5, 1667-1687.
  50. S. Samieinia, doi:10.4171/PM/1858, The number of continuous curves in digital geometry, Port. Mathem. 67 (1) (2010) 75-89
  51. M. J. Samuel, Word posets, with applications to Coxeter groups, Arxiv preprint arXiv:1108.3638, 2011.
  52. Pablo San Segundo, Fabio Furini, Jorge Artieda, A new branch-and-bound algorithm for the Maximum Weighted Clique Problem, Computers & Operations Research (2019) Vol. 110, 18-33. doi:10.1016/j.cor.2019.05.017 (A265032)
  53. F. M. Sanchez, Remarkable Properties of the Eddington Number 137 and Electric Parameter 137.036 excluding the Multiverse Hypothesis, 2015;
  54. F. M. Sanchez, M. H. Grosmann, R. Veysseyre, H. Veysseyre, and D. Weigel, Towards Science Unification Through Number Theory, Preprint, December 9, 2020
  55. 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.
  56. 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
  57. Maya Sankar, Further Bijections to Pattern-Avoiding Valid Hook Configurations, arXiv:1910.08895 [math.CO], 2019. (A005700, A005789, A151347)
  58. G. K. Sankaran, Locally symmetric varieties and holomorphic symplectic manifolds, University of Bath (UK, 2020). PDF (A002267) When [6] appeared on the arXiv, John McKay immediately pointed out that this is the list of supersingular primes A002267, the primes that divide the order of the Monster: the same list, recognised by the same person, led to the Moonshine conjectures and the famous work of Borcherds (yielding, among many other things, the Borcherds form Φ). We still do not have a completely satisfactory explanation for this coincidence, although it is not completely mysterious. It is quite likely that it is an artefact of the proof: it could perfectly well be that, for example, A71 is in fact of general type.
  59. G. K. Sankaran, A supersingular coincidence, arXiv:2009.11379 [math.NT], 2020. (A002267)
  60. David Sankoff and Lani Haque, Power Boosts for Cluster Tests, in Comparative Genomics, Lecture Notes in Computer Science, Volume 3678/2005, Springer-Verlag.
  61. C. Sanna, On Arithmetic Progressions of Integers with a Distinct Sum of Digits, Journal of Integer Sequences, Vol. 15 (2012), #12.8.1.
  62. Carlo Sanna, On the number of distinct exponents in the prime factorization of an integer, arXiv:1902.09224 [math.NT], 2019. (A071625, A130091)
  63. Noriaki Sannomiya, H Katsura, Y Nakayama, Supersymmetry breaking and Nambu-Goldstone fermions with cubic dispersion, arXiv preprint arXiv:1612.02285, 2016
  64. Joseph M. Santmyer, A stirling like sequence of rational numbers, Discrete Mathematics, Volume 171, Issues 1-3, 20 June 1997, Pages 229-235.
  65. Luigi Santocanale, On discrete idempotent paths, arXiv:1906.05590 [math.LO], 2019. (A001519, A001906, A088305, A144224) We used the Online Encyclopedia of Integer Sequences to trace related research...
  66. Santocanale, Luigi; Wehrung, Friedrich The extended permutohedron on a transitive binary relation. European J. Combin. 42 (2014), 179-206.
  67. 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
  68. 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
  69. 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.
  70. 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
  71. Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon, Prosenjit Gupta, Efficient meta-data structure in top-k queries of combinations and multi-item procurement auctions, Theoretical Computer Science (2020) Vol. 814, 210-222. doi:10.1016/j.tcs.2020.01.036
  72. Raman Sanyal, Axel Werner, Günter M. Ziegler, On Kalai's conjectures concerning centrally symmetric polytopes (2007), arXiv:0708.3661.
  73. 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.
  74. Sapounakis, A.; Tasoulas, I.; Tsikouras, P. Ordered trees and the inorder traversal. Discrete Math. 306 (2006), no. 15, 1732-1741.
  75. 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.
  76. A. Sapounakis, I. Tasoulas and P. Tsikouras, Counting strings in Dyck paths, Discrete Math., 307 (2007), 2909-2924.
  77. 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.
  78. A. Sapounakis and P. Tsikouras, "On k-colored Motzkin words", J. Integer Sequences, Volume 7, 2004, Article 04.2.5.
  79. Sapounakis, A.; Tsikouras, P. Counting peaks and valleys in k-colored Motzkin paths. Electron. J. Combin. 12 (2005), Research Paper 16, 20 pp.
  80. 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.
  81. M. Saračević and A. Selimi, Data Encryption for IoT Applications Based on Two-Parameter Fuss–Catalan Numbers, Security and Trust Issues in Internet of Things: Blockchain to the Rescue (2020), see page 150.
  82. 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
  83. Rahul Sarkar, Ewout van den Berg, On sets of commuting and anticommuting Paulis, arXiv:1909.08123 [quant-ph], 2019. (A128036)
  84. 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
  85. Ulrike Sattler, Decidable classes of formal power series with nice closure properties, Diplomarbeit im Fach Informatik, Univ. Erlangen - Nuernberg, Jul 27 1994.
  86. Pratik Saturi, Back to society, Masters thesis, Unitec Institute of Technology (New Zealand, 2019). PDF (A000045)
  87. J. Sauerberg and L. Shu, The long and the short on counting sequences, Amer. Math. Monthly 104 (1997), no. 4, 306-317.
  88. 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)
  89. Arnold Saunders, A Class of Random Recursive Tree Algorithms with Deletion, arXiv:1906.02720 [math.PR], 2019. (A001405)
  90. Arnold T. Saunders, Jr., Random Recursive Tree Evolution Algorithms: Identification and Characterization of Classes of Deletion Rules, Ph. D. thesis, The George Washington University, ProQuest Dissertations Publishing (2020) 27830773. Preview (A001405, A024493) Cross-referencing a counting sequence with the Online Encyclopedia of Integer Sequences (OEIS) often uncovers unexpected connections with other combinatorial classes
  91. Lorenzo Sauras-Altuzarra, Some arithmetical problems that are obtained by analyzing proofs and infinite graphs, arXiv:2002.03075 [math.NT], 2020. (A055089, A253317)
  92. Savage, Carla D. Generating permutations with k-differences. SIAM J. Discrete Math. 3 (1990), no. 4, 561--573. MR1069115 (92c:05003)
  93. Carla D. Savage and Gopal Viswanathan, The 1/k-Eulerian Polynomials, Electr. J. Combinatorics, 19 (2012), #P9.
  94. Carla D. Savage and Herbert S. Wilf, Pattern avoidance in compositions and multiset permutations (2005), arXiv:math/0504310.
  95. S. Savitz and M. Bintz, Exceptional Lattice Green's Functions, arXiv:1710.10260 [math-ph], 2017.
  96. Sawada, J., A simple Gray code to list all minimal signed binary representations. SIAM J. Discrete Math. 21 (2007), no. 1, 16-25 .
  97. Joe Sawada, Roy Li, Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms, Electr. J. Combinatorics, 19 (2012), #P43.
  98. Sawada, J.; Williams, A. Efficient oracles for generating binary bubble languages. Electron. J. Combin. 19 (2012), no. 1, Paper 42, 20 pp.
  99. J Sawada, A Williams, Successor rules for flipping pancakes and burnt pancakes, Preprint 2015;
  100. Joe Sawada, Dennis Wong, An Efficient Universal Cycle Construction for Weak Orders, University of Guelph, School of Computer Science (2019). Presented at the 30th Coast Combinatorics Conference. PDF (A000670) Also Sawada, Joe, and Dennis Wong. "Efficient universal cycle constructions for weak orders." Discrete Mathematics 343.10 (2020): 112022.
  101. Nitin Saxena, Simone Severini, Igor Shparlinski, Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics (2007), arXiv:quant-ph/0703236.
  102. Artur Schaefer, Endomorphisms of The Hamming Graph and Related Graphs, arXiv preprint arXiv:1602.02186, 2016
  103. W. O. Scheeren, The Hidden Web: A Sourcebook, Published by Libraries Unlimited, Santa Barbara, CA, 2012.
  104. 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.
  105. 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
  106. Trevor Scheopner, The Cyclic Nature (and Other Intriguing Properties) of Descriptive Numbers, Princeton Undergraduate Mathematics Journal, Issue 1, Article 4, 2015. (A005151, A006711)
  107. Markus Schepke, Über Primzahlerzeugende Folgen, Bachelor Thesis, U. Hannover, (2009)
  108. Robert Scherer, Congruences modulo primes of the Romik sequence related to the Taylor expansion of the Jacobi theta constant θ3, arXiv:1904.04509 [math.NT], 2019. See also The Ramanujan Journal (2020). doi:10.1007/s11139-019-00216-2 (A317651)
  109. Robert Scherer, A criterion for asymptotic sharpness in the enumeration of simply generated trees, arXiv:2003.07984 [math.CO], 2020. (A059710)
  110. 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)
  111. J. L. Schiffman, Exploring the Fibonacci sequence of order two with CAS technology,; no date.
  112. 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.
  113. Ernesto Schirmacher, Log-Concavity and the Exponential Formula, Journal of Combinatorial Theory, Series A, Volume 85, Issue 2, February 1999, Pages 127-134.
  114. Saul Schleimer, Bert Wiest, On the conjugacy problem in braid groups: Garside theory and subsurfaces, arXiv:1807.01500 [math.GT], 2018. (A080928)
  115. Saul Schleimer, Bert Wiest, Garside theory and subsurfaces: Some examples in braid groups, Groups Complexity Cryptology (2019) Vol. 11, Issue 2, 61-75. doi:10.1515/gcc-2019-2007
  116. E. Schlemm, On the expected number of successes in a sequence of nested Bernoulli trials, arXiv preprint arXiv:1303.4979, 2013
  117. 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
  118. S. Schlicker, L. Morales, D. Schultheis, polygonal chain sequences in the space of compact sets, JIS 12 (2009) 09.1.7.
  119. Michael J. Schlosser and Meesue Yoo, Elliptic Rook and File Numbers, Electronic Journal of Combinatorics, 24(1) (2017), #P1.31
  120. Natalie Schluter, The Taylor expansion for dropout is divergent, 2018. PDF (A019538)
  121. Natalie Schluter, On approximating dropout noise injection, arXiv:1905.11320 [cs.LG], 2019. (A019538)
  122. M. D. Schmidt, Generalized j-Factorial Functions, Polynomials, and Applications, J. Int. Seq. 13 (2010), 10.6.7.
  123. Maxie Schmidt, A computer algebra package for polynomial sequence recognition, MS Thesis, University of Illinois at Urbana-Champaign, 2014;
  124. Maxie D. Schmidt, Square Series Generating Function Transformations, arXiv preprint arXiv:1609.02803, 2016
  125. Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
  126. Maxie D. Schmidt, Factorization Theorems for Hadamard Products and Higher-Order Derivatives of Lambert Series Generating Functions, arXiv preprint arXiv:1712.00608, 2017.
  127. Maxie Dion Schmidt, A catalog of interesting and useful Lambert series identities, arXiv:2004.02976 [math.NT], 2020. (A133732)
  128. 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.
  129. Schmutz, Eric Period lengths for iterated functions. Combin. Probab. Comput. 20 (2011), no. 2, 289-298.
  130. Carsten Schneider, The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra, arXiv:2003.01921 [math.CO], 2020. (A001147) I highly appreciate “The On-Line Encyclopedia of Integer Sequences” (OEIS) … and supporting it by a donation of Doron Zeilberger gave an extrastrong motivation
  131. Robert Schneider, Andrew V. Sills, The Product of Parts or "Norm" of a Partition, Integers (2020) Vol. 20A, Article #A13. (A000792, A034893)
  132. K. Schöbel, An algebraic geometric approach to separation of variables, Habil. Thesis (2014) doi:10.1007/978-3-658-11408-4 Table 3.1
  133. K. Schöbel, A. P. Veselov, Separation coordinates, moduli spaces and Stasheff polytopes, Comm. Math. Phys. 337 (2014) 1255-1274 doi:10.1007/s00220-015-2332-x
  134. B. Schölkopf, Introduction to Machine Learning, 2011; PDF.
  135. Bernhard Schölkopf, Statistical and causal approaches to machine learning,, 2014 (see about 11 minutes into the talk).
  136. B. Schoenmakers, A tight lower bound for top-down skew heaps, Information Processing Letters, 61(5): 279-284, 14 March 1997.
  137. P. Schogt, The Wild Number Problem: math or fiction?, arXiv:1211.6583, 2012.
  138. Travis Scholl, Isogeny Graphs Over Composite Moduli, UCI Cryptographic Multilinear Map Learning Seminar, University of California Irvine, 2019. PDF (A001617)
  139. 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.
  140. W. Schreiner, Computability and Complexity, Lecture Notes, Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria;
  141. Joachim Schröder, "Generalized Schröder Numbers and the Rotation Principle", J. Integer Sequences, Volume 10, 2007, Article 07.7.7.
  142. Joachim Schröder, The two-parameter class of Schröder inversions, Comment. Math. Univ. Carolinae 54 (2013) 5-19.
  143. J. Z. Schroeder, Every Cubic Bipartite Graph has a Prime Labeling Except K_(3,3), Graphs and Combinatorics (2019) Vol. 35, No. 1, 119–140. doi:10.1007/s00373-018-1980-y (A133122)
  144. A. Schuetz and G. Whieldon, Polygonal Dissections and Reversions of Series, arXiv preprint arXiv:1401.7194, 2014
  145. J. L. Schulman, The quantifier semigroup for bipartite graphs, Electronic Journal of Combinatorics, 18 (2011), #P123.
  146. Maria Schuld, Kamil Brádler, Robert Israel, Daiqin Su, Brajesh Gupt, A quantum hardware-induced graph kernel based on Gaussian Boson Sampling, arXiv:1905.12646 [quant-ph], 2019. (A000070)
  147. A. Schulte, S. VanSchalkwyk, A. Yang, On the divisibility and valuations of the Franel numbers, in MSRI-UP Research Reports, 2014;
  148. Andrew J. Schultz and David A. Kofke, Fifth to eleventh virial coefficients of hard spheres, Phys. Rev. E 90, 023301, 4 August 2014
  149. Luís Fernando Schultz Xavier da Silveira, Turán Triangles, Cell Covers, Road Placement and Train Scheduling, Ph.D. thesis, University of Ottawa (Canada, 2020). PDF Using the results of these computer searches in the Online Encyclopedia of Integer Sequence [49], we discovered that this problem, when played on the square grid, is equivalent to several other known problems.
  150. P. R. F. Schumacher, A left weighted Catalan extension, Integers, 10 (2010), 771-792.
  151. P. R. F. Schumacher, Parking functions and generalized Catalan numbers, Dissertation, Texas A&M University (2009).
  152. Paul R. F. Schumacher, Descents in Parking Functions, Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.3. HTML (A001263)
  153. R. Schumacher, Rapidly Convergent Summation Formulas involving Stirling Series, arXiv preprint arXiv:1602.00336, 2016
  154. Raphael Schumacher, Extension of Summation Formulas involving Stirling series, arXiv preprint arXiv:1605.09204, 2016
  155. 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
  156. Raphael Schumacher, The self-counting identity, Fib. Quart., 55 (No. 2 2017), 157-167.
  157. R. Schumacher, How to sum the squares of the tetranacci numbers ..., Fib. Q., 57 (No. 2, 2019), 168-175.
  158. R. Schumacher, Explicit formulas for sums involving the squares of the first n Tribonacci numbers, Fib. Q., 58:3 (2020), 194-207.
  159. T. Schwabhäuser, Preventing Exceptions to Robin's Inequality, arXiv preprint arXiv:1308.3678, 2013
  160. Schwartz, Moshe; Etzion, Tuvi, Two-dimensional cluster-correcting codes. IEEE Trans. Inform. Theory 51 (2005), no. 6, 2121-2132.
  161. Sylviane R. Schwer, Temporal Reasoning without Transitive Tables (2007), arXiv:0706.1290.
  162. 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..."]
  163. Carlos Segovia, Counting words with vector spaces, 2013;
  164. C. Segovia, M. Winklmeier, Combinatorial Computations in Cobordism Categories, arXiv preprint arXiv:1409.2067, 2014
  165. Carlos Segovia and Monika Winklmeier, On the density of certain languages with p^2 letters, Electronic Journal of Combinatorics 22(3) (2015), #P3.16
  166. 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)
  167. Jaroslav Seibert and Pavel Trojovsky, "On Multiple Sums of Products of Lucas Numbers", J. Integer Sequences, Volume 10, 2007, Article 07.4.5.
  168. 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.
  169. Atsuto Seko, Atsushi Togo, Isao Tanaka, Group-theoretical high-order rotational invariants for structural representations: Application to linearized machine learning interatomic potential, arXiv:1901.02118 [physics.comp-ph], 2019. (A000012, A000027, A008619, A008620, A008669, A008743, A059841)
  170. 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)
  171. J. A. Sellers, Beyond Mere Convergence, PRIMUS (Problems, Resources and Issues in Mathematics Undergraduate Studies), XII, no. 2 (2002), 157-164.
  172. James A. Sellers, "Domino Tilings and Products of Fibonacci and Pell Numbers", J. Integer Sequences, Volume 5, 2002, Article 02.1.2.
  173. James A. Sellers, "Partitions Excluding Specific Polygonal Numbers As Parts", J. Integer Sequences, Volume 7, 2004, Article 04.2.4.
  174. Jessica Sendef, Arryn Robbins, How scientists use statistics, samples, and probability to answer research questions, Frontiers for Young Minds (2019) Vol. 07, Article 118. doi:10.3389/frym.2019.00118
  175. 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.
  176. Debajit Sensarma, Samar Sen Sarma, Role of Graphic Integer Sequence in the Determination of Graph Integrity, Mathematics (2019) 7(3), 261. doi:10.3390/math7030261
  177. Debajit Sensarma, Samar Sen Sarma, On the Determination of Graphic Integer Sequence from Graph Integrity, Proceedings of the 2nd International Conference on Communication, Devices and Computing, Lecture Notes in Electrical Engineering book series (LNEE, 2019) Vol. 602, 451-461. doi:10.1007/978-981-15-0829-5_44
  178. Paolo Sentinelli, Right-angled Coxeter groups, universal graphs, and Eulerian polynomials, European Journal of Combinatorics (2020) Vol. 24, Article 103040. doi:10.1016/j.ejc.2019.103040
  179. S. Seo and H. Shin, Another refinement for Rooted Trees, arXiv:1106.1290, 2011.
  180. M. R. Sepanski, On Divisibility of Convolutions of Central Binomial Coefficients, Electronic Journal of Combinatorics, 21 (1) 2014, #P1.32.
  181. 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)
  182. Seroussi, Gadiel, On universal types. IEEE Trans. Inform. Theory 52 (2006), no. 1, 171-189.
  183. Seunghyun Seo, The Catalan Threshold Arrangement, Journal of Integer Sequences, 2017 Vol. 20, #17.1.1.
  184. Seunghyun Seo and Heesung Shin, Two involutions on vertices of ordered trees,
  185. Simone Severini, Universal quantum computation with unlabeled qubits (2006), arXiv:quant-ph/0601078.
  186. Simone Severini, Nondiscriminatory Propagation on Trees (2008); arXiv:0805.0181
  187. Simone Severini and Ferenc Sz\"oll\H{o}si, A further look into combinatorial orthogonality (2007), arXiv:0709.3651.
  188. Yuriy Shablya, Dmitry Kruchinin, Vladimir Kruchinin, Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application, Mathematics (2020) Vol. 8, No. 6, 962. doi:10.3390/math8060962 (A000142, A007318, A033184, A173018, A316773)
  189. Sarah Shader, Weighted Catalan Numbers and Their Divisibility Properties, Research Science Institute, MIT, 2014;
  190. Shadrin, S.; Spitz, L.; Zvonkine, D.. On double Hurwitz numbers with completed cycles. J. Lond. Math. Soc., II. Ser. 86, No. 2, 407-432 (2012) doi:10.1112/jlms/jds010 arXiv:1103.3120
  191. Dylan Shah, Bilige Yang, Sam Kriegman, Michael Levin, Josh Bongard, and Rebecca Kramer‐Bottiglio, Shape Changing Robots: Bioinspiration, Simulation, and Physical Realization, Adv. Mater. 2020, 2002882. doi:10.1002/adma.202002882
  192. J. Shallit, An interesting continued fraction, Math. Mag. 48 (1975), no. 4, 207-211.
  193. J. Shallit, Rational Numbers with Non-Terminating, Non-Periodic Modified Engel-Type Expansions, Fibonacci Quarterly 31 (1993), 37-40.
  194. 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.
  195. J. Shallit, Remarks on inferring integer sequences.
  196. J. Shallit, Editing an Electronic Journal, Notices Amer. Math. Soc., 62 (2015), 169-171;
  197. J. Shallit, Tribonacci Facts, Nov 03 2017,
  198. Jeffrey Shallit, Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond, arXiv:2006.04177 [math.CO], 2020. (A000201, A001950)
  199. Jeffrey Shallit, Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture, arXiv:2010.10956 [cs.DM], 2020. (A095076)
  200. Jeffrey Shallit, Lukas Spiegelhofer, Continuants, run lengths, and Barry's modified Pascal triangle, arXiv:1710.06203 [math.CO], 2017. (A114212, A119326)
  201. Michael Ian Shamos, Shamos’s Catalog of the Real Numbers, 2011.
  202. A. G. Shannon, Some recurrence relations for binary sequence matrices, NNTDM 17 (2011), 4, 913;
  203. A. G. Shannon, A note on generalized Leonardo numbers, Notes on Number Theory and Discrete Mathematics (2019) Vol. 25, No. 3, 97–101. doi:10.7546/nntdm.2019.25.3.97-101
  204. A. G. Shannon, Applications of Mollie Horadam's generalized integers to Fermatian and Fibonacci numbers, Notes on Number Theory and Discrete Mathematics (2019) Vol. 25, No. 2, 113-126. doi:10.7546/nntdm.2019.25.2.113-126
  205. 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
  206. 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
  207. 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
  208. Shannon, Anthony G., and Richard L. Ollerton. "A note on Ledin’s summation problem." The Fibonacci Quarterly (2021).
  209. Yulin Shao, Soung Chang Liew, Taotao Wang, AlphaSeq: Sequence Discovery with Deep Reinforcement Learning, arXiv:1810.01218 [cs.LG], 2018. (A000040)
  210. 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.
  211. 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.
  212. 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.
  213. 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.
  214. 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
  215. L. W. Shapiro and C. J. Wang, Generating identities via 2 X 2 matrices, Congressus Numerantium, 205 (2010), 33-46.
  216. L. W. Shapiro, W.-J. Woan and S. Getu, Runs, slides and moments, SIAM J. Alg. Discrete Methods, 4 (1983), 459-466.
  217. Nathaniel Shar, Experimental methods in permutation patterns and bijective proof, PhD Dissertation, Mathematics Department, Rutgers University, May 2016;
  218. 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
  219. R. Sharafdini, T. Doslic, Hosoya index of splices, bridges and necklaces, 2015;
  220. Kirill S. Shardakov, Vladimir P. Bubnov, Stochastic Model of a High-Loaded Monitoring System of Data Transmission Network, Selected Papers of the Models and Methods of Information Systems, CEUR Workshop Proceedings, Research Workshop, (St. Petersburg, Russia, 2019), 29-34. PDF (A000332)
  221. R. Sharipov, Perfect cuboids and irreducible polynomials, Arxiv preprint arXiv:1108.5348, 2011
  222. R. Sharipov, A note on the first cuboid conjecture, Arxiv preprint arXiv:1109.2534, 2011
  223. R. Sharipov, A note on the second cuboid conjecture. Part I, Arxiv preprint arXiv:1201.1229, 2012
  224. Ruslan Sharipov, Perfect cuboids and multisymmetric polynomials, Arxiv preprint arXiv:1205.3135, 2012
  225. R. Sharipov, On an ideal of multisymmetric polynomials associated with perfect cuboids, arXiv:1206.6769, 2012
  226. R. Sharipov, On the equivalence of cuboid equations and their factor equations, arXiv:1207.2102, 2012
  227. R. Sharipov, A biquadratic Diophantine equation associated with perfect cuboids, Arxiv preprint arXiv:1207.4081, 2012
  228. R. Sharipov, On a pair of cubic equations associated with perfect cuboids, Arxiv preprint arXiv:1208.0308, 2012.
  229. R. Sharipov, On two elliptic curves associated with perfect cuboids, Arxiv preprint arXiv:1208.1227, 2012
  230. R. Sharipov, A note on solutions of the cuboid factor equations, Arxiv preprint arXiv:1209.0723, 2012
  231. R. Sharipov, A note on rational and elliptic curves associated with the cuboid factor equations, arXiv:1209.5706, 2012
  232. Ruslan Sharipov, Asymptotic estimates for roots of the cuboid characteristic equation in the linear region, preprint arXiv:1505.02745, 2015. (A031173, A031174, A031175)
  233. 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 )
  234. Ruslan Sharipov, A note on invertible quadratic transformations of the real plane, arXiv preprint arXiv:1507.01861, 2015.
  235. Anubhav Sharma, Generalizing higher order Fibonacci sequence using linear algebra, Haverford College (2020). PDF (A000045, A000073, A000078, A001591, A001592, A066178)
  236. 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)
  237. A. Sharov, R. M. Roth, New upper bounds for grain-correcting and grain-detecting codes, in Proc. Internat. Sympos. Information Theory (ISIT), 2014;
  238. Mark Shattuck, "Bijective Proofs of Parity Theorems for Partition Statistics", J. Integer Sequences, Volume 8, 2005, Article 05.1.5.
  239. Mark A. Shattuck, Tiling proofs of some formulas for the Pell numbers of odd index, Integers, 9 (2009), 53-64.
  240. Mark A. Shattuck, Proofs of some binomial identities using the method of least squares, Fib. Q., 48 (2010), 290-297.
  241. Mark Shattuck, Convolution identities for Stirling numbers of the first kind via involution, INTEGERS, 12, 2012, #A59.
  242. M. Shattuck, Combinatorial proofs of determinant formulas for the Fibonacci and Lucas polynomials, Fib. Q., 51 (2013), 63-71.
  243. M. Shattuck, On the zeros of some polynomials with combinatorial coefficients, Annales Mathematicae et Informaticae, 42 (2013) pp. 93-101,
  244. M. Shattuck, Combinatorial proofs of some Bell number formulas, arXiv preprint arXiv:1401.6588, 2014
  245. M. Shattuck, Combinatorial Proofs of Some Formulas for Triangular Tilings, Journal of Integer Sequences, 17 (2014), #14.5.5.
  246. M. Shattuck, Combinatorial identities for incomplete tribonacci polynomials, arXiv preprint arXiv:1406.2755, 2014.
  247. M. Shattuck, Generalized r-Lah numbers, arXiv preprint arXiv:1412.8721, 2014
  248. Mark Shattuck, Combinatorial proofs of some Stirling number formulas, Preprint (ResearchGate), 2014.
  249. 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.
  250. Mark Shattuck, Identities for Generalized Whitney and Stirling Numbers, Journal of Integer Sequences, 2017, Vol. 20, #17.10.4.
  251. Mark Shattuck, Some formulas for the restricted r-Lah numbers, Annales Mathematicae et Informaticae (2018) 49, Eszterházy Károly University Institute of Mathematics and Informatics, 123-140. doi:10.33039/ami.2018.11.001 (A008297)
  252. 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.
  253. 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.
  254. Mark A. Shattuck and Carl G. Wagner, "Some Generalized Fibonacci Polynomials", J. Integer Sequences, Volume 10, 2007, Article 07.5.3.
  255. Kennan Shelton and Michael Siler, Variations of a Coin-Removal Problem (2004), arXiv:math/0411052.
  256. Alexander Shelupanov, Oleg Evsyutin, Anton Konev, Evgeniy Kostyuchenko, Dmitry Kruchinin, Dmitry Nikiforov, Information Security Methods-Modern Research Directions, Symmetry (2019) Vol. 11, Issue 2, 150. doi:10.3390/sym11020150 (A001333)
  257. Zhizhang Shen, Ke Qiu and Eddie Cheng, On the surface area of the (n,k)-star graph, Theoretical Computer Science, 2009.
  258. Rick L. Shepherd, Binary quadratic forms and genus theory, Master of Arts Thesis, University of North Carolina at Greensboro, 2013;
  259. Nicholas I. Shepherd-Barron, Asymptotic period relations for Jacobian elliptic surfaces, arXiv:1904.13344 [math.AG], 2019. (A000602)
  260. Michael A. Sherbon, "Fundamental Nature of the Fine-Structure Constant," International Journal of Physical Research, 3, 2 (1): 1-9 (2014).
  261. Michael A. Sherbon, "Fundamental Physics and the Fine-Structure Constant," International Journal of Physical Research, 5 (2): 46-48 (2017).
  262. 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
  263. Vladimir Shevelev, A Conjecture on Primes and a Step towards Justification (2007), arXiv:0706.0786.
  264. Vladimir Shevelev, On the Basis Polynomials in the Theory of Permutations with Prescribed Up-Down Structure, arXiv:math.CO/0801.0072
  265. 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
  266. Vladimir Shevelev, On Unique Additive Representations of Positive Integers and Some Close Problems (2008); arXiv:0811.0290
  267. Vladimir Shevelev, Process of "Primoverization" of Numbers of the Form a^n-1 (2008); arXiv:0807.2332
  268. Vladimir Shevelev, An Upper Estimate for the Overpseudoprime Counting Function (2008); arXiv:0807.1975
  269. Vladimir Shevelev, Overpseudoprimes, Mersenne Numbers and Wieferich primes (2008); arXiv:0806.3412
  270. Vladimir Shevelev, doi:10.4064/aa136-1-7, Exact exponent in the remainder terms fo Gelfond's digit theorem in the binary case, Acta Arith. 136 (2009) 91-100
  271. Vladimir Shevelev, Binary Additive Problems: Theorems of Landau and Hardy-Littlwood Type (2009) arXiv:0902.1046
  272. Vladimir Shevelev, Binary Additive Problems: Recursions for Numbers of Representations (2009) arXiv:0901.3102
  273. Vladimir Shevelev, On critical small intervals containing primes, arXiv:0908.2319 [math.NT]
  274. Vladimir Shevelev, The menage problem with a known mathematician, arXiv:1101.5321 [math.CO]
  275. Vladimir Shevelev, SPECTRUM OF PERMANENTS VALUES AND ITS EXTREMAL MAGNITUDES ..., Arxiv preprint arXiv:1104.4051, 2011.
  276. V. Shevelev, Combinatorial minors of matrix functions and their applications, Arxiv preprint arXiv:1105.3154, 2011
  277. Shevelev, Vladimir Binomial coefficient predictors. J. Integer Seq. 14 (2011), no. 2, Article 11.2.8, 8 pp.
  278. Vladimir Shevelev, Ramanujan and Labos Primes, Their Generalizations, and Classications of Primes, J. Integer Sequences, 15 (2012), #12.1.1.
  279. V. Shevelev, On Stephans conjectures concerning Pascla triangle modulo 2 and their polynomial generalization, arXiv:1011.6083 and [ J. Algebr, Number Theory 7 (1) (2012) 11-29.
  280. Vladimir Shevelev, The number of permutations with prescribed up-down structure as a function of two variables, INTEGERS, 12 (2012), #A1.
  281. Vladimir Shevelev, Representation of positive integers by the form x1...xk + x1 + ... + xk, arXiv:1508.03970, 2015
  282. Vladimir Shevelev, Representation of positive integers by the form x^3+y^3+z^3-3xyz, arXiv:1508.05748, 2015
  283. V. Shevelev, Exponentially S-numbers, preprint arXiv:1510.05914, 2015
  284. V. Shevelev, Set of all densities of exponentially S-numbers, arXiv preprint arXiv:1511.03860, 2015
  285. V Shevelev, A fast computation of density of exponentially S-numbers, arXiv preprint arXiv:1602.04244, 2016
  286. V Shevelev, Two analogs of Thue-Morse sequence, arXiv preprint arXiv:1603.04434, 2016
  287. Vladimir Shevelev, On Erdos's constant, arXiv preprint arXiv:1605.08884, 2016
  288. Vladimir Shevelev, S-exponential numbers, ACTA ARITHMETICA Online First version, 2016; doi:10.4064/aa8395-5-2016
  289. Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], June 2017.
  290. Vladimir Shevelev, On a Luschny question, arXiv:1708.08096, August 2017.
  291. 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
  292. 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.
  293. VLADIMIR SHEVELEV AND PETER J. C. MOSES, On a sequence of polynomials with hypothetically integer coefficients, arXiv:1112.5715, 2011; INTEGERS, 13 (2013), #A9.
  294. VLADIMIR SHEVELEV AND PETER J. C. MOSES, Tangent power sums and their applications, Arxiv preprint arXiv:1207.0404, 2012
  295. V. Shevelev and P. J. C. Moses, A family of digit functions with large periods, arXiv:1209.5705, 2012
  296. Vladimir Shevelev and PJC Moses, ALICE AND BOB GO TO DINNER: A VARIATION ON MENAGE, INTEGERS, 2016, Vol. 16, #A72.
  297. Jessica Shi, Enumeration of unlabeled graph classes: A study of tree decompositions and related approaches, 2015, PDF
  298. Minjia Shi, Patrick Solé, The largest number of weights in cyclic codes, arXiv:1807.08418 [cs.IT], 2018. (A082116)
  299. 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)
  300. Minjia Shi, Zhongyi Zhang, Patrick Solé, Pisano period codes, arXiv:1709.04582 [cs.IT], 2017.
  301. Zheng Shi, Impurity entropy of junctions of multiple quantum wires, arXiv preprint arXiv:1602.00068, 2016
  302. Zheng Shi, I Affleck, A fermionic approach to tunneling through junctions of multiple quantum wires, arXiv preprint arXiv:1601.00510, 2016.
  303. Genki Shibukawa, New identities for some symmetric polynomials and their applications, arXiv:1907.00334 [math.CA], 2019. (A006053, A094649, A096975, A188021, A189234, A231181)
  304. Heesung Shin, Jiang Zeng, More bijections for Entringer and Arnold families, arXiv:2006.00507 [math.CO], 2020. (A000111)
  305. Kohei Shinohara, Atsuto Seko, Takashi Horiyama, Masakazu Ishihata, Junya Honda, Isao Tanaka, Enumeration of nonequivalent substitutional structures using advanced data structure of binary decision diagram, J. Chem. Phys. 153, 104109 (2020), doi:10.1063/5.0021663; see also the preprint under the title Derivative structure enumeration using binary decision diagram, arXiv:2002.12603 [physics.comp-ph], 2020. (A007764, A159842, A300783)
  306. S. A. Shirali, Case Studies in Experimental Mathematics, 2013; PDF
  307. Grzegorz Siudem, Agata Fronczak, Bell polynomials in the series expansions of the Ising model, arXiv:2007.16132 [math-ph], 2020. (A000262, A002890, A002894, A002898, A002893, A260784) The OEIS (Online Encyclopedia of Integer Sequences) has an invaluable impact on our work and because of that fact, we present below the table which gathers the most important sequences occur in the paper with their OEIS numbers.
  308. Ilya Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Electronic Notes in Discrete Mathematics, Volume 9, June 2001, Pages 19-35.
  309. I. Shlyakhter, Generating effective symmetry-breaking predicates for search problems, Discrete Appl. Math. 155 (2007), no. 12, 1539-1548.
  310. 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)
  311. Z. Shomanov, Combinatorial formula for the partition function, arXiv:1508.03173 (2015)
  312. Taylor Short, The saturation number of carbon nanocones and nanotubes, arXiv:1807.11355 [math.CO], 2018. (A032765)
  313. Igor E. Shparlinski, "On the Sum of Iterations of the Euler Function", J. Integer Sequences, Volume 9, 2006, Article 06.1.6.
  314. 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.
  315. I. Shpitser, T. S. Richardson, J. M. Robins and R. Evans, Parameter and Structure Learning in Nested Markov Models, arXiv:1207.5058, 2012
  316. 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;
  317. Punit Shrivastava, Identities of Jacobsthal numbers using area of triangle, Alochana Chakra Journal (2020) Vol. IX, Issue V, 7070-7074. PDF (A001045, A014551)
  318. D. Shtefan and I. Dobrovolska, The sums of the consecutive Fibonacci numbers, Fib. Q., 56 (2018), 229-236.
  319. Walter Shur, "Two Game-Set Inequalities", J. Integer Sequences, Volume 6, 2003, Article 03.4.1.
  320. Anton Shutov, Andrey Maleev, Coordination sequences and layer-by-layer growth of periodic structures, Zeitschrift für Kristallographie - Crystalline Materials (2018). doi:10.1515/zkri-2018-2144
  321. Anton Shutov, Andrey Maleev, Coordination sequences of 2-uniform graphs, Zeitschrift für Kristallographie - Crystalline Materials (2020) Vol. 235: Issue 4-5, 157–166. doi:10.1515/zkri-2020-0002
  322. SIAM News, March 1999, 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). ..."]
  323. Irfan Siap and I. Aydoglu, Counting the generator matrices of Z_2 Z_8 codes, arXiv:1303.6985
  324. Sahar Siavashi, On the solutions of certain congruences, Master's Thesis, Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, 2017.
  325. Muhammad Khubab Siddique, Sequence and Series-I, Unit 8, Mathematics-II, Dept. of Sci. Ed., Allama Iqbal Open Univ. (Islamabad, Pakistan, 2020), 281-313. HTML (A005132)
  326. 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.
  327. Aaron N. Siegel, Mis\`ere canonical forms of partizan games (2007), arXiv:math/0703565.
  328. J. A. Siehler, The Finite Lamplighter Groups: A Guided Tour, College Mathematics Journal, Vol. 43, No. 3 (May 2012), pp. 203-211
  329. F. Sievers, G. M. Hughes, D. G. Higgins, Systematic Exploration of Guide-Tree Topology Effects for Small Protein Alignments, BMC Bioinformatics 2014, 15:338;
  330. Markus Sigg, On a conjecture of John Hoffman regarding sums of palindromic numbers, arXiv preprint arXiv:1510.07507, 2015
  331. Markus Sigg, Gasper's determinant theorem, revisited, arXiv:1804.02897 [math.CO], 2018. (A085000, A301370, A301371)
  332. John K. Sikora, On the High Water Mark Convergents of Champernowne's Constant in Base Ten, arXiv:1210.1263, 2012
  333. J. K. Sikora, Analysis of the High Water Mark Convergents of Champernowne's Constant in Various Bases, arXiv preprint arXiv:1408.0261, 2014
  334. 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)
  335. Jean-Louis Sikorav, Best rational approximations of an irrational number, arXiv:1807.06284 [math.NT], 2018. (A063674)
  336. Joshua M. Siktar, General identities for Horadam sequences, (2020). ">General identities for Horadam sequences Abstract
  337. 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)
  338. Andrew V. Sills, Integer Partitions Probability Distributions, arXiv:1912.05306 [math.CO], 2019. (A322384)
  339. 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.
  340. Andrew V. Sills, Robert Schneider, The product of parts or "norm" of a partition, arXiv:1904.08004 [math.NT], 2019. Also in Integers (2020) Vol. 20A, Article #A13. (A000792, A034893) PDF but instead under Schneider.
  341. Clayton Cristiano Silva, Irreducible Numerical Semigroups, University of Campinas, São Paulo, Brazil (2019). PDF (A058129, A124506, A158206, A158278, A158279)
  342. Jannik Silvanus, Improved Cardinality Bounds for Rectangle Packing Representations, Doctoral Dissertation, University of Bonn (Rheinische Friedrich Wilhelms Universität, Germany 2019). PDF (A001181, A117106, A214358)
  343. 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."]
  344. Tim Silverman, Counting Cliques in Finite Distant Graphs, arXiv preprint arXiv:1612.08085, 2016
  345. J. R. Silvester, Factorial Factors, Maths. Gazette 88 (2004) 119-123.
  346. 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.
  347. 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.
  348. Jamie Simpson, Modified Padovan words and the maximum number of runs in a word, Australasian J. Combinat. xx (2009).
  349. Joseph J. Simpson, Mary J. Simpson, Technical Report, SC-TR-00031 Ontology as a System, System Concepts LLC (2019). doi:10.13140/RG.2.2.19493.45281
  350. T. Simpson, Permutations with unique fixed and reflected points. Ars Combin. 39 (1995), 97-108.
  351. A. K. Singh, A. Das and A. Kumar, RAPIDITAS: RAPId Design-space-exploration Incorporating Trace-based Analysis and Simulation, 2013;
  352. 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,
  353. 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.
  354. Singh, Jitender, On an Arithmetic Convolution, J. Int. Seq. 17 (2014) # 14.6.7.
  355. Satvik Singh, Can entanglement hide behind triangle-free graphs?, arXiv:2010.11891 [quant-ph], 2020. (A000055, A024607)
  356. 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.
  357. D. Singmaster, Triangles with integer sides and sharing barrels, College Math. J. 21 (1990) 278-285.
  358. 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
  359. 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)
  360. 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
  361. 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
  362. Aditya Sivakumar, Dmitri Tymoczko, Intuitive Musical Homotopy, 2018. PDF (A005893)
  363. R. Sivaraman, Generalized Narayana sequences and quadratic sequences, Advances in Mathematics: Scientific Journal (2020), Vol. 9, No.7, 5143–5149. doi:10.37418/amsj.9.7.81
  364. R. Sivaraman, Generalized Narayana sequences and figurate numbers, Advances in Mathematics: Scientific Journal (2020) Vol. 9, No. 10, 7977–7984. doi:10.37418/amsj.9.10.32 (A001263)
  365. S. Sivasubramanian, Signed Excedance Enumeration in the Hyperoctahedral group, El. J. Combinat. 21 (2) (2014) # P2.10
  366. 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.
  367. Jonas Sjostrand, Bruhat intervals as rooks on skew Ferrers boards (2006), arXiv:math/0601615.
  368. Matthew Skala, Graph Nimors, arXiv preprint arXiv:1604.04072, 2016
  369. M. B. Skopenkov, A. A. Pakharev, A. V. Ustinov, Through the resistors network, Mat. Pros. Ser. 3, issue 18, 2014 (33–65) [in Russian].
  370. 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.
  371. 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.