34254

Appears in sequences

• a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).at n=43A087787
• For a given unrestricted partition pi, let P(pi)=lambda(pi), if mu(pi)=0. If mu(pi)>0 then let P(pi)=nu(pi), where nu(pi) is the number of parts of pi greater than mu(pi), mu(pi) is the number of ones in pi and lambda(pi) is the largest part of pi.at n=42A100818
• Number of 2's in the last section of the set of partitions of n.at n=45A182712
• Number of 2's in all partitions of 2n+1 that do not contain 1 as a part.at n=22A182717
• Sum over each antidiagonal of A244306.at n=22A244307
• Number of 5-cycles in the n-triangular honeycomb bishop graph.at n=10A290775
• Trajectory of n under the Reverse and Add! operation carried out in base 8 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=40A306596
• Sum of the largest parts in the partitions of n into 7 parts.at n=39A308933
• a(n) = binomial(2*n,n)*(2*n+1)/2+n*binomial(2*n-2,n)+(n-1)*binomial(2*n-2,n+1).at n=6A344228
• Least k such that k*A000668(n)*A000668(n+2) + 1 is prime, where A000668(n) is the n-th Mersenne prime.at n=19A365063