66366

Appears in sequences

• Number of unsensed planar maps with n edges.at n=8A006385
• Numbers having four 6's in base 10.at n=15A043516
• Palindromes which are the concatenation of 3 or more terms of an arithmetic sequence with nonzero difference.at n=4A062564
• Palindromes in A082939.at n=35A082940
• Number of triangular partitions of n.at n=34A089647
• Number of free generators of degree n of symmetric polynomials in 4 noncommuting variables.at n=10A124292
• Number of n X 3 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=16A238807
• Number of length n+5+2 0..5 arrays with every value 0..5 appearing at least once in every consecutive 5+3 elements, and new values 0..5 introduced in order.at n=5A242320
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 5 6 or 8.at n=7A252467
• 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 3 5 6 or 8.at n=37A252473
• Numbers k such that k multiplied by the sum of reciprocals of digits is the digit reversal of k.at n=13A309654
• a(n) = n * (7*binomial(n, 2) + 1).at n=27A329530
• a(n) = 6*(10^(2*n+1)-1)/9 - 3*10^n.at n=2A332163
• Triangle read by rows: T(n,k) is the number of unsensed combinatorial maps with n edges and genus k, 0 <= k <= floor(n/2).at n=20A379439