32621

Properties

Appears in sequences

• Primes that remain prime through 3 iterations of function f(x) = 3x + 8.at n=27A023279
• Primes that remain prime through 4 iterations of function f(x) = 3x + 8.at n=4A023309
• Denominators of continued fraction convergents to sqrt(127).at n=8A041231
• Denominators of continued fraction convergents to sqrt(508).at n=10A041971
• Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 3.at n=28A050665
• Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,0 3,1 4,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155264
• a(n) = 81*n^2 - 2247*n + 15383.at n=34A182255
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,1,1 for x=0,1,2,3,4.at n=12A197540
• G.f.: A(x) = x/(1-x) o x/(1-x^3) o x/(1-x^5) o x/(1-x^7) o..., a composition of functions x/(1-x^(2*n-1)) for n=1,2,3,...at n=22A206720
• Sum of the second largest parts of the partitions of 4n into 4 parts.at n=15A241084
• a(n) = A273059(4n).at n=32A275916
• Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=40A309973
• Number of colored integer partitions of 2n using all colors of an n-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order.at n=4A327681
• Primes p such that Sum_{k=PreviousPrime(p)..p} d(k) = Sum_{k=p..NextPrime(p)} d(k), where d(k) is the number of divisors function A000005.at n=27A353552
• Prime numbersat n=3502