45890

Appears in sequences

• a(n) = 1681*n^2 - 2606*n + 1010.at n=5A157110
• Number of (n+1) X 2 0..3 arrays containing all values 0..3 with every 2 X 2 subblock having one or three distinct values, and new values 0..3 introduced in row major order.at n=4A210302
• Number of (n+1)X6 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or three distinct values, and new values 0..3 introduced in row major order.at n=0A210306
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or three distinct values, and new values 0..3 introduced in row major order.at n=10A210309
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or three distinct values, and new values 0..3 introduced in row major order.at n=14A210309
• Numbers which are the sum of two squared primes in exactly three ways (ignoring order).at n=19A226562
• Numbers k such that (29*10^k - 77)/3 is prime.at n=25A280942
• Sum over all partitions of n into distinct parts of the LCM of the parts.at n=27A306956
• Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k and with sum of digits of k = n, or 0 if no such k exists.at n=25A333666
• Numbers k such that A064839(k) = A064839(k+1).at n=13A343133
• Number of polynomials of degree n over GF(2) in which the degrees of all distinct irreducible factors are distinct.at n=16A351915