Sequences

Number of partitions of n into parts 8k+3 or 8k+6.

Number of partitions of n into parts 4k-1.

Number of partitions of n into parts 8k+4 or 8k+5.

Number of partitions of n into parts 8k+4 or 8k+6.

Number of partitions of n into parts 8k+4 or 8k+7.

Number of partitions of n into parts 8k+5 or 8k+6.

Number of partitions of n into parts 8k+5 or 8k+7.

Number of partitions of n into parts 8k+6 or 8k+7.

Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.

Number of ways to break {1,2,3,...,n} into sets with equal sums.

Coordination sequence for lattice D*_4 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_6 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_8 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_10 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_12 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_14 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_16 (with edges defined by l_1 norm = 1).

Coordination sequence for lattice D*_18 (with edges defined by l_1 norm = 1).

(-1)sigma sequence: a(n) = (-1)sigma(a(n-1)), where if (-1)sigma(k) = A049060(k) and a(1) = 624.

Pseudoperfect numbers (A005835) that are not practical (second definition, A007620).

Number of n X n symmetric matrices whose first row is 1..n and whose rows and columns are all permutations of 1..n.

Number of n X n symmetric matrices each of whose rows is a permutation of 1..n.

Number of 2n X 2n symmetric matrices whose first row is 1..2n and whose rows and columns are all permutations of 1..2n.

Numbers n such that fractional part of e^(Pi*sqrt(n)) > 0.99.

Card on top of deck at n-th stage of R. K. Guy's shuffling problem.

Kimberling's expulsion array read by antidiagonals.

Second column of Stolarsky array.

3rd column of Stolarsky array.

Main diagonal of the Stolarsky array.

Step at which card n appears on top of deck for first time in Guy's shuffling problem A035485.

Relevant part of deck in Guy's shuffling problem (A035485): row n of the table lists the first 2n "cards" (numbers) after the n-th shuffle.

Position of card 1 after n-th shuffle in Guy's shuffling problem (A035485).

Order in which new cards appear on top of deck in Guy's shuffling problem A035485.

Order in which record high new cards appear for first time on top of deck in Guy's shuffling problem A035485.

Number of musical scales consisting of n notes.

Numbers of the form x*y^2 + y*z^2 + z*x^2, x,y,z >= 1.

Happy primes: primes that eventually reach 1 under iteration of "x -> sum of squares of digits of x".

Least largest sequence of consecutive primes (17) of form 4k+3.

Turns at which card 1 surfaces in Guy's shuffling problem (A035485).

Shuffles at which new cards appear on top of deck in Guy's shuffling problem A035485.

Shuffles at which new record high cards appear on top of deck in Guy's shuffling problem A035485.

Lower of pair of consecutive happy numbers.

Upper of pair of consecutive happy numbers.

Numbers that eventually reach 1 under "x -> sum of cubes of digits of x".

Active part of Kimberling's expulsion array as a triangular array.

Stolarsky array read by antidiagonals.

Inverse Stolarsky array read by antidiagonals.

a(n) = Fibonacci(2*n+2) - 1.

Main diagonal of Inverse Stolarsky array.

2nd column of Inverse Stolarsky array.