41256

Appears in sequences

• Numbers k such that sum of 9th powers of divisors of k is divisible by the square of Euler-phi of k.at n=9A094468
• Number of n-bead necklaces labeled with numbers -3..3 not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=7A209110
• T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=52A209115
• Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 14.at n=4A233710
• Number of (n+1)X(5+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14.at n=0A233714
• T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=10A233717
• T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=14A233717
• Expansion of (1 + x) * Product_{k>=1} (1 + x^k)/(1 - x^k).at n=24A309266