20695

Appears in sequences

• Sums of 7 distinct powers of 3.at n=38A038469
• Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.at n=33A091235
• Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=26A263311
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood.at n=38A271123
• Number of partitions p of n such that (number of numbers in p that have multiplicity 1) >= (number of numbers in p having multiplicity > 1).at n=39A330145
• a(n) = A000523(A372444(n)); One less than the length of binary expansion of the n-th iterate of 27 with A371094.at n=13A372449