24160

Appears in sequences

• a(n) = A000203(n) * A024916(n).at n=26A143238
• Expansion of x/(1 - 4*x + 6*x^2 - 5*x^3 + 4*x^4 - 3*x^5).at n=16A144897
• (n^(p-1) - 1)/p^2 mod p, where p is the first prime that divides (n^(p-1) - 1)/p.at n=14A178814
• Numbers of the form 4^j + 6^k, for j and k >= 0.at n=47A226813
• Number of length n+2 0..4 arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=4A248457
• T(n,k)=Number of length n+2 0..k arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=32A248461
• Number of length 5+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.at n=3A248466
• Number of (n+3)X(3+3) 0..1 arrays with each row divisible by 11 and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=2A263286
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 11 and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=12A263288
• Number of (3+3)X(n+3) 0..1 arrays with each row divisible by 11 and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=2A263291
• a(n) is the initial transient (converted to base 10), before the periodic part, on the n-th diagonal from the left of rule-30 1-D cellular automaton, when started from a single ON cell, or -1 if there is no transient part.at n=27A364241
• a(n) = phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041).at n=42A366581
• Number of binary min-heaps on n elements from the set {0,1} that give a max-heap when reversed.at n=34A379272
• Numbers of the form h^i + k^j where h,i,j,k are distinct positive integers and max{h,i,j,k} - min{h,i,j,k} = 3.at n=36A391670