38165

Appears in sequences

• Central pentanomial coefficients: largest coefficient of (1 + x + ... + x^4)^n.at n=8A005191
• a(n)*a(n-11) = a(n-1)*a(n-10)+a(n-5)+a(n-6) with initial terms a(1)=...=a(11)=1.at n=32A133848
• D'Agapeyeff cipher.at n=25A135209
• Concatenation chain arising in A156069.at n=4A156071
• T(n,k) = largest coefficient in the expansion of (1 + ... + x^(n-1))^(2*k).at n=32A163269
• Number of 4*n X n 0..4 arrays with row sums 4 and column sums 16.at n=1A172842
• Square array read by diagonals: T(n,k) = number of arrays of n integers in -k..k with sum equal to 0.at n=43A201552
• a(n) is the number of Fibonacci meanders of length m*n and central angle 360/m degrees where m = 2.at n=12A201631
• T(n,k)=Number of zero-sum nXk -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=28A201803
• T(n,k)=Number of zero-sum nXk -2..2 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=35A201803
• 151*n^7/315+2*n^5/9+7*n^3/45+n/7.at n=5A229735
• Largest coefficient of (1+x+...+x^n)^(2*n).at n=4A270918
• a(n) = a(n-1) + a(n-2) + a([n/3]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=22A298340
• Number of partitions of n into at most 2 copies of 1, 3 copies of 2, 4 copies of 3, ... .at n=48A303939
• Number of arrays of 8 integers in -n..n with sum zero.at n=2A322535
• Composite numbers k of the form 4u+1 for which the odd part of phi(k) divides k-1.at n=22A339870
• Array read by ascending antidiagonals: the s-th column gives the central s-binomial coefficients.at n=40A349933
• Central pentanomial coefficients.at n=4A349936
• Euler transform of odd primes.at n=11A353065