Sequences

Number of lines through exactly 4 points of an n X n grid of points.

Number of lines through exactly 5 points of an n X n grid of points.

Number of lines through exactly 6 points of an n X n grid of points.

Number of lines through exactly 7 points of an n X n grid of points.

Number of lines through exactly 8 points of an n X n grid of points.

Number of lines through exactly 9 points of an n X n grid of points.

Number of lines through exactly 10 points of an n X n grid of points.

Number of partitions of n into divisors of n.

Binary partition function: number of partitions of n into powers of 2.

Numbers k that are the sum of m nonzero squares for all 1 <= m <= k - 14.

n is the sum of k nonzero squares for all 2 <= k <= n-14.

n is the sum of k nonzero squares for all 3 <= k <= n-14.

n is the sum of k nonzero squares for all 4 <= k <= n-14.

n is the sum of k nonzero squares for all 5 <= k <= n-14 (contains all integers >= 19 except 33).

Numbers that are not the sum of 2 nonzero squares.

Numbers n such that n is a substring of its square when both are written in base 2.

Numbers n such that n is a substring of its square in base 3 (written in base 10).

Numbers n such that n is a substring of its square (both n and n squared in base 4) (written in base 10).

Numbers n such that n is a substring of its square in base 5 (written in base 10).

Numbers n such that n is a substring of its square in base 6 (written in base 10).

Numbers n such that n is a substring of its square in base 7 (written in base 10).

Numbers n such that n is a substring of its square in base 8 (written in base 10).

Numbers n such that n is a substring of its square in base 9 (written in base 10).

Numbers k such that the decimal expansion of k^2 contains k as a substring.

Minimal number of smaller integer-sided squares that tile an n X n square.

Number of squares on infinite chessboard at <= n knight's moves from a fixed square.

Number of steps for knight to reach (n,0) on infinite chessboard.

Minimum number of steps for a knight to reach (n,n) on an infinite chessboard.

Squares on infinite chessboard at n moves from center using a {2,3} fairy knight.

Number of steps for {2,3} fairy knight to reach (n,0) on infinite chessboard.

Number of steps for {2,3} fairy knight to reach (n,n) on infinite chessboard.

Number of squares on infinite chessboard at n knight's moves from center.

Number of n-dimensional unimodular lattices without roots.

Arises from generalized Lucas-Lehmer test for primality.

Number of iterations required for the sum of n and its prime divisors = t to reach a prime (where t replaces n in each iteration) in A016837.

Strobogrammatic numbers: numbers that are the same upside down (using calculator-style numerals).

Strobogrammatic primes: the same upside down (calculator-style numerals).

Strobogrammatic squares: the same upside down (probably finite).

Strobogrammatic squares: the same upside down (calculator-style numerals).

Numbers that are the sum of 2 cubes in more than 1 way (primitive solutions).

a(n)^2 is smallest square beginning with n.

a(n)^3 is smallest cube beginning with n.

a(n)^4 is smallest fourth power beginning with n.

Smallest factorial that begins with n.

Smallest triangular number that begins with n.

2^a(n) is the smallest power of 2 beginning with n.

Smallest power of 3 that begins with n.

3^a(n) is smallest power of 3 beginning with n.

Smallest power of 4 that begins with n.

4^a(n) is smallest power of 4 beginning with n.