Sequences

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 23.

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 26.

Trajectory of 1 under the morphism 0 -> 11, 1 -> 10; parity of 2-adic valuation of 2n: a(n) = A000035(A001511(n)).

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m = 29.

One half of deca-factorial numbers.

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 35.

Indices of nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 37.

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 38.

Indices of nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 41.

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 43.

Indices of the nonzero terms in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m= 47.

One third of deca-factorial numbers.

One quarter of deca-factorial numbers.

One fifth of deca-factorial numbers.

One sixth of deca-factorial numbers.

One seventh of deca-factorial numbers.

One eighth of deca-factorial numbers.

One ninth of deca-factorial numbers.

One tenth of deca-factorial numbers.

Smallest of largest of n distinct numbers around circle so that every 2 neighbors x,y have x|y or y|x.

Fourier coefficients of T_4.

Expansion of zeta function of icosian ring (nonzero terms).

Expansion of zeta function of ring H(Q(sqrt(2))).

Similar submodules of icosian ring of index f(n)^2 where f(n) is the n-th positive integer represented by the quadratic form x^2 + xy - y^2.

Similar submodules in cubian ring of index f(n)^2 where f(n) is the n-th positive integer represented by the quadratic form x^2 - 2 y^2.

Number of ways to place a non-attacking white and black king on n X n chessboard.

Number of ways to place a non-attacking white and black rook on n X n chessboard.

Number of ways to place a non-attacking white and black bishop on n X n chessboard.

Number of ways to place a non-attacking white and black knight on n X n chessboard.

Number of ways to place a non-attacking white and black pawn on n X n chessboard.

Number of ways to place a non-attacking white and black queen on n X n chessboard.

Number of similar sublattices of Z^4 of index n^2.

Fourier coefficients of T_6.

Number of ways to partition 2n into distinct positive integers.

Expansion of sum ( q^n / product( 1-q^k, k=1..3*n), n=0..inf ).

Expansion of sum ( q^n / product( 1-q^k, k=1..4*n), n=0..inf ).

Expansion of sum ( q^n / product( 1-q^k, k=1..5*n), n=0..inf ).

Expansion of sum ( q^n / product( 1-q^k, k=1..6*n), n=0..inf ).

Minimum square grid needed to fit English words for 1...n crossword style.

Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+4} (1 - q^k)).

Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+5} (1 - q^k)).

a(n+1)=2a(n)-4a(n-1)+4a(n-2).

Divisors of 3600.

Decimal part of a(n)^(1/n) starts with a pandigital anagram (digits 0 through 9 in some order).

Minimum sum of n distinct positive numbers, any n-1 of which sum to a square.

List prime factors of each number in order (each prime factor is followed by its power). Start with 1 = {1,1}.

a(n) is the least integer such that every even unimodular lattice in dimension 8n contains some vectors of all even (squared) norm >= 2*a(n).

Expansion of 1/(1-100*x)^(1/10), related to deca-factorial numbers A045757.

Triangle read by rows giving number of ways to glue sides of a 2n-gon so as to produce a surface of genus g.

Let f(n) = number of ways to factor n = A001055(n); a(n) = sum of f(k) over all terms k in A025487 that have n factors.