39804

Appears in sequences

• A simple grammar: power set of pairs of sequences.at n=26A052812
• Enneagonal numbers whose sum of digits is also enneagonal.at n=14A117051
• Enneagonal numbers for which the product of the digits is also an enneagonal number.at n=37A117052
• Enneagonal numbers for which both the sum of the digits and the product of the digits are also enneagonal numbers.at n=5A117053
• a(n) = 4*n*(n^2 + 2)/3.at n=31A217873
• Even numbers such that the sum of the even divisors and the sum of the odd divisors are a square or a cube.at n=29A263695
• a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + 2*a(n-4) + a(n-5) -2*a(n-6) + a(n-7) for n >= 7, a(0) = 2, a(1) = 4, a(2) = 7, a(3) = 11, a(4) = 18, a(5) = 30, a(6) = 47.at n=22A289077
• Number of nX2 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=8A298189
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=46A298195
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=46A299008
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=46A299089
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero.at n=46A299345
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=46A299675
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=46A299753
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=46A299852
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=46A300267
• Total number of partitions of [n-s] whose block maxima sum to s, summed over all s.at n=40A368102
• Numbers k such that sigma(k) = psi(k) + tau(k)^3.at n=11A390297