52087

Appears in sequences

• To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1.at n=15A087640
• Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=41A209345
• a(n) = k is a number such that A007535(k), the smallest pseudoprime to base k ( > k), is the n-th Carmichael number.at n=13A293563