128557

Appears in sequences

• a(n) = floor(Fibonacci(n)/4).at n=29A004697
• a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.at n=36A004972
• a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).at n=9A049652
• a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).at n=4A049663
• a(n) = smallest k such that the digit sum of 7k is n.at n=50A077494
• Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={1,3}.at n=26A079962
• a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2).at n=25A131132
• Lower Beatty array of the golden ratio, (1+sqrt(5))/2.at n=45A181886
• Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).at n=24A213044
• Number of maximal irredundant sets in the n-Andrásfai graph.at n=20A291053
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|.at n=29A293553
• a(n) appears in the congruences modulo 4 or 32 of Markoff numbers m(n) = A002559(n) for odd or even m(n).at n=37A309376
• 4-brilliant numbers with distinct prime factors.at n=25A376864