25642

Appears in sequences

• Every prefix prime in base 7 (written in base 7).at n=18A024767
• Numbers n for which there are exactly ten k such that n = k + reverse(k).at n=30A072434
• Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).at n=18A074886
• Molien series for complete weight enumerators of Euclidean self-dual codes over the Galois ring GR(4,2).at n=15A099720
• Semiprimes that are the sum of 10 consecutive primes.at n=32A185347
• Number of nX7 0..2 arrays with exactly floor(nX7/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=2A222689
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=38A222690
• Number of 3Xn 0..2 arrays with exactly floor(3Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=6A222692
• Number of (n+1)X(6+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally.at n=0A232838
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally.at n=15A232839
• Number of (1+1) X (n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally.at n=5A232840
• Number of standard Young tableaux with n cells and exactly three successions.at n=8A241774
• G.f. A(x) satisfies: 2 = Sum_{n=-oo..+oo} x^(2*n) * (A(x) - x^n)^n * (1 - x^n*A(x))^n.at n=9A354963