34943

Appears in sequences

• Composite numbers k that divide Fibonacci(k+1).at n=14A069107
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=20A070001
• 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=23A081264
• a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.at n=33A082941
• Odd composites m that divide Fibonacci(m)-1.at n=14A094394
• Numbers k that divide Lucas(k) + 1.at n=40A094398
• Odd numbers k that divide Lucas(k) + 1.at n=15A094399
• Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=8A094402
• Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=8A094409
• Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.at n=12A094412
• Numbers k such that 7*10^k - 9 is prime.at n=24A103048
• 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=28A124456
• Write exp(-x) = Product_{n>=1} (1 + g_n * x^n); a(n) = numerator(g_n).at n=20A170910
• Semiprimes k that divide Fibonacci(k+1).at n=11A177745
• Smallest k such that 41^k mod k = n.at n=40A178202
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=13A182504
• Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=28A182554
• Lucas pseudoprimes.at n=27A217120
• Palindromes greater than 10 whose sum of proper divisors is also a palindrome greater than 10.at n=10A227228
• Each term is a palindrome such that the sum of its proper divisors is a palindrome > 1.at n=14A227947