27643

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=32A031785
• Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).at n=34A064125
• Numbers k such that antisigma(k) mod k = antisigma(k+1) mod (k+1).at n=9A229114
• Numbers n such that n^10+10 is prime.at n=41A239347
• Number of (n+1)X(5+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=9A250653
• Least number x such that x^n has n digits equal to k. Case k=5.at n=24A285452
• Numbers k such that bsigma(k) = bsigma(k+1), where bsigma(k) is the sum of the bi-unitary divisors of k (A188999).at n=24A293183
• a(n) = 27*2^n - 5.at n=10A304387
• Numbers k such that isigma(k) = isigma(k+1), where isigma(k) is the sum of the infinitary divisors of k (A049417).at n=26A306985
• Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).at n=41A325343
• Numbers k such that A113184(k) = A113184(k+1).at n=19A348585
• Array read by antidiagonals: T(m,n) is the number of (non-null) induced trees in the grid graph P_m X P_n.at n=38A360202
• Array read by antidiagonals: T(m,n) is the number of (non-null) induced trees in the grid graph P_m X P_n.at n=42A360202
• Numbers k such that k and k+1 have an equal sum of modified exponential divisors: A241405(k) = A241405(k+1).at n=26A379032