Skip to content

Commit 31ffb0f

Browse files
Merge pull request akshitagit#171 from Jagroop2000/LeonardoNumber
Leonardo Number Implementation in Math Folder in Javascript
2 parents 1641cd2 + b781acf commit 31ffb0f

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

Maths/leonardo-number.js

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
// What is Leonardo Number ?
2+
// The Leonardo numbers are a sequence of numbers given by the recurrence:
3+
// if n == 0 then return 0 and if n == 1 then return 1
4+
// if n > 1 then L(n) = L(n-1) + L(n-2) + 1
5+
6+
// For Example if n = 3 then output is 5 (1,1,3,5)
7+
8+
function leonardo(n)
9+
{
10+
let num = [];
11+
num[0] = num[1] = 1;
12+
for (let i = 2; i <= n; i++)
13+
num[i] = num[i - 1] + num[i - 2] + 1;
14+
return num[n];
15+
}
16+
17+
// Driver code
18+
19+
console.log(leonardo(3));

0 commit comments

Comments
 (0)