28655

Appears in sequences

• a(n) = Fibonacci(n+3) - 2.at n=20A001911
• Number of strict (-1)st-order maximal independent sets in path graph.at n=20A007382
• a(n) = Fibonacci(n) OR Fibonacci(n+1).at n=21A051123
• Expansion of (1-x)/(1-2*x^2-x^3).at n=25A078024
• a(n) = Fibonacci(4*n+3) - 2, or Fibonacci(2*n)*Lucas(2*n+3).at n=5A081013
• Expansion of (1-6x)/(1-6x-11x^2).at n=6A091929
• Partial sums of repeated Fibonacci sequence.at n=40A094707
• a(n) = abs( f(Fibonacci(n)) - Fibonacci(f(n)) ), where f(n) = n-2 if (n mod 3) = 0, f(n) = n+2 if (n mod 3) = 1, otherwise f(n) = n.at n=23A103114
• a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number.at n=21A157605
• s(k)-s(j), where the pairs (k,j) are given by A205852 and A205853, and s(k) denotes the (k+1)-st Fibonacci number.at n=34A205854
• a(2t) = a(2t-1) + 1, a(2t+1) = a(2t) + a(2t-2) for t >= 1, with a(0) = a(1) = 1.at n=39A226538
• Number of compositions of n into parts 1 and 2 with both parts present.at n=19A245738
• Number of length n+5 0..2 arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms.at n=8A249954
• Indices of squares of primes in A098550.at n=40A251240
• Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 0 or 1 and no column sum 0 or 1.at n=3A256805
• Number of (n+2)X(4+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 0 or 1 and no column sum 0 or 1.at n=2A256806
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 0 or 1 and no column sum 0 or 1.at n=17A256810
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 0 or 1 and no column sum 0 or 1.at n=18A256810
• Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and every three consecutive elements having its maximum within 5 of its minimum.at n=10A263749
• a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)).at n=44A270741