63085

Appears in sequences

• 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, 0), (1, -1, 0), (1, 0, -1)}.at n=11A148198
• Number of partitions of n+6 with largest inscribed rectangle having area <= n.at n=37A218627
• Number of length 6+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=13A248543
• Sum of all numbers that appear when we interpret an ordered subset of [0,1,...,n] containing n as the digits, possibly larger than nine, of a base ten number, with the smallest element being the least significant.at n=3A274129
• Number of nX3 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=5A280956
• Number of nX6 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=2A280959
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=30A280961
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=33A280961
• Squarefree products of k primes that are symmetrically distributed around their average. Case k = 4.at n=28A294751
• a(n) is the number in the first column of the Trithoff (tribonacci) array that starts off the row containing the tail of n times the tribonacci sequence.at n=36A351689
• Numbers k such that A075255(k) is the square of a prime.at n=39A386954