{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:50:36Z","timestamp":1767851436305,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0893-9659(01)00135-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:49:49Z","timestamp":1034272189000},"page":"305-308","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":41,"title":["The recursive sequence x+1 = g(x, x\u22121)\/(A + x)"],"prefix":"10.1016","volume":"15","author":[{"given":"S.","family":"Stevo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(01)00135-5_BIB1","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1006\/jmaa.1999.6346","article-title":"On the recursive sequence yn+1 = \u03b1 + (yn\u22121)\/yn","volume":"233","author":"Amleh","year":"1999","journal-title":"J. Math. Anal. Appl."},{"issue":"11","key":"10.1016\/S0893-9659(01)00135-5_BIB2","doi-asserted-by":"crossref","first-page":"3257","DOI":"10.1090\/S0002-9939-98-04626-7","article-title":"On the recursive sequence xn+1 = A\/xn + 1\/(xn\u22122)","volume":"126","author":"DeVault","year":"1998","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0893-9659(01)00135-5_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jmaa.2000.6747","article-title":"A global convergence result with applications to periodic solutions","volume":"245","author":"El-Metwally","year":"2000","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0893-9659(01)00135-5_BIB4","first-page":"1","article-title":"On the recursive sequence yn+1 = (p + yn\u22121)\/(q + yn)","volume":"4","author":"Gibbons","year":"2000","journal-title":"Math. Sci. Res. Hot-Line"},{"key":"10.1016\/S0893-9659(01)00135-5_BIB5","article-title":"On the dynamics of xn+1 = (\u03b1 + \u03b2xn\u22121 + \u03b3xn\u22121)\/(A + Bxn)","author":"Gibbons","year":"2000"},{"issue":"5","key":"10.1016\/S0893-9659(01)00135-5_BIB6","first-page":"1","article-title":"On the recursive sequence yn+1 = (\u03b1yn + \u03b2yn\u22121)\/(\u03b3yn + Cyn\u22121)","volume":"2","author":"Kulenovi\u0107","year":"1998","journal-title":"Math. Sci. Res. Hot-Line"},{"key":"10.1016\/S0893-9659(01)00135-5_BIB7","unstructured":"S. Stevo, A generalization of the Copson's theorem concerning sequences which satisfy linear inequality, Indian J. Math. (to appear)."},{"issue":"2","key":"10.1016\/S0893-9659(01)00135-5_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1080\/10236199908808181","article-title":"Open problems and conjectures","volume":"5","author":"Ladas","year":"1999","journal-title":"J. Differ. Equations Appl."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001355?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001355?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:03:17Z","timestamp":1760238197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965901001355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0893965901001355"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(01)00135-5","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The recursive sequence xn+1 = g(xn, xn\u22121)\/(A + xn)","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(01)00135-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}