3603601

Appears in sequences

• Smallest number that is centered polygonal in exactly n ways.at n=31A063773
• a(n) is the smallest b > 1 such that when c is equal to any of the first n composites the congruence b^(c-1) == 1 (mod c) is satisfied, i.e., smallest b larger than 1 such that any member of the set of smallest n composites is a base-b Fermat pseudoprime.at n=15A309383