100100

Appears in sequences

• a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=25A000441
• Numbers written in base of triangular numbers.at n=26A000462
• a(n) = (5*n)!/((3*n)!*n!*n!).at n=3A001451
• Squares written in base 2.at n=6A001737
• Degrees of irreducible representations of Suzuki group Suz.at n=32A003902
• Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=27A004290
• The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=36A007088
• Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added.at n=16A014417
• Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,0,0.at n=5A033146
• Number of ways to place two nonattacking queens on an n X n board.at n=21A036464
• Positive numbers having the same set of digits in base 2 and base 10.at n=31A037415
• Sums of 2 distinct powers of 10.at n=12A038444
• Numbers having four 0's in base 10.at n=27A043492
• When cubed gives number composed just of the digits 0, 1, 2, 3.at n=19A043681
• In the list of divisors of n (in binary), each digit 0-1 appears equally often.at n=4A045799
• When cubed gives number composed just of the digits 0, 1, 2, 3, 4.at n=36A048792
• Number of nonsquare rectangles on an n X n board.at n=24A052149
• Sums of two powers of 10.at n=17A052216
• Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=34A055481
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=35A066327