32077

Properties

Appears in sequences

• Number of indecomposable ground-state 3-ball juggling sequences of period n.at n=9A084519
• Primes from merging of 5 successive digits in decimal expansion of the Golden Ratio, (1+sqrt(5))/2.at n=20A103809
• Sum of labels for nodes in generation n of the sub-Fibonacci tree (A125051).at n=7A125052
• Prime numbers p such that p +- ((p-1)/6) are primes.at n=34A137724
• Eigentriangle, row sums = A084509.at n=45A145463
• a(n) = 44*n^2 + 1.at n=27A158630
• a(n) = number of 9-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..80].at n=9A178884
• Cyclops emirps.at n=38A183057
• Primes p=u^2+v^2 such that p+u or p+v is the next prime after p.at n=30A213996
• Majority value maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..3 nX4 array.at n=3A220321
• T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..3 nXk array.at n=24A220323
• T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=37A240364
• Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=7A240365
• Primes obtained by merging 5 successive digits in the decimal expansion of sqrt(2) + sqrt(3) + sqrt(5).at n=21A241221
• Primes p such that 2*p + 1 is abundant.at n=36A267476
• Primes of the form 43*n^2 - 537*n + 2971 in order of increasing nonnegative values of n.at n=33A272285
• Primes p such that 6p - 1 and 6p + 1 are twin primes and ((6p-1)^2 + (6p+1)^2) / 10 is prime.at n=24A283957
• a(n) is the smallest prime p such that the number of distinct values of the ratio (number of nonnegative m < p such that m^k == m (mod p))/(number of nonnegative m < p such that -m^k == m (mod p)) is equal to n for some nonnegative k.at n=14A340281
• Number of vertices formed in a square by straight line segments when connecting the four corner vertices to the points dividing the sides into n equal parts.at n=43A355949
• Number of terms of A372188 that do not exceed 10^n.at n=7A372190