183183
domain: N
Appears in sequences
- Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.at n=35A079095
- Triangle, read by rows, of numbers T(n,k), 0 <= k <= n, given by T(n,k) = A000364(n-k)*binomial(2*n, 2*k).at n=32A086646
- Values of n such that n^6 + 29450922301244534 is prime.at n=14A119276
- 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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 0, -1), (1, 0, 0)}.at n=11A148704
- Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4, 5 or 6 (n >= 0, 0 <= k <= 6n).at n=33A151359
- Triangle T(n,k) read by rows: coefficients (in compressed forms) in order of decreasing exponents of polynomials p_n(t) related to Hultman numbers.at n=44A185263
- Number of ascent sequences of length n with exactly ten flat steps.at n=5A242163
- Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 3 (mod p-1), where s_p(m) is the sum of the base p digits of m.at n=22A324405