Sequences

Coordination sequence for diamond structure D^+_70. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_72. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_74. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_76. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_78. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_80. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_82. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_84. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_86. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_88. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_90. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_92. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_94. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_96. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_98. (Edges defined by l_1 norm = 1.)

Coordination sequence for diamond structure D^+_100. (Edges defined by l_1 norm = 1.)

One less than number of n-multisets chosen from a 10-set.

Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.

Number of Dyck n-paths starting U^mD^m (an m-pyramid), followed by a pyramid-free Dyck path.

Maximal product of any two numbers whose concatenation is n.

Number of steps to reach 0 under "k->max product of two numbers whose concatenation is k".

Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".

Smallest number that takes n steps to reach 0 under "k->min product of 2 numbers whose concatenation is k".

Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".

Smallest number that always takes at least n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".

Number of squares in (n^3, (n+1)^3 ].

Number of partitions in parts not of the form 7k, 7k+1 or 7k-1. Also number of partitions with no part of size 1 and differences between parts at distance 2 are greater than 1.

Number of partitions in parts not of the form 7k, 7k+2 or 7k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 2 are greater than 1.

Number of partitions of n into parts not of the form 7k, 7k+3 or 7k-3. Also number of partitions such that the differences between parts at distance 2 are greater than 1.

Number of partitions in parts not of the form 9k, 9k+1 or 9k-1. Also number of partitions with no part of size 1 and differences between parts at distance 3 are greater than 1.

Number of partitions of n into parts not of the form 9k, 9k+2 or 9k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 3 are greater than 1.

Number of partitions of n into distinct prime power parts (1 and 2 excluded).

Number of partitions of n into parts not of the form 9k, 9k+4 or 9k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 3 are greater than 1.

Number of partitions in parts not of the form 11k, 11k+1 or 11k-1. Also number of partitions with no part of size 1 and differences between parts at distance 4 are greater than 1.

Number of partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1.

Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.

Number of partitions of n into parts not of the form 11k, 11k+4 or 11k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 4 are greater than 1.

Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1.

Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions of n into parts not of the form 13k, 13k+2 or 13k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions of n into parts not of the form 13k, 13k+6 or 13k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 5 are greater than 1.

Number of partitions in parts not of the form 15k, 15k+1 or 15k-1. Also number of partitions with no part of size 1 and differences between parts at distance 6 are greater than 1.

Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1.

Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.

Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1.

Number of partitions of n in which no parts are multiples of 5.

Number of partitions of n into parts not of the form 15k, 15k+6 or 15k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 6 are greater than 1.