32531

Properties

Appears in sequences

• G.f. A(x) satisfies A(x/A(x)^5) = 1/(1-x).at n=5A145165
• a(1) = 3. For n > 1, Ulam's spiral is started with a(n-1), and the primes p on the NE spoke are considered. a(n) is the minimal p that is the lesser of a twin prime pair.at n=36A163586
• Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 7.at n=6A207098
• Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).at n=5A207104
• Pairs of consecutive primes {p,q} for which the numbers of distinct residues of all factorials mod p and mod q coincide.at n=34A210242
• a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+5) and a(1) = 1.at n=8A225920
• Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=9.at n=21A228645
• a(n) = 139*n^2 - 2307*n + 3331.at n=25A230307
• a(n+1) is the smallest prime > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(1)=5.at n=10A242906
• Number of partitions of n into 9 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=22A244245
• a(n) is the smallest prime in the interval [k*sqrt(k), k*sqrt(k+2)], where k = A001359(n), or a(n)=0 if there is no prime in this interval.at n=35A247867
• Primes of a056240-type 3.at n=20A300359
• Lesser of twin primes p, p+2 such that prime(p) and prime(p+2) are also twin primes.at n=22A332968
• Start from the sequence of primes, keep the 1st, then delete 2 primes, keep the next, delete 3 primes, keep the next, delete 5 primes, etc ...at n=42A350170
• Primes p == 3 (mod 4) such that the multiplicative order of 2+-i modulo p in Gaussian integers (A385165) is not divisible by 2 or 3.at n=35A385188
• Prime numbersat n=3490