31911

Appears in sequences

• In the '3x+1' problem, these values for the starting value set new records for highest point of trajectory before reaching 1.at n=16A006884
• a(n)= 4*a(n-1) +13*a(n-2) -44*a(n-3) -57*a(n-4) +120*a(n-5) +63*a(n-6) -56*a(n-7) +6*a(n-8).at n=5A121798
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, 0, 1)}.at n=8A150502
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,3,2,0,1 for x=0,1,2,3,4.at n=7A197085
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,3,2,0,1 for x=0,1,2,3,4.at n=47A197090
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,3,2,0,1 for x=0,1,2,3,4.at n=52A197090
• Least m such that the Collatz (3x+1) iteration of m has exactly n increasing peak values.at n=24A221470
• Number of partitions of n with difference -4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=48A242688
• Number of length-n 0..2 arrays with no repeated value unequal to the previous repeated value plus one mod 2+1.at n=10A268938
• Total number of partitions of k*n into 3 parts for k = 1..n.at n=15A343124
• Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts).at n=44A361394