34561

Appears in sequences

• a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = a(1) = 1.at n=9A002533
• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=12A005845
• a(n) = 1 + 0!*1!*2!*...*n!.at n=5A019515
• Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).at n=27A045941
• Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=11A049062
• Number of polykites with n cells.at n=10A057786
• Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=13A069106
• 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=22A081264
• Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=4A091982
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=7A093372
• Odd composites m that divide Fibonacci(m)-1.at n=13A094394
• Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=5A094401
• Pell pseudoprimes: odd composite numbers n such that P(n)-Kronecker(2,n) is divisible by n.at n=35A099011
• Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) - 63 for n > 0.at n=18A101518
• a(n) = 60*n^2 + 1.at n=24A158673
• a(n) is the smallest number not already in the sequence, such that the concatenation of all a(n) displays the periodic digit string 1, 2, 3, 4, 5, 6 (and repeat).at n=28A165304
• Composite numbers in A182140 but not in A071700.at n=2A182221
• Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=27A182554
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=6A212424
• a(n) = F(12*n)/(24*L(2*n)), n >= 0, with F = A000045 (Fibonacci) and L = A000032 (Lucas).at n=3A215043