Sequences

List of numbers whose binary expansion does not begin 10.

Numbers n whose binary expansion does not begin with 11.

Numbers whose binary expansion does not begin 100.

Numbers whose binary expansion does not begin 101.

Numbers whose binary expansion does not begin 110.

Numbers whose binary expansion does not begin 111.

Numbers whose binary expansion ends 01.

a(n) = 4*n + 3.

Binary expansion ends 001.

Numbers whose binary expansion ends in 011.

Numbers of the form 8k+5; or, numbers whose binary expansion ends in 101.

a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.

Numbers that are not congruent to 1 (mod 4).

Numbers congruent to {0, 1, 2} mod 4: a(n) = floor(4*n/3).

Numbers n whose binary expansion does not end in 001.

Numbers k such that the binary expansion of k does not end in 011.

Numbers not congruent to 5 (mod 8).

Numbers not congruent to 7 mod 8.

Where records occur in A038548.

Binary expansion contains 3 adjacent 0's.

Binary expansion contains 2 adjacent 1's.

Binary expansion contains 3 adjacent 1's.

Numbers k such that 2*(2k-3)!/(k!*(k-1)!) is an integer.

Numbers k such that 3!*(2k-4)!/(k!*(k-1)!) is an integer.

Numbers k such that 4!*(2k-5)!/(k!*(k-1)!) is an integer.

5!(2n-6)!/n!(n-1)! is an integer.

Numbers k such that 6!*(2*k-7)!/(k!*(k-1)!) is an integer.

Numbers k such that 7!*(2k-8)!/(k!*(k-1)!) is an integer.

Number of distinct prime divisors of the numbers in row n of Pascal's triangle.

Least k such that number of distinct prime divisors of the numbers in row k of Pascal's triangle is n.

Numbers k >= 2 such that if 1 < j < k then (fractional part of log k) < (fractional part of log j).

Numbers k >= 2 such that if 1 <= j < k then fractional part of log k > fractional part of log j.

Erroneous version of A003278.

a(1)=1, a(2)=3; a(n) is least k such that no three terms of a(1), a(2), ..., a(n-1), k form an arithmetic progression.

Least positive integer k such that the fractional part of k*sqrt(5) has its n initial partial quotients all equal to 1.

Least positive unitary linear combination of distinct numbers in row n of Pascal's triangle; i.e., least positive sum of form d(0)C(n-1,0) + d(1)C(n-1,1) + ...+ d(m)C(n-1,m), d(i)=+-1, m = floor((n+1)/2).

Numbers k such that if 2 <= j < k then the fractional part of the k-th partial sum of the harmonic series is < the fractional part of the j-th partial sum of the harmonic series.

Convolution of A002024 with itself.

Convolution of Fibonacci numbers 1,2,3,5,... with themselves.

Self-convolution of Lucas numbers.

Sum of 11 positive 9th powers.

Sum of 12 positive 9th powers.

Numbers that are the sum of 2 nonzero 10th powers.

Numbers that are the sum of 3 nonzero 10th powers.

Numbers that are the sum of 4 nonzero 10th powers.

Numbers that are the sum of 5 positive 10th powers.

Numbers that are the sum of 6 positive 10th powers.

Numbers that are the sum of 7 positive 10th powers.

Numbers that are the sum of 8 positive 10th powers.

Numbers that are the sum of 9 positive 10th powers.