60697

Appears in sequences

• Least positive integer k such that the fractional part of k*sqrt(5) has its n initial partial quotients all equal to 1.at n=11A004794
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k,2k).at n=25A005252
• Number of partitions of n into parts of 13 kinds.at n=6A023011
• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 3, 1, 1.at n=14A025255
• Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).at n=24A093040
• a(n) = floor[(phi + n mod 2)*a(n-1)], a(1)=1.at n=17A107857
• a(n) = b(k), where b(k) = Fibonacci(n-1) and k = floor( n*(1+sqrt(5))/2 ).at n=17A107858
• a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 1, a(1) = 2, a(2) = 11.at n=8A110679
• Expansion of (1 + x)^2/((1 + x + x^2)*(1 + 3*x + x^2)).at n=12A113066
• Number of n X n binary arrays with all ones connected only in a 1000-1111-0101 pattern in any orientation.at n=7A147178
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1000-1111-0101 pattern in any orientation.at n=16A147180
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1000-1111-0101 pattern in any orientation.at n=17A147180
• Number of nonnegative even integers <= Fibonacci(n).at n=26A147997
• a(n) = ceiling(Fibonacci(n)/2).at n=26A173173
• a(n) = (A000045(n)+A173432(n))/2.at n=25A173433
• a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.at n=53A173673
• Triangle T(n,m) = A060187(n+1,m+1) + 2*binomial(n,m) - 2, read by rows.at n=30A178122
• Triangle T(n,m) = A060187(n+1,m+1) + 2*binomial(n,m) - 2, read by rows.at n=33A178122
• Squarefree numbers which yield zero when their prime factors are xored together.at n=32A235488
• Indices of centered pentagonal numbers (A005891) that are also triangular numbers (A000217).at n=8A254627