18362
domain: N
Appears in sequences
- Numbers k such that k*3^k - 1 is prime.at n=15A006553
- Numbers k such that the continued fraction for sqrt(k) has period 51.at n=31A020390
- If n = D0*10^0 + D1*10^1 + D2*10^2 + .. + Dk*10^k define f(n) = D0*0^10 + D1*1^10 + D2*2^10 + .. + Dk*k^10 (e.g. if n = 421 then f(n) = 4*2^10 + 2*1^10 + 1*0^10 = 4098). Sequence gives values of n such that f(n) is divisible by n.at n=13A065110
- Numbers k such that k+0, k+1, k+2, k+3, k+4, and k+5 are, in some order, 1 * a prime, 2 * a prime, ... and 6 * a prime.at n=0A071368
- Least number X such that the numbers from X to X+n-1 are, in some order, 1 * a prime, 2 * a prime, ..., n * a prime.at n=5A071373
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.at n=13A073544
- Positive square-root of terms of the self-convolution of A087150.at n=35A087151
- Number of partitions of n where odd parts are distinct or repeated once.at n=43A131945
- a(0) = 1; if a(n) is even, a(n + 1) = 5a(n)/2; if a(n) is odd, a(n + 1) is 5a(n)/2 rounded to the nearest even integer.at n=11A140832
- Number of nX7 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of elements above it, modulo 3.at n=5A239029
- Number of 6 X n 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=6A239033
- Number of compositions of n such that the smallest part has multiplicity three.at n=15A241863
- Numbers n such that A242719(n) = (prime(n))^2+1 and A242720(n) - A242719(n) = 2*(prime(n)+1).at n=22A246748
- Expansion of phi(-x^4) / (chi(-x^12) * f(-x)^2) in powers of x where phi(), chi(), f() are Ramanujan theta functions.at n=21A279476
- Numbers k such that tau(k) + ... + tau(k+5) = 28, where tau is the number of divisors function A000005.at n=8A350769
- E.g.f. A(x) satisfies: Sum_{k=0..n} [x^k/k!] 1/A(x)^(n+1-k) = 0 for n > 0.at n=9A351919
- Total number of parity changes within all partitions of [n].at n=8A363549