27608
domain: N
Appears in sequences
- Boustrophedon transform of odd numbers.at n=8A000754
- Number of primes less than 10000n.at n=31A038813
- Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/2) = 8^n, where R_n(y) forms the initial (n+1) terms of g.f. A097182(y)^(n+1).at n=31A097181
- Numbers k such that k^2 divides 15^k-1.at n=27A128395
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=48A185718
- Volume of elliptic cone (rounded down) with semi-minor axis = height = n and semi-major axis = 3*n/2.at n=25A228391
- a(n) = n*(7*n^2 + 15*n + 8)/6.at n=28A245301
- Numbers n such that n*9^n + 1 is prime.at n=2A265013
- Sum of the areas of the distinct rectangles (and the areas of the squares on their sides) with positive integer sides such that L + W = n, W < L.at n=33A294139
- Consecutive states of the linear congruential pseudo-random number generator (421*s + 17117) mod 81000 when started at s=1.at n=11A385338