23407

Appears in sequences

• Numbers having four 5's in base 8.at n=26A043444
• Composite numbers k that divide Fibonacci(k+1).at n=11A069107
• 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=18A081264
• Odd composites m that divide Fibonacci(m)-1.at n=11A094394
• Numbers k that divide Lucas(k) + 1.at n=35A094398
• Odd numbers k that divide Lucas(k) + 1.at n=13A094399
• Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=7A094402
• Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=6A094409
• Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.at n=9A094412
• Define a(1)=0, a(2)=0, a(3)=1, a(4)=3, a(5)=18, a(6)=22, a(7)=119, a(8)=285. Then a(n) = a(n-8) + 4*sqrt(420*a(n-4)^2 + 420*a(n-4) + 1).at n=11A103715
• Semiprimes n such that 3*n + 4 is a square.at n=27A112666
• 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=23A124456
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (1, -1, -1), (1, 0, 1)}.at n=10A148545
• Semiprimes k that divide Fibonacci(k+1).at n=8A177745
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=10A182504
• Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=23A182554
• Lucas pseudoprimes.at n=20A217120
• Number of partitions p of n containing ceiling((min(p) + max(p))/2) as a part.at n=43A238484
• Number of (n+1) X (5+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=8A250726
• Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime.at n=30A279072