Sequences
392,541 sequences
- Numbers n such that the number of squarefree numbers between prime(n) and prime(n+1) = prime(n+1)-prime(n)-1.A068361
Numbers n such that the number of squarefree numbers between prime(n) and prime(n+1) = prime(n+1)-prime(n)-1.
- Numbers n such that there are exactly 4 primes p such that floor(n*log(n))+1<=p<=floor((n+1)*log(n+1))-1.A068362
Numbers n such that there are exactly 4 primes p such that floor(n*log(n))+1<=p<=floor((n+1)*log(n+1))-1.
- Primes p such that there exists k such that p = prime(k) + prime(k+2) + prime(k+4).A068363
Primes p such that there exists k such that p = prime(k) + prime(k+2) + prime(k+4).
- Primes p such that there exists k such that p = prime(k) + prime(k+2) + prime(k+4) + prime(k+6) + prime(k+8).A068364
Primes p such that there exists k such that p = prime(k) + prime(k+2) + prime(k+4) + prime(k+6) + prime(k+8).
- Numbers k such that sigma(k) = phi((prime(k)+prime(k+1))/2).A068365
Numbers k such that sigma(k) = phi((prime(k)+prime(k+1))/2).
- Numbers k such that phi(sigma(k)+k) = sigma(k).A068366
Numbers k such that phi(sigma(k)+k) = sigma(k).
- Numbers k such that phi(k)^2+sigma(k)^2 is prime.A068367
Numbers k such that phi(k)^2+sigma(k)^2 is prime.
- Composite numbers k such that sigma(2*k+1)-sigma(k) = k+1.A068368
Composite numbers k such that sigma(2*k+1)-sigma(k) = k+1.
- Numerators of coefficients of a formal power series solution of f''(x) = f(f(x)).A068369
Numerators of coefficients of a formal power series solution of f''(x) = f(f(x)).
- Numbers n such that positive values of n-(k!) are all primes (k>1).A068370
Numbers n such that positive values of n-(k!) are all primes (k>1).
- Primes p such that positive values of p - k! are all primes for k > 1.A068371
Primes p such that positive values of p - k! are all primes for k > 1.
- Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).A068372
Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).
- Squares m such that the positive values of m - A002110(k) are all primes (k > 0).A068373
Squares m such that the positive values of m - A002110(k) are all primes (k > 0).
- Primes p such that positive values of p - A002110(k) are all primes for k > 0.A068374
Primes p such that positive values of p - A002110(k) are all primes for k > 0.
- Engel expansion of exp(2).A068375
Engel expansion of exp(2).
- Engel expansion of log(1+e).A068376
Engel expansion of log(1+e).
- Engel expansion of sinh(1).A068377
Engel expansion of sinh(1).
- Numbers n such that sigma(n)^2 > 9*sigma_2(n) where sigma_2(n) is the sum of squares over the divisors of n.A068378
Numbers n such that sigma(n)^2 > 9*sigma_2(n) where sigma_2(n) is the sum of squares over the divisors of n.
- Engel expansion of sinh(1/2).A068379
Engel expansion of sinh(1/2).
- Engel expansion of sinh(1/3).A068380
Engel expansion of sinh(1/3).
- Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets.A068381
Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets.
- Numbers k such that k divides 9^k - 1.A068382
Numbers k such that k divides 9^k - 1.
- Numbers k such that k divides 11^k - 1.A068383
Numbers k such that k divides 11^k - 1.
- a(n) is the smallest number m such that any lattice having at least m elements must have a sublattice with exactly n elements.A068384
a(n) is the smallest number m such that any lattice having at least m elements must have a sublattice with exactly n elements.
- Number of groups of order n that are not 2-generated.A068385
Number of groups of order n that are not 2-generated.
- One-thirtieth the area of the unique Pythagorean triangle whose hypotenuse is A002144(n), the n-th prime of the form 4k+1.A068386
One-thirtieth the area of the unique Pythagorean triangle whose hypotenuse is A002144(n), the n-th prime of the form 4k+1.
- Prime coefficients in the Engel expansion of Pi = prime values in A006784(n).A068387
Prime coefficients in the Engel expansion of Pi = prime values in A006784(n).
- Engel expansion of sqrt(3/2).A068388
Engel expansion of sqrt(3/2).
- Differences between the primes generating the n-th prime power.A068389
Differences between the primes generating the n-th prime power.
- Numbers k such that sigma(k) = 4*phi(k).A068390
Numbers k such that sigma(k) = 4*phi(k).
- Numbers n such that sigma(n) = 3*phi(n).A068391
Numbers n such that sigma(n) = 3*phi(n).
- Number of partitions of n X n checkerboard into two edgewise-connected sets, counting partitions equal under rotation or reflection only once.A068392
Number of partitions of n X n checkerboard into two edgewise-connected sets, counting partitions equal under rotation or reflection only once.
- Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets. Partitions equal under rotation or reflection are counted only once.A068393
Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets. Partitions equal under rotation or reflection are counted only once.
- Numbers k such that the k-th digit of Pi and the k-th digit of e are the same.A068394
Numbers k such that the k-th digit of Pi and the k-th digit of e are the same.
- a(n) = n-th prime minus its sum of digits.A068395
a(n) = n-th prime minus its sum of digits.
- n-th prime minus its reversal.A068396
n-th prime minus its reversal.
- a(n) = Lucas(n) + (-1)^n + 1.A068397
a(n) = Lucas(n) + (-1)^n + 1.
- Number of digits in (2^n)*(n!).A068398
Number of digits in (2^n)*(n!).
- Number of digits in numerator of B(2n) the Bernoulli numbers.A068399
Number of digits in numerator of B(2n) the Bernoulli numbers.
- Numbers k such that sigma(k) = phi(k*bigomega(k)).A068400
Numbers k such that sigma(k) = phi(k*bigomega(k)).
- Numbers k such that sigma(k) = phi(k+1) + phi(k-1).A068401
Numbers k such that sigma(k) = phi(k+1) + phi(k-1).
- Numbers n such that sigma(n+1) = n + phi(n).A068402
Numbers n such that sigma(n+1) = n + phi(n).
- Numbers k such that sigma(k) > 3*k.A068403
Numbers k such that sigma(k) > 3*k.
- Numbers k such that sigma(k) > 4*k.A068404
Numbers k such that sigma(k) > 4*k.
- Numbers k such that (k+1) is squarefree and composite and such that there is one more distinct prime factor in k than in (k+1).A068405
Numbers k such that (k+1) is squarefree and composite and such that there is one more distinct prime factor in k than in (k+1).
- Numbers n such that n and 2n+1 have the same number of prime divisors.A068406
Numbers n such that n and 2n+1 have the same number of prime divisors.
- Automorphic numbers: numbers k such that k^5 ends with k. Also m-morphic numbers for all m > 5 such that m-1 is not divisible by 10 and m == 1 (mod 4).A068407
Automorphic numbers: numbers k such that k^5 ends with k. Also m-morphic numbers for all m > 5 such that m-1 is not divisible by 10 and m == 1 (mod 4).
- Automorphic numbers: numbers k such that k^6 ends with k. Also m-morphic numbers for all m not congruent to 26 (mod 50) but congruent to 6 (mod 10).A068408
Automorphic numbers: numbers k such that k^6 ends with k. Also m-morphic numbers for all m not congruent to 26 (mod 50) but congruent to 6 (mod 10).
- a(n) = binomial(binomial(2*n,n),n).A068409
a(n) = binomial(binomial(2*n,n),n).
- Numbers k such that k+1 is composite and divides 3^k-2^k.A068410
Numbers k such that k+1 is composite and divides 3^k-2^k.