25069

Appears in sequences

• Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 5).at n=53A035566
• Number of arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1, 2, 3 or 4 with sum zero.at n=10A193703
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 2 or more, starting with 0.at n=12A221516
• Number of nX3 0..n+3-2 arrays with upper left zero and lower right n+3-2 and each element differing from its horizontal and vertical neighbors by one or two.at n=4A265442
• Number of nX5 0..n+5-2 arrays with upper left zero and lower right n+5-2 and each element differing from its horizontal and vertical neighbors by one or two.at n=2A265444
• T(n,k)=Number of nXk 0..n+k-2 arrays with upper left zero and lower right n+k-2 and each element differing from its horizontal and vertical neighbors by one or two.at n=23A265447
• T(n,k)=Number of nXk 0..n+k-2 arrays with upper left zero and lower right n+k-2 and each element differing from its horizontal and vertical neighbors by one or two.at n=25A265447
• a(n) is the smallest number such that there are exactly n numbers k (including a(n) itself) such that U(k) is isomorphic to U(a(n)) (or 0 if no such number exists). Here U(k) is the multiplicative group of integers modulo k.at n=47A303712