32887

Properties

Appears in sequences

• Numbers k such that 155*2^k+1 is prime.at n=21A032454
• Primes with multiplicative persistence value 6.at n=5A046506
• Numbers k such that k^3 is a cube whose digits occur with an equal minimum frequency of 2.at n=27A052051
• Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k peaks at height 1.at n=57A097611
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, -1, 1), (0, 1, 0), (1, 0, -1)}.at n=11A148110
• Binary transpose primes. Integers of k^2 bits which, when written row by row as a square matrix and then read column by column, are primes once transformed.at n=32A155967
• Smallest emirp with multiplicative persistence n.at n=5A157837
• Coefficients of expansion of:p(t,y)=-Exp[t/4]/(-2 + y*Exp[t/4] + y*Exp[3*t/4]).at n=34A171770
• G.f. satisfies: A(x) = exp( Sum_{n>=1} (2*A(x) + (-1)^n)^n * x^n/n ).at n=7A202519
• a(n) = 111*n^2 - 3123*n + 10753.at n=34A211607
• a(n) = n*(n-1)/2 + 2^(n-1) - 1.at n=15A335439
• a(n) = 1 + Max_{0<=i<=j<=k; i+j+k=n-1} a(i)*a(j)*a(k) for n>0, with a(0) = 1.at n=21A336631
• Odd integers k such that 5^((k-1)/2) + 1 == 0 (mod k*(k-1)/2).at n=15A337829
• E.g.f. A(x) satisfies A(x) = exp(x*(1 + x^2)*A(x)).at n=6A376577
• Prime numbersat n=3525