35207

Appears in sequences

• Composite numbers k that divide Fibonacci(k+1).at n=15A069107
• Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).at n=24A081264
• Odd composites m that divide Fibonacci(m)-1.at n=15A094394
• Numbers k that divide Lucas(k) + 1.at n=41A094398
• Odd numbers k that divide Lucas(k) + 1.at n=16A094399
• Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=9A094402
• Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=9A094409
• Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.at n=13A094412
• Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=30A124456
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=14A182504
• Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=29A182554
• Numbers k such that 2^(k+1) == 1 (mod k).at n=27A187787
• Number of zero-sum -n..n arrays of 5 elements with first and second differences also in -n..n.at n=12A201876
• Number of n X n 0..3 symmetric matrices with every element equal to zero, one or two horizontal and vertical neighbors, and new values 0..3 introduced in lower triangle row major order.at n=3A210923
• Lucas pseudoprimes.at n=28A217120
• Numbers k such that nonprime(k) divides k^2.at n=20A226011
• Sum of the middle parts in the partitions of 4n-1 into 3 parts.at n=28A240707
• Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime.at n=39A279072
• Numbers k such that (4*10^k + 83)/3 is prime.at n=24A280861
• Odd integers m that divide the sum of the first m nonzero Fibonacci numbers.at n=29A331976