31591

Appears in sequences

• Number of partitions of n into parts not of the form 19k, 19k+2 or 19k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 8 are greater than 1.at n=46A035971
• Numerator(1+1/prime(1)^3+ ... + 1/prime(n)^3) where prime(k) is the k-th prime.at n=3A075987
• Iccanobirt numbers (15 of 15): a(n) = R(R(a(n-1)) + R(a(n-2)) + R(a(n-3))), where R is the digit reversal function A004086.at n=19A102125
• Iccanobirt semiprimes (15 of 15): Semiprime numbers in A102125.at n=3A102205
• Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=35A105276
• The first 10 digits of the fifth root of n contain the digits 0-9.at n=16A119520
• a(n) = (Sum_{k=1..A047380(n)} k^6) / (Sum_{k=1..A047380(n)} k^2).at n=9A133180
• a(n) = 13 + 165*n + 756*n^2 + 1470*n^3 + 1029*n^4.at n=2A134159
• G.f.: A(x) = Sum_{n>=0} x^n / Product_{d|n} (1 - x^d)^(n/d).at n=15A193201
• Reversals of tribonacci numbers (sorted).at n=20A215649
• Least integer b>2n+1 such that the numbers written as [1,3,...,2n-1,2n+1] and [2n+1,2n-1,...,3,1] in base b are both prime.at n=21A218465
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo n and the upper left element equal to 0.at n=48A267019
• Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any northeast or northwest neighbors modulo 4 and the upper left element equal to 0.at n=6A267023