49056

Appears in sequences

• Starting index of a string of exactly 4 consecutive equal digits in decimal expansion of Pi.at n=33A049520
• a(n) = n * (2^n - 8).at n=12A083727
• a(n) = 10 + floor(Sum_{j=1..n-1} a(j) / 2).at n=21A120138
• Number of acute isosceles triangles on an n X n grid.at n=15A190317
• Half the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having exactly one duplicate clockwise edge difference.at n=2A209790
• Half the number of (n+1)X4 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=1A209791
• T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=7A209796
• T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference.at n=8A209796
• Number of (n+1) X (3+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A234916
• Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A234918
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=23A234921
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=25A234921
• a(n) = 3*(9*n - 1)*(3*n - 2).at n=25A277985
• Numbers k such that (k - digitsum(k))(k + digitsum(k)) contains k as a substring.at n=13A334249
• Triangle read by rows: T(n,k) is the total number of movable letters in all members of the k-partitions of [n], with 1 <= k <= n.at n=39A367468
• Number of ways to place k nonattacking anassas on an n X n chess board. Triangle T(n,k) read by rows.at n=48A378561