Sequences

Number of partitions of n into 3 distinct parts from [ 1,18 ].

Number of partitions of n into 3 distinct parts from [ 1,19 ].

Number of partitions of n into 3 distinct parts from [ 1,20 ].

Related to triple factorial numbers 2*A034000(n+1).

Number of 'zig-zag' self-avoiding walks on an n X n lattice from a corner to opposite one.

Maximum length of 'zig-zag' self avoiding walk on an n X n lattice from a corner to opposite one.

Product of primes == 1 (mod 7) and cubes of primes == 2 or 4 (mod 7).

Disjoint discriminants (one form per genus) of type 2 (doubled).

Disjoint discriminants (one form per genus) of type 2.

Disjoint discriminants (one form per genus) of type 1.

Related to triple factorial numbers A007559(n+1).

Nearest integer to n!/(2*log(2)^(n+1)).

a(n) is minimal such that prime factorizations of a(n), ..., a(n)+n-1 have same exponents.

a(n) is minimal such that prime factorizations of a(n)-n+1, ..., a(n) have same exponents.

a(n) is minimal such that a(n)+a(n-1) is a square and a(n) is not in {a(0), ..., a(n-1)}.

One third of quartic factorial numbers.

a(n) is the n-th quartic factorial number divided by 4.

Number of solutions to n = a^2 - b^2, a > b >= 0.

Difference between two positive cubes in more than one way.

Numbers m with property that rotating digits of m right gives k*m + 1 for some k >= 1.

Numbers n with property that rotating digits of n right gives kn - 1 for some k >= 1.

Number of not-necessarily-symmetric n X 2 crossword puzzle grids.

Erroneous version of A003216.

Not necessarily symmetric n X 3 crossword puzzle grids.

Number of symmetric n X 3 crossword puzzle grids.

Number of symmetric n X 4 crossword puzzle grids.

Not necessarily symmetric n X 4 crossword puzzle grids.

Number of binary codes of length 3 with n words.

Number of binary codes of length 4 with n words.

Number of binary codes of length 5 with n words.

Number of binary codes of length 6 with n words.

Number of binary codes of length 7 with n words.

Number of binary codes of length 8 with n words.

Number of binary codes of length 9 with n words.

Number of binary codes of length 10 with n words.

Number of binary codes of length 11 with n words.

Number of binary codes of length 12 with n words.

Number of binary codes (not necessarily linear) of length n with 3 words.

Number of binary codes (not necessarily linear) of length n with 4 words.

Number of binary codes (not necessarily linear) of length n with 5 words.

Number of binary codes (not necessarily linear) of length n with 6 words.

Number of binary codes (not necessarily linear) of length n with 7 words.

Number of binary codes (not necessarily linear) of length n with 8 words.

Number of binary codes (not necessarily linear) of length n with 9 words.

Number of binary codes (not necessarily linear) of length n with 10 words.

Number of binary codes (not necessarily linear) of length n with 11 words.

Number of binary codes (not necessarily linear) of length n with 12 words.

Number of binary codes (not necessarily linear) of length n with 13 words.

Number of binary codes (not necessarily linear) of length n with 14 words.

Number of binary codes (not necessarily linear) of length n with 15 words.