35249

Appears in sequences

• Least composite k such that phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k) + 12n where phi is the Euler totient function and sigma is the sum of divisors function.at n=40A063519
• In decimal expansion of exp(Pi), positions of 10-digit partitions containing exactly 10 distinct digits.at n=7A104791
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-1111-1000 pattern in any orientation.at n=14A146720
• Number of planar n X n X n binary triangular grids with no more than 1 one in any 5 X 5 X 5 subtriangle.at n=12A153535
• T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=28A247927
• Number of length 1+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=7A247928
• Number of steps J. H. Conway's Fractran program needs to calculate the n-th prime.at n=9A267572