58975

Appears in sequences

• a(n) = 4^n - 3^n.at n=8A005061
• From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=12A019593
• Nexus numbers (n+1)^8 - n^8.at n=3A022524
• Number of n X 8 binary arrays with a path of adjacent 1's from top row to bottom row.at n=1A069383
• First subdiagonal of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.at n=17A131023
• Triangle read by rows: 3-Stirling numbers of the second kind.at n=37A143495
• a(n) = 2*a(n-1)+3*a(n-2)-6*a(n-3) starting a(0)=a(1)=0, a(2)=1.at n=16A167762
• a(n) = 2^n - A108411(n).at n=16A167936
• Difference of two positive 8th powers.at n=4A181127
• a(3*n+1) = 4^(2^n), a(3*n+2) = 3^(2^n), a(3*n+3) = 4^(2^n) - 3^(2^n).at n=11A181355
• Monotonic ordering of nonnegative differences 2^i-9^j, for 40>=i>=0, j>=0.at n=46A192122
• Monotonic ordering of nonnegative differences 4^i-3^j, for 40>=i>=0, j>=0.at n=41A192148
• Monotonic ordering of nonnegative differences 4^i-9^j, for 40>= i>=0, j>=0.at n=23A192169
• Triangular array read by rows, T(n,k) is the number of functions from {1,2,...,n} into {1,2,...,n} with maximum value of k.at n=31A199656
• Number of second differences of arrays of length n + 2 of numbers in 0..3.at n=5A228213
• T(n,k)=Number of second differences of arrays of length n+2 of numbers in 0..k.at n=33A228218
• Number of second differences of arrays of length 8 of numbers in 0..n.at n=2A228223
• Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=33A229439
• Inverse Moebius transform of A000056.at n=41A350156
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row.at n=37A359576