// A recursive fibonacci implementation
function fibonacci(num, memo) {

  memo = memo || {};

  if (memo[num]) return memo[num];
  if (num <= 1) return 1;

  return memo[num] = fibonacci(num - 1, memo) + fibonacci(num - 2, memo);
}


const values = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ];
const odds = values.filter(value => value % 2 === 1);
