229970

Appears in sequences

• Golden rectangle numbers: F(n) * F(n+1), where F(n) = A000045(n) (Fibonacci numbers).at n=14A001654
• a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=27A006498
• a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.at n=14A059840
• a(n) = a(n-1) + a(n-3) + a(n-4), starting with a(0..3) = 1, 2, 2, 3.at n=26A070550
• a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.at n=28A074677
• Antidiagonal sums of triangle A035317.at n=26A080239
• a(n) = (Lucas(4n+1)-1)/5, or Fibonacci(2n)*Fibonacci(2n+1), or A081017(n)/5.at n=7A081018
• Smallest number having exactly n representations as sum of two squares of distinct primes.at n=6A088919
• Products of consecutive members of A090206 (nonprime Fibonacci numbers).at n=8A090228
• Positive values of k such that there is exactly one permutation p of (1,2,3,...,k) such that i+p(i) is a Fibonacci number for 1<=i<=k.at n=25A097083
• Three consecutive elements of the sequence built from a quadratic form over four consecutive Fibonacci numbers A000045.at n=9A114695
• Ordered Fibonomial coefficients (A144712) which are not Fibonacci numbers (A000045).at n=21A171159
• Least number having n orderless representations as p^2 + q^2, where p and q are primes.at n=5A214511
• Denominators in an expansion of 3 - sqrt(5) as a sum of fractions +-1/d.at n=18A255353
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,2 or 1,1.at n=7A264106
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 0, a(3) = 2.at n=27A295688
• Numbers k with Goldbach partitions (p,q) and (r,s) such that k | (p*q -1) and k | (r*s +1).at n=24A336584