56643

Appears in sequences

• Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.at n=39A074889
• Sum(prime(k),k=1..n)^2-1.at n=12A092780
• G.f.: [Sum_{n>=0} x^(n*(n+1)/2) * (1+x)^n ]^3.at n=44A182152
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=6A252451
• Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=1A252456
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=29A252457
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=34A252457
• Variation on Fermat's Diophantine m-tuple: 1 + the GCD of any two distinct terms is a square.at n=26A274697
• Least common multiple of 7*n+1 and 7*n-1.at n=34A282286
• G.f. satisfies A(x) = exp( Sum_{k>=1} A(x^k) * x^k/(k * (1 - 2*x^k)) ).at n=9A363545