40088

Appears in sequences

• Numbers n such that prime(n) == -5 (mod n).at n=17A092047
• a(0)=a(1)=a(2)=a(3)=a(4)=a(5)=1; a(n)=a(n-1)+a(n-2)-a(n-4)+a(n-6) for n>=6.at n=30A109537
• Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums.at n=50A381717