(WIP) Esoteric Mathematic Library for TypeScript
-
Updated
Oct 27, 2024
(WIP) Esoteric Mathematic Library for TypeScript
Lucas Sequence L is a sequence of numbers such that L(n) = L(n-1) + L(n-2)
The LucasNumbers program is designed to generate the first 30 numbers in the Lucas Numbers sequence using recursion.
Miscellaneous scripts and modules implemented in Python
🐍 Python playground for a blog post
Fast Fibonacci
Add a description, image, and links to the lucas-numbers topic page so that developers can more easily learn about it.
To associate your repository with the lucas-numbers topic, visit your repo's landing page and select "manage topics."