21096

Appears in sequences

• Number of isomorphism classes of connected 3-regular multigraphs of order 2n, loops allowed.at n=6A005967
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=28A084277
• Numbers k such that k^2 = x^3 + y^4 with positive integers x, y.at n=29A087209
• Number of subsets of {1, ..., n} that are double-free or sum-free.at n=17A088813
• Expansion of phi(-q^5) / phi(-q) in powers of q where phi() is a Ramanujan theta function.at n=26A138526
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=5A208284
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=50A208287
• Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A208290
• a(n) = pg(3, n) + pg(4, n) + ... + pg(n, n) where pg(m, n) is the n-th m-th-order polygonal number.at n=18A241452
• Expansion of phi(q^5) / phi(q) in powers of q where phi() is a Ramanujan theta function.at n=26A261968
• Numbers n such that x^n * (x+1)^(n-1) + 1 is irreducible over GF(2).at n=22A268274
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=29A272541
• a(n) = a(n-1) + a(n-2) + a([n/3]) + a([2n/3]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=16A298345
• Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z.at n=34A358735