85086

Appears in sequences

• a(n) is the least multiple of n such that a(n) = 1 mod k for all integers k with 1 < k < n and k relatively prime to n.at n=17A055006
• Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n.at n=4A071555
• Number of (7+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=33A250661
• Sum of the squarefree parts of the partitions of n into 7 parts.at n=41A309482
• Row 3 of A328464: a(n) = A276156(8n - 4) / 6.at n=16A328466
• Triangle read by rows: T(n,k) = (A002110(n) + A002110(k)) / A002110(k), 1 <= k <= n.at n=22A370135