Answers for "fibonessi series"

fibinachi

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

fibanachi

function fib(n){
	var fib = [0, 1];
	var i = 0;
	for (let i = 0; i != n-2; i++){

		fib.push(fib[i]+fib[i+1]);

	}

	return fib;

}

fibinachi

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

fibanachi

function fib(n){
	var fib = [0, 1];
	var i = 0;
	for (let i = 0; i != n-2; i++){

		fib.push(fib[i]+fib[i+1]);

	}

	return fib;

}