39609

Appears in sequences

• Numbers n such that n divides 2^n + 1.at n=19A006521
• Numbers m such that m divides 10^m - 1.at n=21A014950
• Numbers k such that k | 8^k + 1.at n=24A015955
• Numbers k such that k | 11^k + 1.at n=26A015960
• Pseudo-powers to base 3: numbers k that are not powers of 3 such that k divides 2^k + 1.at n=9A016057
• "BIK" (reversible, indistinct, unlabeled) transform of 1,3,5,7...at n=10A032127
• Numbers n such that n | 6^n + 5^n + 4^n + 3^n.at n=16A057248
• Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.at n=31A057258
• Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=36A057260
• Numbers n such that n divides 2^n^2 + 1.at n=27A093546
• Numbers k that divide 2^(k^3) + 1.at n=28A093665
• The sum of the elements within a jump in a Sieve of Eratosthenes table.at n=37A179545
• Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by 4 or less and triangles differing by a constant counted only once.at n=2A195274
• T(n,k) = Number of lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by k or less and triangles differing by a constant counted only once.at n=17A195278
• Number of lower triangles of a 3 X 3 integer array with each element differing from all of its vertical and horizontal neighbors by n or less and triangles differing by a constant counted only once.at n=3A195279
• Numbers k such that 3^k - 10 is prime.at n=29A217347
• a(n) = n^3*(2*n^2+1)/3.at n=9A272125
• Terms k of A006521 such that 2*k is a term of A124240.at n=19A289257
• Number of 3 X n 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A302324
• Numbers n such that the multiplicative group of integers modulo n is isomorphic to C_m X C_m, m > 1.at n=11A305236