| .. |
|
Added edits
|
4d085c9032
Remove commit history
|
3 years ago |
|
Agrawal's conjecture pseudoprimes
|
4d085c9032
Remove commit history
|
3 years ago |
|
Alternating sum of the Mertens function
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Carmichael numbers k such that k+1 is divisible by gpf(k)+1
|
4d085c9032
Remove commit history
|
3 years ago |
|
Carmichael numbers k where records occur for gcd(k-1, lambda(k))
|
77b570a69c
new file: oeis-research/Charles R Greathouse IV/Smallest k such that 2^(2^n) - 2^k - 1 is prime/search.sf
|
3 years ago |
|
Carmichael numbers n where records occur for gpf(n) divided by lpf(n)
|
e2569b03ac
Added several more scripts.
|
5 months ago |
|
Carmichael numbers n where records occur for lpf(n) divided by gpf(n)
|
e2569b03ac
Added several more scripts.
|
5 months ago |
|
Carmichael-Lucas-Carmichael almost numbers
|
77b570a69c
new file: oeis-research/Charles R Greathouse IV/Smallest k such that 2^(2^n) - 2^k - 1 is prime/search.sf
|
3 years ago |
|
Chernick-Carmichael numbers
|
4d085c9032
Remove commit history
|
3 years ago |
|
Chernick-Carmichael numbers with 4 or more prime factors
|
4d085c9032
Remove commit history
|
3 years ago |
|
Chernick-Carmichael numbers with k factors
|
4d085c9032
Remove commit history
|
3 years ago |
|
Cubic recurence sequence
|
4d085c9032
Remove commit history
|
3 years ago |
|
Difference of 0's and 1's in middle of binary digits
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Digit scrambling sequences
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Dirichlet convolution of 2^omega(n)*mu(n)^2 with the positive integers
|
4d085c9032
Remove commit history
|
3 years ago |
|
Emirps
|
4d085c9032
Remove commit history
|
3 years ago |
|
Factor sequences
|
4d085c9032
Remove commit history
|
3 years ago |
|
Fast PARI program with moebius
|
4d085c9032
Remove commit history
|
3 years ago |
|
Fermat factors
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Fermat pseudoprimes of the form p*((p-1)*n + 1)
|
4d085c9032
Remove commit history
|
3 years ago |
|
Generalized class of primes
|
4d085c9032
Remove commit history
|
3 years ago |
|
Incrementally largest numbers n that are the product of primes p such that p+1 divides n
|
4d085c9032
Remove commit history
|
3 years ago |
|
Irregular triangle read by rows of integers k such that n AND k != k, for k = 1..n
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Irregular triangle read by rows of integers k such that n AND k = k, for k = 1..n
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
Large smooth semiprime
|
4d085c9032
Remove commit history
|
3 years ago |
|
Least non-palindromic number k such that k and its digital reversal both are the product of n distinct primes
|
fc775e378b
Update.
|
1 year ago |
|
Least number k such that A002277(k) has exactly n distinct prime factors
|
a38dc6d971
Update.
|
1 year ago |
|
Limit for pi ÷ 4
|
4d085c9032
Remove commit history
|
3 years ago |
|
Liouville sum
|
4d085c9032
Remove commit history
|
3 years ago |
|
Moebius transform of dedekind
|
4d085c9032
Remove commit history
|
3 years ago |
|
Number k such that tau(k) equals the number of solutions to sigma(x) = k
|
4d085c9032
Remove commit history
|
3 years ago |
|
Number of distinct prime factors of sigma(sigma_n(n))
|
c62dbc2a9d
modified: factordb/auto.sf -- try to factor n, before failling
|
2 years ago |
|
Number of primes factors of the n-th n-powerful number
|
4d085c9032
Remove commit history
|
3 years ago |
|
Numbers k such that (prime(k) - composite(k)) == 0 (mod k)
|
4d085c9032
Remove commit history
|
3 years ago |
|
Numbers k such that phi(k) = factorial of sum of digits of k
|
4d085c9032
Remove commit history
|
3 years ago |
|
Numbers n such that omega(sigma(n,n)) = bigomega(sigma(n,n))
|
532ff31203
Update.
|
2 years ago |
|
Numbers n such that sigma(n)+1 divides n*(tau(n)+1)
|
098de59794
new file: oeis-research/Daniel Lignon/Composite numbers for which the harmonic mean of proper divisors is an integer/generate_special_form.sf
|
3 years ago |
|
OEIS Conjecture
|
4d085c9032
Remove commit history
|
3 years ago |
|
Odd squarefree composite integers n such that prev_prime(p)-1 | n-1 and next_prime(p)-1 | n-1 for every p|n
|
1c2f2be108
new file: oeis-research/Daniel Suteu/Odd squarefree composite integers n such that prev_prime(p)-1 | n-1 and next_prime(p)-1 | n-1 for every p|n/prog.pl
|
2 years ago |
|
Other
|
df529e2f1d
Update.
|
1 year ago |
|
Other programs
|
4d085c9032
Remove commit history
|
3 years ago |
|
Palindromic pseudoprimes in base n
|
4d085c9032
Remove commit history
|
3 years ago |
|
Partial sums of 2^(bigomega(n) - omega(n))
|
4d085c9032
Remove commit history
|
3 years ago |
|
Partial sums of dirichlet convolution of the prime characterstic function with itself
|
4d085c9032
Remove commit history
|
3 years ago |
|
Partial sums of inverse moebius transform of 2^bigomega(n)
|
4d085c9032
Remove commit history
|
3 years ago |
|
Partial sums of moebius inversion of (-1)^omega
|
4d085c9032
Remove commit history
|
3 years ago |
|
Partial sums of sums of prime powers
|
4d085c9032
Remove commit history
|
3 years ago |
|
Pi search related sequences
|
4d085c9032
Remove commit history
|
3 years ago |
|
Records of sigma0 for p^2-1
|
4d085c9032
Remove commit history
|
3 years ago |
|
Reversal of prime p is composite in all bases 2..n
|
4d085c9032
Remove commit history
|
3 years ago |
|
Riemann prime counting function
|
4d085c9032
Remove commit history
|
3 years ago |
|
Romanian numbers
|
4d085c9032
Remove commit history
|
3 years ago |
|
Sierpiński triangle
|
4d085c9032
Remove commit history
|
3 years ago |
|
Smallest Carmichael number (A002997) with n prime factors that is also a strong pseudoprime to base 2 (A001262)
|
fb63999afb
All the Lucas-Carmichael numbers up to 10^15.
|
6 months ago |
|
Smallest Carmichael number such that gpf(p-1) = prime(n)
|
4d085c9032
Remove commit history
|
3 years ago |
|
Smallest Fermat base-2 pseudoprime such that gpf(p-1) = prime(n)
|
4d085c9032
Remove commit history
|
3 years ago |
|
Smallest base-n strong Fermat pseudoprime with n distinct prime factors
|
df529e2f1d
Update.
|
1 year ago |
|
Smallest number k > 0 such that bigomega(k^n + 1) = n
|
57ec8c5a4b
new file: oeis-research/Daniel Suteu/Smallest number k > 0 such that bigomega(k^n + 1) = n/prog.sf
|
5 months ago |
|
Smallest number k > 1 such that bigomega(k^n - 1) = n
|
57ec8c5a4b
new file: oeis-research/Daniel Suteu/Smallest number k > 0 such that bigomega(k^n + 1) = n/prog.sf
|
5 months ago |
|
Smallest overpseudoprime to base 2 (A141232) with n distinct prime factors
|
375c48c0ee
Update.
|
1 year ago |
|
Smallest palindrome with n prime factors
|
7bbfb84b82
new file: oeis-research/Daniel Suteu/Smallest palindrome with n prime factors/prog.sf
|
3 years ago |
|
Smallest squarefree palindrome with exactly n distinct palindromic prime factors
|
a38dc6d971
Update.
|
1 year ago |
|
Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2
|
df529e2f1d
Update.
|
1 year ago |
|
Surprising chaotic finite sequence
|
34bbd45cb3
Recompress images.
|
8 months ago |
|
TODO
|
c65520f481
Update.
|
1 year ago |
|
a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1)
|
8fc34c482e
Update.
|
1 year ago |
