56064

Appears in sequences

• a(n) = binomial(n+5,6) + binomial(n+3,3) + binomial(n+2,3) + binomial(n-1,1).at n=16A105450
• Triangle T, read by rows, where T(n,k) = [T^(2^k)](n-k,0) * (2^k)^(n-k) for n>=k>=0 such that row n of the 2^(n-1)-th root of T consists solely of integers given by: [T^( 1/2^(n-1) )](n,k) = (2^k)^(n-k) for n>=0.at n=17A134049
• a(n) = 2^n*(3*n^2 + 13*n + 8)/8.at n=10A136530
• G.f.: exp( Sum_{n>=1} A005064(n)*x^n/n ), where A005064(n) = sum of cubes of primes dividing n.at n=15A220427
• Number of (n+1) X (5+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=11A235951
• 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 598", based on the 5-celled von Neumann neighborhood.at n=15A289769
• Number of 6-cycles in the n-Sierpinski tetrahedron graph.at n=5A292545
• Triangle T(n,k) in which the n-th row encodes the inverse of a 3n+1 X 3n+1 Jacobi matrix, with 1's on the lower, main, and upper diagonals in GF(2), where the encoding consists of the decimal representations for the binary rows (n >= 1, 1 <= k <= 3n+1).at n=42A363099