89111

Appears in sequences

• a(n) = 5*n^4 - 10*n^3 + 20*n^2 - 15*n + 11.at n=11A115565
• Starting at n, a(n) is the number of times we travel to a position already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=25A324674
• Number of integer partitions of n whose augmented differences are an aperiodic word.at n=45A329136
• Number of integer partitions of n into three or more parts or into two equal parts.at n=45A349801
• Numbers with easy multiplication table - the first 9 multiples of these numbers can be derived by either incrementing or decrementing the corresponding digits from the previous multiple.at n=38A359925
• Number of integer partitions of n with more than one part of least multiplicity.at n=46A362609