86267571272
domain: N
Appears in sequences
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=27A001906
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=18A014445
- a(n) = Fibonacci(4*n + 2).at n=13A033890
- Fibonacci numbers having initial digit '8'.at n=3A045732
- Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=33A050762
- Fibonacci numbers that are not squarefree.at n=10A061899
- Fibonacci numbers whose digits sum to a prime.at n=24A065398
- Smallest Fibonacci number containing exactly n 7's.at n=2A072316
- a(n) is the largest n-digit Fibonacci number.at n=10A072352
- Smallest Fibonacci number with n prime factors when counted with multiplicity.at n=7A072397
- Smallest nonzero Fibonacci number divisible by n not included earlier.at n=18A073875
- Abundant Fibonacci numbers.at n=8A074316
- Fibonacci numbers F(k) for k not squarefree (A013929).at n=20A075732
- Nonsquarefree Fibonacci numbers whose indices are also not squarefree.at n=7A075739
- Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = 1, such that the partial sums are nearest to, but never exceed, unity.at n=15A084908
- Fibonacci numbers with a prime signature that has not occurred earlier.at n=16A085077
- a(0) = 1, a(n) = Fibonacci(2*n). It has the property that a(n) = 1*a(n-1) + 2*a(n-2) + 3*a(n-3) + 4*a(n-4) + ...at n=27A088305
- Smallest m such that 6 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=9A105716
- Smallest Fibonacci number such that 8 is at the n-th position (from the right) of its decimal representation.at n=10A105718
- Fibonacci numbers which are divisible by the sum of their digits.at n=9A117774