31165

Appears in sequences

• Number of partitions of n into 3 or more parts.at n=38A004250
• Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.at n=37A053093
• Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=31A076164
• Dimensions of the invariant subspaces in a sequence of modules of dimension (n+1)^(n-1) over the symmetric groups S_n.at n=13A108915
• 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), (-1, 1, 1), (0, 1, 1), (1, 0, -1)}.at n=10A148455
• Total number of parts of multiplicity 5 in all partitions of n.at n=44A222705
• Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=20A244069
• a(0)=0, a(1)=1, a(n) = min{3 a(k) + (3^(n-k)-1)/2, k=0..(n-1)} for n>=2.at n=37A259653
• a(n) = Fibonacci(n) represented in bijective base-6 numeration.at n=18A282237
• Number of integer partitions of n into three or more parts or into two equal parts.at n=39A349801
• a(n) is the number of paths of a chess king on square a1 to reach a position outside an 8 X 8 chessboard after n steps.at n=6A378902