31599

Appears in sequences

• Numbers k such that 2^k mod k = 2^k mod k^2.at n=40A068535
• Wieferich numbers (1): n > 1 such that 2^A000010(n) == 1 (mod n^2).at n=8A077816
• Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=25A125773
• Expansion of g.f. x*(x^4 - 5*x^3 + 10*x^2 - 12*x + 4)/((1-x)^2*(1 - 3*x + 2*x^2 - x^3)).at n=12A129080
• Numbers m such that m^2 divides 2^k - 1 for some k, 0 < k <= m.at n=14A246503
• Numbers n > 1 such that 2^m == 1 (mod n^2), where m = A002326((n-1)/2).at n=7A265630
• Numbers n such that uphi(n) = uphi(n+1), where uphi(n) is the unitary totient function (A047994).at n=34A287055
• Numbers n > 1 such that 2^lambda(n) == 1 (mod n^2), where lambda(n) is the Carmichael lambda function (A002322).at n=8A291961
• Numbers k such that k^2 | A038199(k).at n=38A317475
• Numbers k such that iphi(k) = iphi(k+1), where iphi(k) is an infinitary analog to the Euler totient function (A091732).at n=29A326403
• Numbers k such that the ring of integers of Q(2^(1/k)) is not Z[2^(1/k)].at n=36A342390
• Numbers k such that A384247(k) = A384247(k+1).at n=40A385743