<jupyter_start><jupyter_text>FibonacciRecursively generate terms from the Fibonacci sequence.<jupyter_code>def fibonacci(term: int) -> int:
    """
    0-indexed fibonacci
    """
    assert 0 <= term
    if 1 < term:
        return fibonacci(term - 1) + fibonacci(term - 2)
    else:
        return term<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.10778443113772455, 'fraction_numerical': 0.014970059880239521, 'mean_word_length': 3.240506329113924, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 6, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '156251', 'license': 'MIT', 'n_tokens_mistral': 124, 'n_tokens_neox': 118, 'n_words': 26, 'path': 'tests/fixtures/fibonacci.ipynb', 'repo_name': 'xbrianh/callysto', 'size': '334'}