20416

Appears in sequences

• Expansion of 2-AGM(1,1-8x) (where AGM denotes the arithmetic-geometric mean).at n=7A075225
• Binomial transform of A081250.at n=7A084213
• a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).at n=40A087787
• 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=39A100818
• Number of 2's in the last section of the set of partitions of n.at n=42A182712
• Number of 2's in all partitions of 2n that do not contain 1 as a part.at n=21A182716
• Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=2A234550
• Number of (n+1) X (3+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=0A234552
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=3A234555
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=5A234555
• Start with a single pentagon; at n-th generation add a pentagon at each expandable vertex (this is the "vertex to side" version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=11A247904
• a(n) = n*((4*n + 1)*(7*n - 4) + 15*n*(-1)^n)/48.at n=32A302766
• Number of binary words of length n with an even number of occurrences of the subword 0101.at n=15A332052
• Expansion of e.g.f. 1/(1 + log(1 - x))^4.at n=5A354123
• Total number of parts coprime to n in the partitions of n into 9 parts.at n=38A363327
• a(n) = phi(12^n+1), where phi is Euler's totient function (A000010).at n=4A366716