36744

Appears in sequences

• Numbers k such that 225*2^k+1 is prime.at n=42A032489
• Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.at n=13A079941
• Denominators of the convergents of the continued fraction for log(2).at n=13A079943
• Number of ON cells at n-th stage of three-dimensional version of the cellular automaton A160410, using cubes.at n=21A160428
• Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8.at n=42A161342
• Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=34A261719
• Expansion of Product_{k>=1} (1 + k^3*x^k).at n=9A265840
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 389", based on the 5-celled von Neumann neighborhood.at n=38A271596
• Number of nX4 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=5A276244
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=41A276248
• Number of 6Xn 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=3A276252
• Number of 5-cycles in the n-triangular honeycomb obtuse knight graph.at n=35A290391
• Number of partitions of n where each part i is marked with a word of length i over a senary alphabet whose letters appear in alphabetical order and all six letters occur at least once in the partition.at n=1A293370
• Number of non Wilf and non conjugate Wilf integer partitions of n.at n=41A383530