31576

Appears in sequences

• a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,1,4.at n=17A049867
• Triangle T(n,k) giving number of 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).at n=63A059684
• Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.at n=16A064962
• Number of 1X6 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 1 zero-sum 6-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=16A192693
• Positive integers m such that pi(m^2) = pi(j^2) + pi(k^2) for no 0 < j <= k < m.at n=55A262408
• Expansion of Product_{k>=2} (1 + x^Fibonacci(k))^Fibonacci(k).at n=34A291650
• Number of partitions of n containing a prime number of distinct primes and an arbitrary number of nonprimes.at n=41A344715
• Number of partitions of prime(n) containing a prime number of distinct primes and an arbitrary number of nonprimes.at n=12A344890
• Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square, using only a compass.at n=27A372980