4807526976
domain: N
Appears in sequences
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=24A001906
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=16A014445
- a(n) = Fibonacci(4*n).at n=12A033888
- Fibonacci numbers having initial digit '4'.at n=3A045728
- Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=31A050762
- Fibonacci(k) starting with digits of its index number k.at n=4A052000
- Fibonacci numbers that are not squarefree.at n=8A061899
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=47A063708
- Fibonacci numbers whose sum of decimal digits is greater than its index.at n=15A068498
- Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=15A068500
- Smallest Fibonacci number with n prime factors when counted with multiplicity.at n=11A072397
- Smallest nonzero Fibonacci number divisible by n not included earlier.at n=13A073875
- Abundant Fibonacci numbers.at n=7A074316
- Fibonacci numbers F(k) for k not squarefree (A013929).at n=16A075732
- Nonsquarefree Fibonacci numbers whose indices are also not squarefree.at n=5A075739
- Smallest Fibonacci numbers having exactly n Fibonacci divisors.at n=8A076985
- Smallest Fibonacci number of the form n*k + 1 with k>0.at n=24A076988
- a(1) = 1, a(n+1) is the largest Fibonacci number <= n*a(n).at n=14A076999
- a(n) = F(3*2^n) where F(k) denotes the k-th Fibonacci number.at n=4A079613
- Smallest Fibonacci number divisible by 2^n.at n=6A083523