{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:33:06Z","timestamp":1649007186296},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,5,1]],"date-time":"1978-05-01T00:00:00Z","timestamp":262828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12861,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1978,5]]},"DOI":"10.1016\/0097-3165(78)90064-x","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T11:09:06Z","timestamp":1096974546000},"page":"348-356","source":"Crossref","is-referenced-by-count":0,"title":["The extended Simon Newcomb Problem"],"prefix":"10.1016","volume":"24","author":[{"given":"F.B","family":"Drane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.P","family":"Roselle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(78)90064-X_BIB1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1215\/S0012-7094-72-03932-4","article-title":"Enumeration of sequences by rises, and falls: A refinement of the Simon Newcomb problem","volume":"39","author":"Carlitz","year":"1972","journal-title":"Duke Math. J."},{"key":"10.1016\/0097-3165(78)90064-X_BIB2","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1215\/S0012-7094-73-04066-0","article-title":"Enumeration of permutations and sequences with restrictions","volume":"40","author":"Carlitz","year":"1973","journal-title":"Duke Math. J."},{"key":"10.1016\/0097-3165(78)90064-X_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(74)90061-2","article-title":"Enumeration of sequences of given specification according to rises, falls, and maxima","volume":"8","author":"Carlitz","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(78)90064-X_BIB4","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1137\/0117099","article-title":"Simon Newcomb's problem","volume":"17","author":"Dillon","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0097-3165(78)90064-X_BIB5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0097-3165(75)90068-0","article-title":"On Eulerian circuits and words with prescribed adjacency patterns","volume":"18","author":"Hutchinson","year":"1975","journal-title":"J. Combinatorial Theory A"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657890064X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657890064X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:30:21Z","timestamp":1549161021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731657890064X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,5]]}},"alternative-id":["009731657890064X"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(78)90064-x","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1978,5]]}}}