44099

Appears in sequences

• a(n) = n^3 + n^2 - 1.at n=34A003777
• Quasi-Carmichael numbers to base 3: squarefree composites n such that prime p|n ==> p-3|n-3.at n=14A029560
• Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=14A049062
• Composite numbers k that divide Fibonacci(k+1).at n=17A069107
• Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=40A072671
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=8A093372
• Odd composites m that divide Fibonacci(m)-1.at n=17A094394
• Odd numbers k that divide Lucas(k) + 1.at n=18A094399
• Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=11A094402
• Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=11A094409
• Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1.at n=15A094412
• Least j > 1 for n > 0 such that j^2 = (n^2 + 1)*(k^2) + (n^2 + 1)*k + 1 where k sequence = A106230.at n=35A106229
• 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=33A124456
• a(0)=1; a(n) = (Product_{i=1..n} prime(i)^2) - 1, where prime(i) is the i-th prime.at n=4A135516
• a(n) = 36n^2 - 1.at n=34A136017
• a(n) = (n-1)*(n+2)*(n^2 + n + 2)/4.at n=19A168566
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=16A182504
• Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1).at n=32A182554
• Numbers k such that 2^(k+1) == 1 (mod k).at n=29A187787
• Composite numbers n such that b^(n+1) == 1 (mod n) for every b coprime to n.at n=14A208728