262136

Appears in sequences

• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^8-M)/7, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=31A096042
• a(n) = n^6 - n.at n=8A131473
• a(n) = 8*(2^n - 1).at n=14A159741
• a(n) = sigma(n*2^(n-1)).at n=13A176362
• Monotonic ordering of nonnegative differences 4^i-8^j, for 40>= i>=0, j>=0.at n=32A192167
• a(n) = T(9,n), array T given by A047858.at n=14A195857
• Number of idempotent n X n 0..3 matrices of rank n-1.at n=7A224328
• T(n,k)=Number of idempotent n X n 0..k matrices of rank n-1.at n=52A224333
• Fibonacci 16-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-16).at n=19A249169
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=17A279151
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 259", based on the 5-celled von Neumann neighborhood.at n=17A280369
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=17A287598
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 329", based on the 5-celled von Neumann neighborhood.at n=17A287716
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood.at n=34A287850