270336

Appears in sequences

• Numbers k that divide the number of partitions of k into distinct parts (A000009).at n=27A056848
• S(n; 0,1) = S(n; 2,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=10A068711
• S(n; 0,3) = S(n; 2,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=10A068777
• S(n; 1,0) = S(n; 3,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=10A068786
• Number of strings over Z_4 of length n with trace 1 and subtrace 2.at n=10A068787
• 15-almost primes (generalization of semiprimes).at n=15A069276
• Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.at n=15A078841
• a(n)=(-1)^(n+1)*det(M(n)) where M(n) is the n X n matrix M(i,j)=min(abs(i-j),i).at n=17A080692
• Binomial transform of A084265.at n=13A084266
• Number of 4 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (10;0) and (01;1).at n=9A100313
• a(n) = 2^n*binomial(n,2).at n=12A100381
• Second differences of Mersenne primes A000668.at n=4A139232
• Second differences of Mersenne numbers A001348.at n=5A139241
• Arithmetic derivative of the double factorial of n.at n=12A168386
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 838", based on the 5-celled von Neumann neighborhood.at n=18A290547
• a(n) is the number of subsets of {1,2,...,n} that contain exactly two odd numbers.at n=23A330592
• a(0) = 1; a(n) = 2 * Sum_{k=0..floor((n-1)/2)} binomial(n-1,2*k) * a(n-2*k-1).at n=10A352279