50100

Appears in sequences

• Number of permutations of length n which avoid the patterns 1234, 1324, 1432.at n=9A116821
• Numbers that require exactly five chisel strokes when written in Roman numerals.at n=41A133192
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 5.at n=57A136822
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 2,0,3,0,0,0,1 for x=0,1,2,3,4,5,6.at n=5A197897
• Number of -6..6 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=12A200179
• a(n) = Sum_{i=0..n} Sum_{j=0..n} (i XOR j), where XOR is the binary logical exclusive-or operator.at n=42A224923
• Numbers n which appear at least twice in A037278(n), concatenation of their divisors written in base 10.at n=40A248323
• Expansion of 1/(-x*sqrt(4*x^2+1)-x^2+1).at n=17A271318
• Numbers that can be written as the product of two divisors greater than 1 such that the number is contained in the string concatenation of the divisors.at n=39A355790
• Number of regions in the hyperoctahedral (or cocktail party) graph of order n.at n=17A368755