Sequences
392,541 sequences
- Numbers m such that floor((1+1/m)^k)=k for an integer k>1.A066661
Numbers m such that floor((1+1/m)^k)=k for an integer k>1.
- Shortest leg of a Pythagorean triangle with a hypotenuse of length 5n.A066662
Shortest leg of a Pythagorean triangle with a hypotenuse of length 5n.
- Numbers n such that phi(n) is a proper substring of n.A066663
Numbers n such that phi(n) is a proper substring of n.
- Composite numbers n whose divisors less than or equal to sqrt(n) are consecutive, from 1 up to some number k.A066664
Composite numbers n whose divisors less than or equal to sqrt(n) are consecutive, from 1 up to some number k.
- a(n) = #{(x,y) | 0<=y<=x<=n and x+y is prime}.A066665
a(n) = #{(x,y) | 0<=y<=x<=n and x+y is prime}.
- Decimal expansion of area cut out by a rotating Reuleaux triangle.A066666
Decimal expansion of area cut out by a rotating Reuleaux triangle.
- Coefficient triangle of generalized Laguerre polynomials (a=1).A066667
Coefficient triangle of generalized Laguerre polynomials (a=1).
- Signed row sums of A066667.A066668
Signed row sums of A066667.
- Numbers m such that phi(m) = 2^k*prime for some k >= 0.A066669
Numbers m such that phi(m) = 2^k*prime for some k >= 0.
- Primes arising in A066669: the only odd prime divisor of phi(A066669(n)).A066670
Primes arising in A066669: the only odd prime divisor of phi(A066669(n)).
- a(n) is the largest power of 2 that divides phi(A066669(n)).A066671
a(n) is the largest power of 2 that divides phi(A066669(n)).
- Exponent of the largest power of 2 that divides phi(A066669(n)).A066672
Exponent of the largest power of 2 that divides phi(A066669(n)).
- Smallest term x from A066669 such that phi(x) = 2^n times some prime.A066673
Smallest term x from A066669 such that phi(x) = 2^n times some prime.
- Least number m such that phi(m) = A000010(m) is divisible by the n-th prime.A066674
Least number m such that phi(m) = A000010(m) is divisible by the n-th prime.
- a(n) = A066674(n)-1 divided by the n-th prime.A066675
a(n) = A066674(n)-1 divided by the n-th prime.
- Smallest number m such that phi(m) is a multiple of n-th primorial number, the product of first n primes.A066676
Smallest number m such that phi(m) is a multiple of n-th primorial number, the product of first n primes.
- Duplicate of A061026.A066677
Duplicate of A061026.
- Totients of the least numbers for which the totient is divisible by n.A066678
Totients of the least numbers for which the totient is divisible by n.
- Numbers n such that sigma(n) is congruent to n mod phi(n).A066679
Numbers n such that sigma(n) is congruent to n mod phi(n).
- Badly sieved numbers: as in the Sieve of Eratosthenes multiples of unmarked numbers p are marked, but only up to p^2.A066680
Badly sieved numbers: as in the Sieve of Eratosthenes multiples of unmarked numbers p are marked, but only up to p^2.
- Badly sieved numbers (A066680) which are not primes.A066681
Badly sieved numbers (A066680) which are not primes.
- Indices of badly sieved numbers: a(n) = k if n = A066680(k), otherwise 0.A066682
Indices of badly sieved numbers: a(n) = k if n = A066680(k), otherwise 0.
- Number of badly sieved numbers <= n.A066683
Number of badly sieved numbers <= n.
- Numbers k such that prime(k) is congruent to sigma(k) (mod k), where prime(n) denotes the n-th prime.A066684
Numbers k such that prime(k) is congruent to sigma(k) (mod k), where prime(n) denotes the n-th prime.
- Numbers n such that p(n) is congruent to EulerPhi(n) mod n, where p(n) denotes the n-th prime.A066685
Numbers n such that p(n) is congruent to EulerPhi(n) mod n, where p(n) denotes the n-th prime.
- Array T(i,j) read by antidiagonals, where T(i,j) is the concatenation of i and j (1<=i, 1<=j).A066686
Array T(i,j) read by antidiagonals, where T(i,j) is the concatenation of i and j (1<=i, 1<=j).
- Numbers n such that prime(n) == n (mod phi(n)).A066687
Numbers n such that prime(n) == n (mod phi(n)).
- Numbers n such that p(n) is congruent to n mod sigma(n), where p(n) denotes the n-th prime.A066688
Numbers n such that p(n) is congruent to n mod sigma(n), where p(n) denotes the n-th prime.
- Least number k such that the square root of {k^2 + (Prime[n + k] - Prime[n])^2} is an integer; or 0 if no such number exists.A066689
Least number k such that the square root of {k^2 + (Prime[n + k] - Prime[n])^2} is an integer; or 0 if no such number exists.
- Odd n such that tau(n) = tau(n+2) = 10, where tau(n) = A000005(n) is the number of divisors of n.A066690
Odd n such that tau(n) = tau(n+2) = 10, where tau(n) = A000005(n) is the number of divisors of n.
- Value of tau(2n-1) when tau(2n-1) = tau(2n+1).A066691
Value of tau(2n-1) when tau(2n-1) = tau(2n+1).
- Odd numbers k such that tau(k) = tau(k+2), where tau(k) = A000005(k) is the number of divisors of k.A066692
Odd numbers k such that tau(k) = tau(k+2), where tau(k) = A000005(k) is the number of divisors of k.
- Integers whose cube root equals their number of divisors.A066693
Integers whose cube root equals their number of divisors.
- Numbers k such that phi(sigma(k)) > k.A066694
Numbers k such that phi(sigma(k)) > k.
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 12.A066695
Numbers k such that Euler phi(k) / Carmichael lambda(k) = 12.
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.A066696
Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.A066697
Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 34.A066698
Numbers k such that Euler phi(k) / Carmichael lambda(k) = 34.
- Numbers k such that binomial(2k,k)+1 is prime.A066699
Numbers k such that binomial(2k,k)+1 is prime.
- The leading digits in the terms in A067103 converge; dividing by a suitable power of 10 they converge to the number shown below; sequence gives continued fraction for this number.A066700
The leading digits in the terms in A067103 converge; dividing by a suitable power of 10 they converge to the number shown below; sequence gives continued fraction for this number.
- Triangle giving number of nonisomorphic minimal covering designs with parameters (n, k, k-1) (designs achieving the covering number C(n,k,k-1) given in A066010), for n >= 2, 2 <= k <= n.A066701
Triangle giving number of nonisomorphic minimal covering designs with parameters (n, k, k-1) (designs achieving the covering number C(n,k,k-1) given in A066010), for n >= 2, 2 <= k <= n.
- Square numbers whose reverse is triangular with the same number of digits.A066702
Square numbers whose reverse is triangular with the same number of digits.
- Triangular numbers whose reverse is a square with the same number of digits.A066703
Triangular numbers whose reverse is a square with the same number of digits.
- Triangle with a(n,k) = C(n,floor(n/k)) with n>=k>=1.A066704
Triangle with a(n,k) = C(n,floor(n/k)) with n>=k>=1.
- Greatest k < n such that phi(k) = phi(n) if such k exists, otherwise 0.A066705
Greatest k < n such that phi(k) = phi(n) if such k exists, otherwise 0.
- Numbers k that divide the average of prime(k) and prime(k+1).A066706
Numbers k that divide the average of prime(k) and prime(k+1).
- Incrementally largest terms in the continued fraction for the constant given by Sum_{k>=0} A033308(k) / 2^k = 2.89104866587305422....A066707
Incrementally largest terms in the continued fraction for the constant given by Sum_{k>=0} A033308(k) / 2^k = 2.89104866587305422....
- Least m such that n = m mod tau(m) if such m exists, otherwise 0.A066708
Least m such that n = m mod tau(m) if such m exists, otherwise 0.
- Triangle T(r,c) of winning binary "same game" templates.A066709
Triangle T(r,c) of winning binary "same game" templates.
- RATS: Reverse Add Then Sort the digits applied to previous term, starting with 3.A066710
RATS: Reverse Add Then Sort the digits applied to previous term, starting with 3.