+ i.^RIHtRtRtR#)wrapscaVoV3RlpV#)a Memo decorator for sequences defined by recurrence Examples ======== >>> from sympy.utilities.memoization import recurrence_memo >>> @recurrence_memo([1]) # 0! = 1 ... def factorial(n, prev): ... return n * prev[-1] >>> factorial(4) 24 >>> factorial(3) # use cache values 6 >>> factorial.cache_length() # cache length can be obtained 5 >>> factorial.fetch_item(slice(2, 4)) [2, 6] c`<a\S4VV3Rl4pV3RlVnV3RlVnV#)c<\S4pW8d SV,#\W^,4FpSPS!VS44K SR,#)lenrangeappend)nLicachefs& {/Users/tonyclaw/.openclaw/workspace/skills/math-calculator/venv/lib/python3.14/site-packages/sympy/utilities/memoization.pyg-recurrence_memo..decorator..gsHE AuQx1!e_ Qq%[)%9 c<\S4#N)r )rsr4recurrence_memo..decorator..$s Urc<SV,#r)xrs&rrr%s qr)r cache_length fetch_item)rrrsf r decorator"recurrence_memo..decorators. q   ,) rr)initialr rs& @rrecurrence_memor#s* E  rcaa.oVV3RlpV#)z Memo decorator for associated sequences defined by recurrence starting from base base_seq(n) -- callable to get base sequence elements XXX works only for Pn0 = base_seq(0) cases XXX works only for m <= n cases c6<a\S4VVV3Rl4pV#)c8<\S 4pW8dS V,V,#\W ^,4FSpS!V4pV.pS PV4\^V^,4FpS !W6S 4pVPV4K KU S V,V,#)rr ) rmrrF_i0 F_i_cachejF_ijbase_seqrrs && rr3assoc_recurrence_memo..decorator..g7sE AuQx{"1!e_{!F  Y'q!a%AQ5>D$$T*)%8A; rr)rrr,rsf rr (assoc_recurrence_memo..decorator6s q   &rr)r,r rsf @rassoc_recurrence_memor/*s E, rN) functoolsrr#r/rrrr1s#L"r