103685

Appears in sequences

• Number of independent sets of vertices in graph K_4 X C_n (n > 2).at n=8A051929
• Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.at n=20A066290
• a(n) = Lucas(4n) + 3, or 5*Fibonacci(2n-1)*Fibonacci(2n+1).at n=6A081076
• For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of successive numbers m which d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1) is an integer.at n=22A229996
• Numbers that divide the average of the sum of the squares of their divisors.at n=8A255244
• Numbers k such that the sum of the squares of the odd divisors of k (A050999) is divisible by k.at n=28A355543
• a(n) = Lucas(n) + 3.at n=23A366506
• a(n) = Lucas(2*n) + 2*(-1)^n + 1.at n=11A366508
• Integers of the form k^2 + 1, where k >= 1, that are the product of two other integers of the form k^2 + 1, where k >= 1.at n=26A372496