38700

Appears in sequences

• Numbers k such that 7*10^k + 3*R_k - 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=24A103055
• Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k.at n=38A129575
• Number of (n+1) X 2 0..2 arrays with no 2 X 2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum.at n=3A185848
• Number of (n+1)X5 0..2 arrays with no 2X2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=0A185851
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=6A185856
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum.at n=9A185856
• Numbers with prime factorization pq^2r^2s^2.at n=21A189344
• Number of (n+1) X (2+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2 X 2 subblock.at n=4A236049
• Number of (n+1)X(5+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=1A236052
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=16A236055
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=19A236055
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood.at n=38A271202
• Exponential pseudoperfect numbers (A318100) that are not e-perfect (A054979).at n=36A321206
• Exponential admirable numbers: numbers k such that there is a proper exponential divisor d of k such that esigma(k) - 2*d = 2*k, where esigma is the sum of exponential divisors function (A051377).at n=34A336680
• Numbers with exactly 9 semiprime divisors.at n=36A350416
• Exponential unitary abundant numbers: numbers k such that A322857(k) > 2*k.at n=33A383693
• Exponential squarefree exponential abundant numbers: numbers k such that A361174(k) > 2*k.at n=32A383697
• Numbers that have exactly three exponents in their prime factorization that are equal to 2.at n=40A386798
• Cubefree exponential abundant numbers: cubefree numbers k for which A051377(k) > 2*k.at n=29A391427