46367

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=23A000071
• a(n) = 7*a(n-1) - a(n-2) + 5.at n=5A003481
• Fibonacci(n) - (-1)^n.at n=23A007492
• Pisot sequence T(4,7).at n=19A020732
• Duplicate of A035508.at n=11A027418
• a(n) = Fibonacci(2*n+2) - 1.at n=11A035508
• Numerators of continued fraction convergents to sqrt(75).at n=10A041132
• Numerators of continued fraction convergents to sqrt(300).at n=4A041564
• n-th 4k+1 prime times (n+1)st 4k+3 prime.at n=22A048628
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=23A051258
• Numbers that are Fibonacci numbers plus or minus 1.at n=42A061489
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=23A063704
• Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=23A063706
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=22A070964
• n for which there is a chain (or permutation) of the numbers from 1 to n for which each adjacent pair sums to a Fibonacci number.at n=42A079734
• a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).at n=5A081006
• Difference between the sum of next prime(n) natural numbers and the sum of next n primes.at n=24A082749
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=22A100888
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=13A128535
• Number of possible palindromic rows (or columns) in an n X n crossword puzzle.at n=44A131524