{"id":25536747,"date":"2022-08-05T12:00:06","date_gmt":"2022-08-05T06:30:06","guid":{"rendered":"https:\/\/entri.app\/blog\/?p=25536747"},"modified":"2022-11-19T16:24:15","modified_gmt":"2022-11-19T10:54:15","slug":"program-for-fibonacci-series-in-java","status":"publish","type":"post","link":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/","title":{"rendered":"Program for Fibonacci Series in Java"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_79_2 counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<label for=\"ez-toc-cssicon-toggle-item-69e732332cb29\" class=\"ez-toc-cssicon-toggle-label\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-69e732332cb29\"  aria-label=\"Toggle\" \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#Display_Fibonacci_Series\" >Display Fibonacci Series<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#Display_Fibonacci_Series_Using_for_Loop\" >Display Fibonacci Series Using for Loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#Display_Fibonacci_series_using_while_loop\" >Display Fibonacci series using while loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#Display_the_Fibonacci_series_up_to_a_given_number\" >Display the Fibonacci series up to a given number<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#Fibonacci_Series_using_recursion\" >Fibonacci Series using recursion<\/a><\/li><\/ul><\/nav><\/div>\n<p><span data-slate-fragment=\"JTVCJTdCJTIydHlwZSUyMiUzQSUyMnBhcmFncmFwaCUyMiUyQyUyMmNoaWxkcmVuJTIyJTNBJTVCJTdCJTIydGV4dCUyMiUzQSUyMlRoZSUyMHNlcXVlbmNlJTIwcmVmZXJzJTIwdG8lMjB0aGUlMjBudW1iZXIlMjBvZiUyMGNvbnNlY3V0aXZlJTIwbnVtYmVycyUyMGJlZ2lubmluZyUyMHdpdGglMjAwJTIwYW5kJTIwMSUyMHN1Y2glMjB0aGF0JTIwZWFjaCUyMHN1YnNlcXVlbnQlMjBudW1iZXIlMjBpcyUyMHRoZSUyMHN1bSUyMG9mJTIwdGhlJTIwdHdvJTIwcHJlY2VkaW5nJTIwb25lcy4lMjBGb3IlMjBleGFtcGxlJTJDJTIwMCUyQyUyMDElMkMlMjAxJTJDJTIwMiUyQyUyMDMlMkMlMjA1JTJDJTIwOCUyQyUyMDEzJTIwYW5kJTIwc28lMjBvbiUyMChlYWNoJTIwbnVtYmVyJTIwYmVpbmclMjBvbmUlMjBncmVhdGVyJTIwdGhhbiUyMHRoZSUyMHByZWNlZGluZyUyMG9uZSkuJTIwVGhlJTIwRmlib25hY2NpJTIwc2VyaWVzJTIwaGFzJTIwYW4lMjBpbmZpbml0ZSUyMG51bWJlciUyMG9mJTIwdGVybXMuJTIyJTdEJTVEJTdEJTVE\">The sequence refers to the number of consecutive numbers beginning with 0 and 1 such that each subsequent number is the sum of the two preceding ones. For example, 0, 1, 1, 2, 3, 5, 8, 13, and so on (each number is one greater than the preceding one). The <a href=\"https:\/\/entri.app\/blog\/what-are-java-servlets-and-servlets-basics\/\" target=\"_blank\" rel=\"noopener\">Fibonacci series<\/a> has an infinite number of terms. The fibonacci series using recursion is named after an Italian mathematician who lived in the 12th century, Leonardo of Pisa, also known as Fibonacci. Fibonacci was fascinated by the rabbits he saw in his homeland; he noticed that there were times when a rabbit would give birth to two little ones at once, and then within several months, it would have more babies than just one or two at once. He began to wonder about this mathematical phenomenon in nature and came up with the following rules regarding how rabbits will reproduce.<\/span><\/p>\n<h2><a href=\"https:\/\/entri.sng.link\/Bcofz\/yeoy\/ojyv\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-25531373 size-full\" src=\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/07\/Python-and-Machine-Learning-Rectangle-1.png\" alt=\"\" width=\"970\" height=\"250\" srcset=\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/07\/Python-and-Machine-Learning-Rectangle-1.png 970w, https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/07\/Python-and-Machine-Learning-Rectangle-1-300x77.png 300w, https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/07\/Python-and-Machine-Learning-Rectangle-1-768x198.png 768w, https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/07\/Python-and-Machine-Learning-Rectangle-1-750x193.png 750w\" sizes=\"auto, (max-width: 970px) 100vw, 970px\" \/><\/a><\/h2>\n<h2><span class=\"ez-toc-section\" id=\"Display_Fibonacci_Series\"><\/span><strong>Display Fibonacci Series<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>The following term in the Fibonacci series is equal to the sum of the two terms before it. The Fibonacci sequence&#8217;s first two terms are 0 and 1, respectively.<\/p>\n<p><strong>Fibonacci Series<\/strong>: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34<\/p>\n<p>Suppose, our first two terms are:<\/p>\n<pre><code class=\"java hljs\">firstTerm =  <span class=\"hljs-number\">0<\/span>\r\nsecondTerm = <span class=\"hljs-number\">1<\/span>\r\n<\/code><\/pre>\n<p>The next terms in the Fibonacci series would be calculated as:<\/p>\n<pre><code class=\"java hljs\">nextTerm = firstTerm + secondTerm; (<span class=\"hljs-number\">0<\/span> + <span class=\"hljs-number\">1<\/span>)\r\nfirstTerm = secondTerm; (<span class=\"hljs-number\">1<\/span>)\r\nsecondTerm = nextTerm; (<span class=\"hljs-number\">1<\/span>)\r\n\r\nnextTerm = firstTerm + secondTerm; (<span class=\"hljs-number\">1<\/span> + <span class=\"hljs-number\">1<\/span>)\r\n....<\/code><\/pre>\n<p>Let&#8217;s now apply this logic to our program.<\/p>\n<p style=\"text-align: center;\"><strong><a href=\"https:\/\/bit.ly\/3ELmCiA\">Click here to know more about Java programming in Entri App!<\/a><\/strong><\/p>\n<h2><span class=\"ez-toc-section\" id=\"Display_Fibonacci_Series_Using_for_Loop\"><\/span><strong>Display Fibonacci Series Using for Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>You can use the program below to learn how to create a Java program that uses a for loop to generate the first &#8216;n&#8217; numbers in the Fibonacci series. This reasoning is really<a href=\"https:\/\/entri.sng.link\/Bcofz\/uu8c\/w409\"> straightforward<\/a>. I have initialized the series&#8217; first two numbers first. The next step is the for loop, which prints the value and adds its two immediate predecessors. Up until the program prints the first &#8220;n&#8221; numbers in the series, this process continues.<\/p>\n<div class=\"code-editor\">\n<div class=\"code-editor__area\">\n<div class=\"pre-code-wrapper\">\n<pre class=\"java-exec\"><code class=\"java hljs\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">\r\nclass<\/span> <span class=\"hljs-title\">Main<\/span> <\/span>{\r\n  <span class=\"hljs-function\"><span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title\">main<\/span><span class=\"hljs-params\">(String[] args)<\/span> <\/span>{\r\n\r\n    <span class=\"hljs-keyword\">int<\/span> n = <span class=\"hljs-number\">10<\/span>, firstTerm = <span class=\"hljs-number\">0<\/span>, secondTerm = <span class=\"hljs-number\">1<\/span>;\r\n    System.out.println(<span class=\"hljs-string\">\"Fibonacci Series till \"<\/span> + n + <span class=\"hljs-string\">\" terms:\"<\/span>);\r\n\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-keyword\">int<\/span> i = <span class=\"hljs-number\">1<\/span>; i &lt;= n; ++i) {\r\n      System.out.print(firstTerm + <span class=\"hljs-string\">\", \"<\/span>);\r\n\r\n      <span class=\"hljs-comment\">\/\/ compute the next term<\/span>\r\n      <span class=\"hljs-keyword\">int<\/span> nextTerm = firstTerm + secondTerm;\r\n      firstTerm = secondTerm;\r\n      secondTerm = nextTerm;\r\n    }\r\n  }\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<div class=\"code-editor__action\">Run Code<\/div>\n<\/div>\n<p><strong>Output<\/strong><\/p>\n<pre><samp>Fibonacci Series till 10 terms:\r\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34,\r\n<\/samp><\/pre>\n<p style=\"text-align: center;\"><strong><a href=\"https:\/\/bit.ly\/3ELmCiA\">Enroll in our latest java programming course in the Entri App!<\/a><\/strong><\/p>\n<p>FirstTerm and SecondTerm are initialised with 0 and 1 in the programme above, respectively (first two digits of Fibonacci series).<\/p>\n<p>Here, the for loop has been utilised to<\/p>\n<p>print the first term in the series and then add the first and second terms to get the next term.<br \/>\nAdd the value of the second term to the first term and the second term to the next term.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Display_Fibonacci_series_using_while_loop\"><\/span><strong>Display Fibonacci series using while loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>The reasoning is comparable to the earlier approach. You only need to be watchful of the while loop condition. To learn how to generate Fibonacci Series using a while loop, check at the Java code below.<\/p>\n<div class=\"code-editor\">\n<div class=\"code-editor__area\">\n<div class=\"pre-code-wrapper\">\n<pre class=\"java-exec\"><code class=\"java hljs\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Main<\/span> <\/span>{\r\n  <span class=\"hljs-function\"><span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title\">main<\/span><span class=\"hljs-params\">(String[] args)<\/span> <\/span>{\r\n\r\n    <span class=\"hljs-keyword\">int<\/span> i = <span class=\"hljs-number\">1<\/span>, n = <span class=\"hljs-number\">10<\/span>, firstTerm = <span class=\"hljs-number\">0<\/span>, secondTerm = <span class=\"hljs-number\">1<\/span>;\r\n    System.out.println(<span class=\"hljs-string\">\"Fibonacci Series till \"<\/span> + n + <span class=\"hljs-string\">\" terms:\"<\/span>);\r\n\r\n    <span class=\"hljs-keyword\">while<\/span> (i &lt;= n) {\r\n      System.out.print(firstTerm + <span class=\"hljs-string\">\", \"<\/span>);\r\n\r\n      <span class=\"hljs-keyword\">int<\/span> nextTerm = firstTerm + secondTerm;\r\n      firstTerm = secondTerm;\r\n      secondTerm = nextTerm;\r\n\r\n      i++;\r\n    }\r\n  }\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<div class=\"code-editor__action\">Run Code<\/div>\n<\/div>\n<p><strong>Output<\/strong><\/p>\n<pre><samp>Fibonacci Series till 10 terms:\r\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34,\r\n<\/samp><\/pre>\n<p>This program operates in a similar manner to the one that came before it.<\/p>\n<p>Additionally, even though both scripts are theoretically accurate, using a for loop in this situation is preferable. It&#8217;s because we know how many iterations there will be (between 1 and n).<\/p>\n<p style=\"text-align: center;\"><strong><a href=\"https:\/\/bit.ly\/3ELmCiA\">Enroll in our latest java programming course in Entri App!<\/a><\/strong><\/p>\n<h2><span class=\"ez-toc-section\" id=\"Display_the_Fibonacci_series_up_to_a_given_number\"><\/span><strong>Display the Fibonacci series up to a given number<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<div class=\"code-editor\">\n<div class=\"code-editor__area\">\n<div class=\"pre-code-wrapper\">\n<pre class=\"java-exec\"><code class=\"java hljs\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Fibonacci<\/span> <\/span>{\r\n  <span class=\"hljs-function\"><span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title\">main<\/span><span class=\"hljs-params\">(String[] args)<\/span> <\/span>{\r\n\r\n    <span class=\"hljs-keyword\">int<\/span> n = <span class=\"hljs-number\">100<\/span>, firstTerm = <span class=\"hljs-number\">0<\/span>, secondTerm = <span class=\"hljs-number\">1<\/span>;\r\n        \r\n    System.out.println(<span class=\"hljs-string\">\"Fibonacci Series Upto \"<\/span> + n + <span class=\"hljs-string\">\": \"<\/span>);\r\n    \r\n    <span class=\"hljs-keyword\">while<\/span> (firstTerm &lt;= n) {\r\n      System.out.print(firstTerm + <span class=\"hljs-string\">\", \"<\/span>);\r\n\r\n      <span class=\"hljs-keyword\">int<\/span> nextTerm = firstTerm + secondTerm;\r\n      firstTerm = secondTerm;\r\n      secondTerm = nextTerm;\r\n\r\n    }\r\n  }\r\n}<\/code><\/pre>\n<\/div>\n<\/div>\n<div class=\"code-editor__action\">Run Code<\/div>\n<\/div>\n<p><strong>Output<\/strong><\/p>\n<pre><samp>Fibonacci Series Upto 100:\r\n0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,\r\n<\/samp><\/pre>\n<p>In this illustration, we are displaying the Fibonacci sequence up to the specified number rather than the series up to a specific integer (100).<\/p>\n<p>To do this, all we have to do is compare first term with n. Additionally, it is printed in the series if first term is less than n. Otherwise, the series is finished.<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Fibonacci_Series_using_recursion\"><\/span><strong>Fibonacci Series using recursion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>The fundamental Java programming concept of recursion involves a function calling itself either directly or indirectly. A recursive function is a name given to the related function. A recursive algorithm can be used to tackle some issues with relative ease. Let&#8217;s look at how to print the first &#8216;n&#8217; Fibonacci numbers in Java using recursion. You can learn how to create a recursive Java program to generate the first &#8216;n&#8217; numbers in the Fibonacci series using recursion by using the program below. The reasoning behind this is pretty clear-cut. The for loop is used to loop until the limit after which each iteration calls the Fibonacci number(int n) function, which returns the Fibonacci number at position n. The previous two Fibonacci numbers are added by the Fibonacci function iteratively.<\/p>\n<div>\n<div id=\"highlighter_146767\" class=\"syntaxhighlighter java\">\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td class=\"code\">\n<div class=\"container\">\n<div class=\"line number1 index0 alt2\"><code class=\"java keyword\">package<\/code> <code class=\"java plain\">Edureka;<\/code><\/div>\n<div class=\"line number2 index1 alt1\"><code class=\"java keyword\">import<\/code> <code class=\"java plain\">java.util.Scanner;<\/code><\/div>\n<div class=\"line number3 index2 alt2\"><code class=\"java keyword\">public<\/code> <code class=\"java keyword\">class<\/code> <code class=\"java plain\">FibRec {<\/code><\/div>\n<div class=\"line number4 index3 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number5 index4 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">public<\/code> <code class=\"java keyword\">static<\/code> <code class=\"java keyword\">void<\/code> <code class=\"java plain\">main(String[] args) <\/code><\/div>\n<div class=\"line number6 index5 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">{<\/code><\/div>\n<div class=\"line number7 index6 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number8 index7 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">int<\/code> <code class=\"java plain\">n;<\/code><\/div>\n<div class=\"line number9 index8 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number10 index9 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">System.out.println(<\/code><code class=\"java string\">\"Enter how may fibonnaci numbers to print\"<\/code><code class=\"java plain\">);<\/code><\/div>\n<div class=\"line number11 index10 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">Scanner scanner = <\/code><code class=\"java keyword\">new<\/code> <code class=\"java plain\">Scanner(System.in);<\/code><\/div>\n<div class=\"line number12 index11 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">n = scanner.nextInt();<\/code><\/div>\n<div class=\"line number13 index12 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number14 index13 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">for<\/code> <code class=\"java plain\">(<\/code><code class=\"java keyword\">int<\/code> <code class=\"java plain\">i = <\/code><code class=\"java value\">0<\/code><code class=\"java plain\">; i&lt;=n-<\/code><code class=\"java value\">1<\/code><code class=\"java plain\">; ++i)<\/code><\/div>\n<div class=\"line number15 index14 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">{<\/code><\/div>\n<div class=\"line number16 index15 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">System.out.print(fibonaccinumber(i) + <\/code><code class=\"java string\">\" \"<\/code><code class=\"java plain\">);<\/code><\/div>\n<div class=\"line number17 index16 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">}<\/code><\/div>\n<div class=\"line number18 index17 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">}<\/code><\/div>\n<div class=\"line number19 index18 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number20 index19 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">public<\/code> <code class=\"java keyword\">static<\/code> <code class=\"java keyword\">int<\/code> <code class=\"java plain\">fibonaccinumber(<\/code><code class=\"java keyword\">int<\/code> <code class=\"java plain\">n) {<\/code><\/div>\n<div class=\"line number21 index20 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number22 index21 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">if<\/code><code class=\"java plain\">(n==<\/code><code class=\"java value\">0<\/code><code class=\"java plain\">)<\/code><\/div>\n<div class=\"line number23 index22 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">return<\/code> <code class=\"java value\">0<\/code><code class=\"java plain\">;<\/code><\/div>\n<div class=\"line number24 index23 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">else<\/code> <code class=\"java keyword\">if<\/code><code class=\"java plain\">(n==<\/code><code class=\"java value\">1<\/code><code class=\"java plain\">)<\/code><\/div>\n<div class=\"line number25 index24 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">return<\/code> <code class=\"java value\">1<\/code><code class=\"java plain\">;<\/code><\/div>\n<div class=\"line number26 index25 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">else<\/code><\/div>\n<div class=\"line number27 index26 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java keyword\">return<\/code> <code class=\"java plain\">fibonaccinumber(n-<\/code><code class=\"java value\">1<\/code><code class=\"java plain\">) + fibonaccinumber(n-<\/code><code class=\"java value\">2<\/code><code class=\"java plain\">);<\/code><\/div>\n<div class=\"line number28 index27 alt1\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code><\/div>\n<div class=\"line number29 index28 alt2\"><code class=\"java spaces\">\u00a0\u00a0\u00a0\u00a0<\/code><code class=\"java plain\">} <\/code><\/div>\n<div class=\"line number30 index29 alt1\"><code class=\"java plain\">}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<p><strong>Output:<br \/>\n<\/strong><\/p>\n<div>\n<div id=\"highlighter_257464\" class=\"syntaxhighlighter plain\">\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td class=\"gutter\">\n<div class=\"line number1 index0 alt2\">1<\/div>\n<div class=\"line number2 index1 alt1\">2<\/div>\n<div class=\"line number3 index2 alt2\">3<\/div>\n<\/td>\n<td class=\"code\">\n<div class=\"container\">\n<div class=\"line number1 index0 alt2\"><code class=\"plain plain\">Enter how may fibonnaci numbers to print <\/code><\/div>\n<div class=\"line number2 index1 alt1\"><code class=\"plain plain\">7 <\/code><\/div>\n<div class=\"line number3 index2 alt2\"><code class=\"plain plain\">The first 7 Fibonacci numbers are: 0 1 1 2 3 5 8 <\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<p style=\"text-align: center;\"><a href=\"https:\/\/entri.sng.link\/Bcofz\/uu8c\/w409\">Get the latest updates on java programming in the Entri app<\/a><\/p>\n<p>If you are interested to learn new coding skills, the Entri app will help you to acquire them very easily. Entri app is following a structural study plan so that the students can learn very easily. If you don&#8217;t have a coding background, it won&#8217;t be a problem. You can download the Entri app from the google play store and enroll in your favorite course.<\/p>\n<pre><samp>\u00a0<\/samp><\/pre>\n<pre><samp>\u00a0<\/samp><\/pre>\n<pre><samp>\u00a0<\/samp><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>The sequence refers to the number of consecutive numbers beginning with 0 and 1 such that each subsequent number is the sum of the two preceding ones. For example, 0, 1, 1, 2, 3, 5, 8, 13, and so on (each number is one greater than the preceding one). The Fibonacci series has an infinite [&hellip;]<\/p>\n","protected":false},"author":93,"featured_media":25536755,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[802,1864,1882,1883,1881],"tags":[],"class_list":["post-25536747","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-articles","category-data-science-ml","category-java-programming","category-react-native","category-web-android-development"],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.6 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Program for Fibonacci Series in Java - Entri Blog<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Program for Fibonacci Series in Java - Entri Blog\" \/>\n<meta property=\"og:description\" content=\"The sequence refers to the number of consecutive numbers beginning with 0 and 1 such that each subsequent number is the sum of the two preceding ones. For example, 0, 1, 1, 2, 3, 5, 8, 13, and so on (each number is one greater than the preceding one). The Fibonacci series has an infinite [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\" \/>\n<meta property=\"og:site_name\" content=\"Entri Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/entri.me\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-08-05T06:30:06+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-11-19T10:54:15+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png\" \/>\n\t<meta property=\"og:image:width\" content=\"820\" \/>\n\t<meta property=\"og:image:height\" content=\"615\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Akhil M G\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@entri_app\" \/>\n<meta name=\"twitter:site\" content=\"@entri_app\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Akhil M G\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\"},\"author\":{\"name\":\"Akhil M G\",\"@id\":\"https:\/\/entri.app\/blog\/#\/schema\/person\/875646423b2cce93c1bd5bc16850fff6\"},\"headline\":\"Program for Fibonacci Series in Java\",\"datePublished\":\"2022-08-05T06:30:06+00:00\",\"dateModified\":\"2022-11-19T10:54:15+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\"},\"wordCount\":758,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/entri.app\/blog\/#organization\"},\"image\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png\",\"articleSection\":[\"Articles\",\"Data Science and Machine Learning\",\"Java Programming\",\"React Native\",\"Web and Android Development\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\",\"url\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\",\"name\":\"Program for Fibonacci Series in Java - Entri Blog\",\"isPartOf\":{\"@id\":\"https:\/\/entri.app\/blog\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png\",\"datePublished\":\"2022-08-05T06:30:06+00:00\",\"dateModified\":\"2022-11-19T10:54:15+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage\",\"url\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png\",\"contentUrl\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png\",\"width\":820,\"height\":615,\"caption\":\"Program for Fibonacci Series in Java\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/entri.app\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Entri Skilling\",\"item\":\"https:\/\/entri.app\/blog\/category\/entri-skilling\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Java Programming\",\"item\":\"https:\/\/entri.app\/blog\/category\/entri-skilling\/java-programming\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Program for Fibonacci Series in Java\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/entri.app\/blog\/#website\",\"url\":\"https:\/\/entri.app\/blog\/\",\"name\":\"Entri Blog\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/entri.app\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/entri.app\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/entri.app\/blog\/#organization\",\"name\":\"Entri App\",\"url\":\"https:\/\/entri.app\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/entri.app\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2019\/10\/Entri-Logo-1.png\",\"contentUrl\":\"https:\/\/entri.app\/blog\/wp-content\/uploads\/2019\/10\/Entri-Logo-1.png\",\"width\":989,\"height\":446,\"caption\":\"Entri App\"},\"image\":{\"@id\":\"https:\/\/entri.app\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/entri.me\/\",\"https:\/\/x.com\/entri_app\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/entri.app\/blog\/#\/schema\/person\/875646423b2cce93c1bd5bc16850fff6\",\"name\":\"Akhil M G\",\"url\":\"https:\/\/entri.app\/blog\/author\/akhil\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Program for Fibonacci Series in Java - Entri Blog","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/","og_locale":"en_US","og_type":"article","og_title":"Program for Fibonacci Series in Java - Entri Blog","og_description":"The sequence refers to the number of consecutive numbers beginning with 0 and 1 such that each subsequent number is the sum of the two preceding ones. For example, 0, 1, 1, 2, 3, 5, 8, 13, and so on (each number is one greater than the preceding one). The Fibonacci series has an infinite [&hellip;]","og_url":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/","og_site_name":"Entri Blog","article_publisher":"https:\/\/www.facebook.com\/entri.me\/","article_published_time":"2022-08-05T06:30:06+00:00","article_modified_time":"2022-11-19T10:54:15+00:00","og_image":[{"width":820,"height":615,"url":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png","type":"image\/png"}],"author":"Akhil M G","twitter_card":"summary_large_image","twitter_creator":"@entri_app","twitter_site":"@entri_app","twitter_misc":{"Written by":"Akhil M G","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#article","isPartOf":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/"},"author":{"name":"Akhil M G","@id":"https:\/\/entri.app\/blog\/#\/schema\/person\/875646423b2cce93c1bd5bc16850fff6"},"headline":"Program for Fibonacci Series in Java","datePublished":"2022-08-05T06:30:06+00:00","dateModified":"2022-11-19T10:54:15+00:00","mainEntityOfPage":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/"},"wordCount":758,"commentCount":0,"publisher":{"@id":"https:\/\/entri.app\/blog\/#organization"},"image":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage"},"thumbnailUrl":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png","articleSection":["Articles","Data Science and Machine Learning","Java Programming","React Native","Web and Android Development"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/","url":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/","name":"Program for Fibonacci Series in Java - Entri Blog","isPartOf":{"@id":"https:\/\/entri.app\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage"},"image":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage"},"thumbnailUrl":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png","datePublished":"2022-08-05T06:30:06+00:00","dateModified":"2022-11-19T10:54:15+00:00","breadcrumb":{"@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#primaryimage","url":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png","contentUrl":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2022\/08\/Untitled-2022-08-04T213657.562-1.png","width":820,"height":615,"caption":"Program for Fibonacci Series in Java"},{"@type":"BreadcrumbList","@id":"https:\/\/entri.app\/blog\/program-for-fibonacci-series-in-java\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/entri.app\/blog\/"},{"@type":"ListItem","position":2,"name":"Entri Skilling","item":"https:\/\/entri.app\/blog\/category\/entri-skilling\/"},{"@type":"ListItem","position":3,"name":"Java Programming","item":"https:\/\/entri.app\/blog\/category\/entri-skilling\/java-programming\/"},{"@type":"ListItem","position":4,"name":"Program for Fibonacci Series in Java"}]},{"@type":"WebSite","@id":"https:\/\/entri.app\/blog\/#website","url":"https:\/\/entri.app\/blog\/","name":"Entri Blog","description":"","publisher":{"@id":"https:\/\/entri.app\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/entri.app\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/entri.app\/blog\/#organization","name":"Entri App","url":"https:\/\/entri.app\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/entri.app\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2019\/10\/Entri-Logo-1.png","contentUrl":"https:\/\/entri.app\/blog\/wp-content\/uploads\/2019\/10\/Entri-Logo-1.png","width":989,"height":446,"caption":"Entri App"},"image":{"@id":"https:\/\/entri.app\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/entri.me\/","https:\/\/x.com\/entri_app"]},{"@type":"Person","@id":"https:\/\/entri.app\/blog\/#\/schema\/person\/875646423b2cce93c1bd5bc16850fff6","name":"Akhil M G","url":"https:\/\/entri.app\/blog\/author\/akhil\/"}]}},"_links":{"self":[{"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/posts\/25536747","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/users\/93"}],"replies":[{"embeddable":true,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/comments?post=25536747"}],"version-history":[{"count":5,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/posts\/25536747\/revisions"}],"predecessor-version":[{"id":25547385,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/posts\/25536747\/revisions\/25547385"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/media\/25536755"}],"wp:attachment":[{"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/media?parent=25536747"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/categories?post=25536747"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/entri.app\/blog\/wp-json\/wp\/v2\/tags?post=25536747"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}