45207

Appears in sequences

• Number of ways n*(n-1) can be partitioned into the sum of 2*(n-1) integers in the range 0..n.at n=9A039744
• a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.at n=37A048235
• Numbers k such that if you subtract k from its reversal you get a positive number with the same digits as k.at n=16A121970
• The bisection A053445(2n+1).at n=32A161921
• Number of nondecreasing arrangements of n numbers in -8..8 with sum zero.at n=8A183916
• Number of strictly increasing arrangements of n numbers in -(n+3)..(n+3) with sum zero.at n=8A188177
• T(n,k)=Number of nondecreasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero.at n=44A188211
• Number of length n 0..4 arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=6A244899
• T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=51A244903
• Number of length 7 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=3A244910
• Number of left-labeled (3,n)-bipartite graphs.at n=16A370081