103729

Appears in sequences

• Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=23A031122
• a(n) = Fibonacci(8*n)/21.at n=4A049668
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=24A050613
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=25A050613
• Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).at n=12A050614
• Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].at n=25A075149
• a(n) = L(n)*L(2n), where L(n) are the Lucas numbers (A000204).at n=7A083564
• Numbers of the form Fibonacci(2^c)/Fibonacci(2^b), 1 <= b < c.at n=7A181393
• Numbers of the form Fibonacci(p^c)/Fibonacci(p^b), where p is some prime and 1<=b<c are two integer exponents.at n=11A181420
• Semiprimes of the form n^3 - 2*n.at n=9A240436
• Number of new duplicate terms at a given iteration of the Collatz (or 3x+1) map starting with 0.at n=22A275545
• Composite numbers k such that the sum of their aliquot parts divides k+1.at n=18A306532
• Non-prime-powers k at which the variance of the first differences of the logarithms of the divisors of k, scaled by log(k), reaches a new minimum.at n=17A323729
• Number of matchings in the n X n zebra graph.at n=4A387582