Sequences
392,541 sequences
- a(n) is the difference between the largest and the smallest positive integers x such that the number of unitary-prime-divisors of x! equals n. Same as the difference between the largest and the smallest positive integers x such that the number of primes in (x/2,x] equals n.A080361
a(n) is the difference between the largest and the smallest positive integers x such that the number of unitary-prime-divisors of x! equals n. Same as the difference between the largest and the smallest positive integers x such that the number of primes in (x/2,x] equals n.
- a(n) is the number of positive integers x such that the number of unitary-prime-divisors of x! equals n. Same as the number of positive integers x such that the number of primes in (x/2,x] equals n.A080362
a(n) is the number of positive integers x such that the number of unitary-prime-divisors of x! equals n. Same as the number of positive integers x such that the number of primes in (x/2,x] equals n.
- Nonprime numbers k such that the largest prime divisor of k is unitary.A080363
Nonprime numbers k such that the largest prime divisor of k is unitary.
- Composite numbers whose least prime factor appears with multiplicity 1.A080364
Composite numbers whose least prime factor appears with multiplicity 1.
- Composite numbers k whose smallest and largest prime factors are unitary prime factors.A080365
Composite numbers k whose smallest and largest prime factors are unitary prime factors.
- Numbers k whose least and greatest prime divisors are non-unitary.A080366
Numbers k whose least and greatest prime divisors are non-unitary.
- Largest unitary prime divisor of n or a(n) = 0 if no such prime divisor exists.A080367
Largest unitary prime divisor of n or a(n) = 0 if no such prime divisor exists.
- a(n) is the least unitary prime divisor of n, or 0 if no such prime divisor exists.A080368
a(n) is the least unitary prime divisor of n, or 0 if no such prime divisor exists.
- a(n) is the value of Vandermonde determinant for lexicographically earliest n-mark Golomb-ruler.A080369
a(n) is the value of Vandermonde determinant for lexicographically earliest n-mark Golomb-ruler.
- Number of distinct values among the differences prime(j)-prime(i), 1 <= i < j <= n.A080370
Number of distinct values among the differences prime(j)-prime(i), 1 <= i < j <= n.
- a(n) is the smallest x such that the quotient d(x+1)/d(x) equals n, where d = A000005.A080371
a(n) is the smallest x such that the quotient d(x+1)/d(x) equals n, where d = A000005.
- a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.A080372
a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.
- a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2.A080373
a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2.
- a(n)=lcm of first n consecutive prime differences.A080374
a(n)=lcm of first n consecutive prime differences.
- Distinct values of A080374, where A080374(n) is the lcm of the first n consecutive prime differences.A080375
Distinct values of A080374, where A080374(n) is the lcm of the first n consecutive prime differences.
- Numbers where A080374 increases.A080376
Numbers where A080374 increases.
- Prime gaps where A080374 increases.A080377
Prime gaps where A080374 increases.
- Residues mod 4 of the n-th difference between consecutive primes.A080378
Residues mod 4 of the n-th difference between consecutive primes.
- Least n such that n consecutive values in A080378 equals 2; i.e., exactly n differences between consecutive primes give residues 2 when divided by 4.A080379
Least n such that n consecutive values in A080378 equals 2; i.e., exactly n differences between consecutive primes give residues 2 when divided by 4.
- Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.A080380
Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.
- Triangle read by rows: gcd(binomial(n,floor(n/2)), binomial(n,i)), i=0..n; greatest common divisor of binomial coefficients and corresponding central binomial coefficient.A080381
Triangle read by rows: gcd(binomial(n,floor(n/2)), binomial(n,i)), i=0..n; greatest common divisor of binomial coefficients and corresponding central binomial coefficient.
- Triangle read by rows: T(n,k) = C(n,floor(n/2))/gcd(C(n,floor(n/2)),C(n,k)), k=0..n; central binomial coefficient is divided by greatest common divisor of binomial coefficients and corresponding central binomial coefficient.A080382
Triangle read by rows: T(n,k) = C(n,floor(n/2))/gcd(C(n,floor(n/2)),C(n,k)), k=0..n; central binomial coefficient is divided by greatest common divisor of binomial coefficients and corresponding central binomial coefficient.
- Number of j (0 <= j <= n) such that the central binomial coefficient C(n,floor(n/2)) = A001405(n) is divisible by C(n,j).A080383
Number of j (0 <= j <= n) such that the central binomial coefficient C(n,floor(n/2)) = A001405(n) is divisible by C(n,j).
- Numbers k such that there are exactly 6 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 6.A080384
Numbers k such that there are exactly 6 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 6.
- Numbers k such that there are exactly 7 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 7.A080385
Numbers k such that there are exactly 7 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 7.
- Numbers k such that there are exactly 8 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 8.A080386
Numbers k such that there are exactly 8 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 8.
- Numbers k such that there are exactly 10 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 10.A080387
Numbers k such that there are exactly 10 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 10.
- Erroneous version of A057977.A080388
Erroneous version of A057977.
- Numbers n such that gcd( n+1, binomial(n, floor(n/2)) ) = 1.A080389
Numbers n such that gcd( n+1, binomial(n, floor(n/2)) ) = 1.
- Least k such that gcd(k+1, binomial(k, k/2)) = n.A080390
Least k such that gcd(k+1, binomial(k, k/2)) = n.
- Number of integers among the following n+1 quotients: A001405(n)/A001405(k), k=0,..,n. Number of values k for which the n-th central binomial coefficient is divisible by the k-th central binomial coefficient for 0<=k=n.A080391
Number of integers among the following n+1 quotients: A001405(n)/A001405(k), k=0,..,n. Number of values k for which the n-th central binomial coefficient is divisible by the k-th central binomial coefficient for 0<=k=n.
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.A080392
Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.
- a(n) is the smallest integer such that A080383(a(n)) = n.A080393
a(n) is the smallest integer such that A080383(a(n)) = n.
- Numbers k such that binomial(k, floor(k/2)) is divisible by k^2.A080394
Numbers k such that binomial(k, floor(k/2)) is divisible by k^2.
- Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.A080395
Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.
- Largest squarefree numbers dividing the binomial coefficients C(n,k) read by row, 0<=k<=n. Squarefree kernel of Pascal triangle.A080396
Largest squarefree numbers dividing the binomial coefficients C(n,k) read by row, 0<=k<=n. Squarefree kernel of Pascal triangle.
- Largest squarefree number dividing central binomial coefficient A000984(n).A080397
Largest squarefree number dividing central binomial coefficient A000984(n).
- Largest squarefree number dividing sum of divisors of n.A080398
Largest squarefree number dividing sum of divisors of n.
- Largest squarefree number dividing sum of squares of divisors of n.A080399
Largest squarefree number dividing sum of squares of divisors of n.
- Largest squarefree number dividing phi(n).A080400
Largest squarefree number dividing phi(n).
- Numbers k such that the sum of the squares of the divisors of k (A001157(k)) is squarefree.A080401
Numbers k such that the sum of the squares of the divisors of k (A001157(k)) is squarefree.
- Numbers k such that the sum of the squares of the divisors of k (A001157(k)) is not squarefree.A080402
Numbers k such that the sum of the squares of the divisors of k (A001157(k)) is not squarefree.
- Numbers n such that both A000203(n) and A001157(n) are squarefree: sum of divisors and squares of divisors of n are squarefree.A080403
Numbers n such that both A000203(n) and A001157(n) are squarefree: sum of divisors and squares of divisors of n are squarefree.
- a(n)=A007947[A055932(n)]; the sequence consists of primorial numbers;.A080404
a(n)=A007947[A055932(n)]; the sequence consists of primorial numbers;.
- Number of distinct primes dividing n-th Catalan number.A080405
Number of distinct primes dividing n-th Catalan number.
- Boustrophedon transform of the continued fraction of Pi (cf. A001203).A080406
Boustrophedon transform of the continued fraction of Pi (cf. A001203).
- Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of Pi (A080406, A001203) is interpreted as a continued fraction.A080407
Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of Pi (A080406, A001203) is interpreted as a continued fraction.
- Boustrophedon transform of the continued fraction of e (A003417).A080408
Boustrophedon transform of the continued fraction of e (A003417).
- Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of e (A080408, A003417) is interpreted as a continued fraction.A080409
Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of e (A080408, A003417) is interpreted as a continued fraction.
- Boustrophedon transform of the continued fraction of the Euler-Mascheroni constant, gamma (A001620).A080410
Boustrophedon transform of the continued fraction of the Euler-Mascheroni constant, gamma (A001620).