| .. |
|
Exponents d of powers of 2, q, such that each of q-1 and q+1 are either a power of prime or a semiprime
|
6204d7b3f2
new file: oeis-research/Fernando Solanet Mayou/a(n) is the smallest number that is (zeroless) pandigital in all bases 2 <= k <= n/prog.pl
|
2 yıl önce |
|
Integers k such that A110299(k) is prime
|
dbd6b43a72
Update.
|
1 yıl önce |
|
Integers m such that m and m+1 are terms of A111035
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
Least Lucas number with n Lucas divisors
|
cc2944c9cb
new file: oeis-research/Michel Marcus/Least Lucas number with n Lucas divisors/faster_prog.sf
|
2 yıl önce |
|
Least integer k such that the inverse of sum of inv(phi(k+j)) for j=1..n is an integer
|
481117cbe7
new file: oeis-research/Michel Marcus/Least integer k such that the inverse of sum of inv(phi(k+j)) for j=1..n is an integer/prog.sf
|
3 yıl önce |
|
Least number k such that the concatenation of k composites from composite(n) is prime
|
91c27fa2a3
new file: oeis-research/Thomas Ordowski/a(n) is the smallest number k with n prime factors such that p + div(k,p) is prime for every prime p | k/prog.pl
|
3 yıl önce |
|
Number of Lucas divisors of the n-th Lucas number
|
ef72816214
Update. Generated all the Lucas-Carmichael < 10^14 with 7 or more prime factors.
|
2 yıl önce |
|
Prime p for which the continued fraction expansion of sqrt(p) has exactly n consecutive 1's starting at position 2
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
Primes p such that the greatest common divisor of 2^p+1 and 3^p+1 is composite
|
1f708937fd
new file: oeis-research/Michel Marcus/Primes p such that the greatest common divisor of 2^p+1 and 3^p+1 is composite/check.sf
|
2 yıl önce |
|
Primes where every 0-splitting is prime
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
Smallest m such that gcd of the x's that satisfy sigma(x) = m is n
|
6aed7a3c01
Update.
|
3 yıl önce |
|
Smallest m such that the m-th Lucas number has exactly n divisors that are also Lucas numbers
|
cc2944c9cb
new file: oeis-research/Michel Marcus/Least Lucas number with n Lucas divisors/faster_prog.sf
|
2 yıl önce |
|
Smallest number k such that sigma(sigma(k)) >= n*k
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
Sum of first k divisors equal j+1 for non-squares of primes
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
Sum of the numbers of divisors of gcd(x,y) with x*y <= n
|
4d085c9032
Remove commit history
|
4 yıl önce |
|
a(n) is the least integer m such that M(m) is divisible by prime(n)^2 or -1 if no such m exists
|
665e7e9d26
new file: oeis-research/Donovan Johnson/Smallest number m such that sigma(m) has exactly n distinct prime factors/upper-bounds.sf
|
2 yıl önce |
trizen