32989

Appears in sequences

• Composite numbers n such that k! == 1 (mod n) for some k > 2.at n=29A049048
• Highest proper factor of n!-1, or a(n)=1 if n!-1 is not composite.at n=7A056110
• Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.at n=38A059720
• Second diagonal of A059720.at n=6A059724
• Let p = n-th prime; sequence gives ((p-2)!-1)/p.at n=4A066161
• Denominators of convergents to Pi/2.at n=5A096463
• Expansion of g.f.: (1 + x^2 - x^3)/(1 - x - x^2 + x^3 - x^5).at n=29A147604
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as of [2, 3, 2].at n=10A211300
• Pierce Expansion of coth(1).at n=14A280093
• Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by their sum of primes of parts.at n=50A330953