{"data":{"status":"IDENTIFIED","input":{"kind":"terms","termsSource":"caller","terms":["1","1","2","5","14","42","132","429","1430","4862"]},"candidates":[{"rank":1,"aNumber":"A000108","url":"https://oeis.org/A000108","name":"Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!).","evidence":"terms","transform":null,"relation":"The terms are found in A000108","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["core","nonn","easy","eigen","nice","changed"],"formulas":["a(n) = binomial(2*n, n)/(n+1) = (2*n)!/(n!*(n+1)!) = A000984(n)/(n+1).","Recurrence: a(n) = 2*(2*n-1)*a(n-1)/(n+1) with a(0) = 1.","Recurrence: a(n) = Sum_{k=0..n-1} a(k)a(n-1-k).","G.f.: A(x) = (1 - sqrt(1 - 4*x)) / (2*x), and satisfies A(x) = 1 + x*A(x)^2."],"references":["The large number of references and links demonstrates the ubiquity of the Catalan numbers.","R. Alter, Some remarks and results on Catalan numbers, pp. 109-132 in Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computer Science. Vol. 2, edited R. C. Mullin et al., 1971.","Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, many references."],"referenceCount":107,"step":0},{"rank":2,"aNumber":"A120588","url":"https://oeis.org/A120588","name":"G.f. is 1 + x*c(x), where c(x) is the g.f. of the Catalan numbers (A000108).","evidence":"terms","transform":null,"relation":"The terms are found in A120588","oeisOffset":0,"alignment":{"shift":1,"firstIndex":1},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn","easy"],"formulas":["G.f.: A(x) = 1 + Series_Reversion(1+3*x - (1+x)^2).","Lagrange Inversion yields g.f.: A(x) = Sum_{n>=0} C(2*n,n)/(n+1)*(2+x)^(n+1)/3^(2*n+1).","G.f.: (3 - sqrt(1-4*x))/2. - Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009","a(n) = Sum_{k=1..n-1} a(k) * a(n-k) if n>1. - _Michael Somos_, Jul 23 2011"],"references":[],"referenceCount":0,"step":0},{"rank":3,"aNumber":"A211216","url":"https://oeis.org/A211216","name":"Expansion of (1-8*x+21*x^2-20*x^3+5*x^4)/(1-9*x+28*x^2-35*x^3+15*x^4-x^5).","evidence":"terms","transform":null,"relation":"The terms are found in A211216","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn","easy"],"formulas":["G.f.: (1-3*x+x^2)*(1-5*x+5*x^2)/(1-9*x+28*x^2-35*x^3+15*x^4-x^5).","G.f.: 1/(1-x/(1-x/(1-x/(1-x/(1-x/(1-x/(1-x/(1-x/(1-x))))))))). - _Philippe Deléham_, Mar 14 2013","a(n) = A000108(n) + Sum_{k=1..n} (4*binomial(2*n, n+11*k) - binomial(2*n+2, n+11*k+1)). - _Greg Dresden_, Jan 28 2023"],"references":[],"referenceCount":0,"step":0},{"rank":4,"aNumber":"A242450","url":"https://oeis.org/A242450","name":"Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UUDDUDUUUUDUDDDDUUDD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-2)/8)), read by rows.","evidence":"terms","transform":null,"relation":"The terms are found in A242450","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn","tabf"],"formulas":[],"references":[],"referenceCount":0,"step":0},{"rank":5,"aNumber":"A243838","url":"https://oeis.org/A243838","name":"Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUDDUUUUDUDDDDUDUD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/9)), read by rows.","evidence":"terms","transform":null,"relation":"The terms are found in A243838","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn","tabf"],"formulas":[],"references":[],"referenceCount":0,"step":0},{"rank":6,"aNumber":"A261592","url":"https://oeis.org/A261592","name":"9-Modular Catalan Numbers C_{n,9}.","evidence":"terms","transform":null,"relation":"The terms are found in A261592","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn"],"formulas":["sum( 1<=l<=n, (l/n)sum( m_1+...+m_k=n and m_2+2m_3+...+(k-1)m_k=n-l , MC(n;m_1,...,m_k) ) ), where MC(n;m_1,...,m_k) is the multinomial coefficient associated to the multiset (m_1,...,m_k).","G.f.: 1/(1-x*G(x)) where G(x) is g.f. of A291823. - _Andrew Howroyd_, Nov 29 2017"],"references":[],"referenceCount":0,"step":0},{"rank":7,"aNumber":"A287973","url":"https://oeis.org/A287973","name":"Number of Dyck paths of semilength n such that no level has more than nine peaks.","evidence":"terms","transform":null,"relation":"The terms are found in A287973","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn"],"formulas":["a(n) = A287847(n,9).","a(n) = A000108(n) for n <= 9."],"references":[],"referenceCount":0,"step":0},{"rank":8,"aNumber":"A287974","url":"https://oeis.org/A287974","name":"Number of Dyck paths of semilength n such that no level has more than ten peaks.","evidence":"terms","transform":null,"relation":"The terms are found in A287974","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn"],"formulas":["a(n) = A287847(n,10).","a(n) = A000108(n) for n <= 10."],"references":[],"referenceCount":0,"step":0},{"rank":9,"aNumber":"A291824","url":"https://oeis.org/A291824","name":"Number of ordered rooted trees with n non-root nodes and all outdegrees <= nine.","evidence":"terms","transform":null,"relation":"The terms are found in A291824","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn"],"formulas":["G.f.: G(x)/x where G(x) is the reversion of x*(1-x)/(1-x^10). - _Andrew Howroyd_, Dec 01 2017","G.f. A(x) satisfies: A(x) = 1 + Sum_{k=1..9} x^k*A(x)^k. - _Ilya Gutkovskiy_, May 03 2019"],"references":[],"referenceCount":0,"step":0},{"rank":10,"aNumber":"A291825","url":"https://oeis.org/A291825","name":"Number of ordered rooted trees with n non-root nodes and all outdegrees <= ten.","evidence":"terms","transform":null,"relation":"The terms are found in A291825","oeisOffset":0,"alignment":{"shift":0,"firstIndex":0},"comparedLength":10,"matched":10,"matchedIndices":[0,1,2,3,4,5,6,7,8,9],"mismatched":[],"unverifiedTerms":0,"exact":true,"keywords":["nonn"],"formulas":["G.f.: G(x)/x where G(x) is the reversion of x*(1-x)/(1-x^11). - _Andrew Howroyd_, Dec 01 2017","G.f. A(x) satisfies: A(x) = 1 + Sum_{k=1..10} x^k*A(x)^k. - _Ilya Gutkovskiy_, May 03 2019"],"references":[],"referenceCount":0,"step":0}],"explanation":{"source":"oeis-name","aNumber":"A000108","text":"Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!)."},"recurrence":{"found":false,"reason":"no constant-coefficient linear recurrence of order <= 4 predicts the held-out terms"},"polynomial":{"found":false,"reason":"finite differences do not vanish with 2 terms held out"},"search":{"budget":8,"used":1,"queries":[{"step":"direct","query":"1,1,2,5,14,42,132,429,1430,4862","url":"https://oeis.org/search?q=1%2C1%2C2%2C5%2C14%2C42%2C132%2C429%2C1430%2C4862&fmt=json","results":10}],"skipped":[],"notApplicable":[],"failures":[]},"llmCalls":0,"llmFailures":0,"decidedBy":{"terms":"caller","candidates":"code","explanation":"oeis-text"},"attribution":{"source":"The On-Line Encyclopedia of Integer Sequences (OEIS)","url":"https://oeis.org","license":"CC BY-SA 4.0","licenseUrl":"https://creativecommons.org/licenses/by-sa/4.0/","notice":"OEIS entry names, formulas, references and data are from the OEIS (https://oeis.org), copyright The OEIS Foundation Inc., licensed under CC BY-SA 4.0. Attribute the OEIS and the A-number when reusing them; derivative text must be shared under the same license."},"notes":[]},"_provenance":{"version":"writerslogic-provenance/1","issuer":"did:web:agents.writerslogic.com","verify":{"endpoint":"POST /api/v1/verify-provenance","did":"did:web:agents.writerslogic.com"},"manifest":{"format":"application/json","instance_id":"xmp:iid:74696186-3cbc-43e1-82e1-e11af5a167dc","claim_generator_info":[{"name":"WritersLogic x402 Agent Hub","version":"2.0.0"}],"title":"Integer Sequence Identifier","assertions":[{"label":"c2pa.actions.v2","data":{"actions":[{"action":"c2pa.created","when":"2026-11-04T20:20:12.671Z","softwareAgent":{"name":"writerslogic-agent-hub/sequence-identifier","version":"2.0.0"},"digitalSourceType":"http://cv.iptc.org/newscodes/digitalsourcetype/trainedAlgorithmicMedia","parameters":{"endpoint":"POST /api/v1/identify-sequence","inputDigest":{"alg":"sha256","hash":"32b283edb1cdffdaf571dd3ce78997f0b755e7a2bf2c31bebcd1ef08e605eea0","canonicalization":"JCS"}}}]}},{"label":"c2pa.hash.data","data":{"alg":"sha256","hash":"cee964192c0b6401085f2cf1d5950c61f6be35fb68fbf6706940fb3df8574060","name":"jcs-canonical-json(data)"}},{"label":"c2pa.ingredient.v3","data":{"title":"https://oeis.org/search?q=1%2C1%2C2%2C5%2C14%2C42%2C132%2C429%2C1430%2C4862&fmt=json","format":"application/json","relationship":"inputTo","dc":{"source":"https://oeis.org/search?q=1%2C1%2C2%2C5%2C14%2C42%2C132%2C429%2C1430%2C4862&fmt=json","date":"2026-11-04T20:20:12.671Z"},"hash":{"alg":"sha256","hash":"277fb2d88ade145fb72a1d971ea9f333c14ff864a18c5015b9ac922d25065dbe","basis":"body"}}}]},"credential":{"@context":["https://www.w3.org/ns/credentials/v2"],"id":"urn:uuid:0f240784-d34e-490f-8a02-1eacc1bdf4f4","type":["VerifiableCredential","AgentOutputCredential"],"issuer":"did:web:agents.writerslogic.com","validFrom":"2026-11-04T20:20:12.671Z","credentialSubject":{"id":"urn:sha256:cee964192c0b6401085f2cf1d5950c61f6be35fb68fbf6706940fb3df8574060","agent":"sequence-identifier","endpoint":"POST /api/v1/identify-sequence","outputDigest":{"alg":"sha256","value":"cee964192c0b6401085f2cf1d5950c61f6be35fb68fbf6706940fb3df8574060","canonicalization":"JCS"},"inputDigest":{"alg":"sha256","value":"32b283edb1cdffdaf571dd3ce78997f0b755e7a2bf2c31bebcd1ef08e605eea0","canonicalization":"JCS"},"manifestDigest":{"alg":"sha256","value":"3aa70d427f47d7d9903fa0b9f316b5164dce48d814fa41e92399351ad56babfa","canonicalization":"JCS"},"ingredients":[{"url":"https://oeis.org/search?q=1%2C1%2C2%2C5%2C14%2C42%2C132%2C429%2C1430%2C4862&fmt=json","sha256":"277fb2d88ade145fb72a1d971ea9f333c14ff864a18c5015b9ac922d25065dbe"}],"payment":{"scheme":"api-key","network":"eip155:8453","payer":"sample"}},"proof":{"type":"DataIntegrityProof","cryptosuite":"eddsa-jcs-2022","created":"2026-11-04T20:20:12.671Z","verificationMethod":"did:web:agents.writerslogic.com#key-1","proofPurpose":"assertionMethod","proofValue":"z51ReYWhG4v9MHuzQhwMbYhnWpNgKbpXCe9LeViFCZXP21DD8tN8rPGb1a5pzimrFAR4d9XNr2JrpWVJaKh31t8Hr"}},"ethSignature":{"type":"EIP-191","signer":"did:pkh:eip155:8453:0x3DBd42560cA7a7E448A2c7DfC9E785526189411f","address":"0x3DBd42560cA7a7E448A2c7DfC9E785526189411f","message":"writerslogic-provenance:0841f88c473d185bf5eb54a8aa2b7b49d8478f2f74986cf58ea6b7bb037ef94e","signature":"0xa5c50ddef55b03ad5a0acf8f025a34ac12cf715a022007e59686ce5eb197e8066a79134bdd8e396d6fb57374381503f947d28ee228fb1c0c3831efa25acfa4c11b"}}}