| .. |
|
Abundant Carmichael numbers
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Chernick-Carmichael number n prime factors
|
0831d580a7
new file: oeis-research/Amiram Eldar/Chernick-Carmichael number n prime factors/search for a(12)/new_sieve.jl
|
4 mesi fa |
|
Colltaz with sqrt(3) or 3
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Composite numbers (pseudoprimes) n, that are not Carmichael numbers, such that A000670(n) == 1 (mod n)
|
c65520f481
Update.
|
1 anno fa |
|
Consecutive numbers whose sum of divisors has the same set of distinct prime divisors
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Least k > 1 such that sigma(k) * phi(k) is an n-th perfect power
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Least number k such that A046660(k) = A046660(k+1) = n
|
7762fb86b8
Update.
|
1 anno fa |
|
Least number k such that A048105(k) = A048105(k+1) = 2*n, and 0 if it does not exist
|
63fa61a709
new file: oeis-research/Amiram Eldar/Numbers k such that A168512(2^k) is a prime number/search.pl
|
3 anni fa |
|
Least number k such that there are exactly n cubefull numbers between k^3 and (k+1)^3
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Least start of a run of exactly n successive powerful numbers that are pairwise coprime
|
d745679c7a
new file: oeis-research/Amiram Eldar/Least start of a run of exactly n successive powerful numbers that are pairwise coprime/generate.pl
|
2 mesi fa |
|
Least super-Poulet number with n distinct prime factors
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Let k be the n-th perfect number, a(n) is the least number m such that k*d*m + 1 is prime for all of the proper divisors d of k so their product is a Carmichael number
|
e743bcaf8d
Update.
|
2 mesi fa |
|
Lexicographically earliest sequence of numbers whose partial products are all Fermat pseudoprimes to base 2
|
d745679c7a
new file: oeis-research/Amiram Eldar/Least start of a run of exactly n successive powerful numbers that are pairwise coprime/generate.pl
|
2 mesi fa |
|
Lexicographically earliest sequence of prime numbers whose partial products, starting from the second, are all Fermat pseudoprimes to base 2
|
d745679c7a
new file: oeis-research/Amiram Eldar/Least start of a run of exactly n successive powerful numbers that are pairwise coprime/generate.pl
|
2 mesi fa |
|
Lexicographically earliest strictly increasing sequence of prime numbers whose partial products, starting from the second, are all Fermat pseudoprimes to base 2
|
d745679c7a
new file: oeis-research/Amiram Eldar/Least start of a run of exactly n successive powerful numbers that are pairwise coprime/generate.pl
|
2 mesi fa |
|
Number of abundant numbers < 10^n
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Number of primitive abundant numbers (A071395) < 10^n
|
f2bf689bee
new file: oeis-research/Amiram Eldar/Number of primitive abundant numbers (A071395) < 10^n/generate.sf
|
7 mesi fa |
|
Numbers k such that A168512(2^k) is a prime number
|
63fa61a709
new file: oeis-research/Amiram Eldar/Numbers k such that A168512(2^k) is a prime number/search.pl
|
3 anni fa |
|
Numbers k such that F(k), F(k+1) and F(k+2) have the same binary weight (A000120), where F(k) is the k-th Fibonacci number (A000045)
|
fcddb391e4
new file: oeis-research/Amiram Eldar/Numbers k such that F(k), F(k+1) and F(k+2) have the same binary weight (A000120), where F(k) is the k-th Fibonacci number (A000045)/prog.pl
|
2 anni fa |
|
Numbers k such that gpf(k)^2 | k and gpf(k+1)^3 | (k+1)
|
5ba72472ed
new file: oeis-research/Amiram Eldar/The number of terms of A354558 that are <= 10^n/generate.pl
|
2 anni fa |
|
Numbers k such that gpf(k)^2 | k and gpf(k+1)^4 | (k+1)
|
61d886d542
new file: oeis-research/Amiram Eldar/Numbers k such that gpf(k)^2 | k and gpf(k+1)^3 | (k+1)/prog.pl
|
2 anni fa |
|
Numbers k such that gpf(k)^3 | k and gpf(k+1)^2 | (k+1)
|
5ba72472ed
new file: oeis-research/Amiram Eldar/The number of terms of A354558 that are <= 10^n/generate.pl
|
2 anni fa |
|
Numbers k such that gpf(k)^4 | k and gpf(k+1)^2 | (k+1)
|
b0ea968d14
Update.
|
1 anno fa |
|
Numbers k such that k and k+1 are both divisible by the cube of their largest prime factor
|
4550c46226
modified: oeis-research/Amiram Eldar/Numbers k such that k and k+1 are both divisible by the cube of their largest prime factor/prog.pl -- generalized for any p^n
|
2 anni fa |
|
Numbers k such that the arithmetic mean of the first k squarefree numbers is an integer
|
e348ccff91
new file: oeis-research/Amiram Eldar/Numbers k such that the arithmetic mean of the first k squarefree numbers is an integer/prog.pl
|
2 anni fa |
|
Numbers m such that sigma(m) is a Lucas number
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Numbers n such that n = pi(n) + uphi(n)
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Numbers n such that sigma(n) and sigma(n)-n are both triangular numbers
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Numbers that are both infinitary and noninfinitary harmonic numbers
|
4712bb29eb
new file: oeis-research/Amiram Eldar/Numbers that are both infinitary and noninfinitary harmonic numbers/prog.sf
|
2 anni fa |
|
Numbers that are both unitary and nonunitary harmonic numbers
|
60e0bb0097
new file: oeis-research/Amiram Eldar/Numbers that are both unitary and nonunitary harmonic numbers/prog.sf
|
2 anni fa |
|
Numbers that are not powers of primes whose harmonic mean of their proper unitary divisors is an integer
|
10422cfa68
new file: oeis-research/Tomohiro Yamada/Quadratically perfect numbers/prog.sf
|
3 anni fa |
|
Odd numbers that are not safe primes such that p-1 | k-1 or k-1 | p-1 for every prime p | 2^(k-1)-1
|
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 anni fa |
|
Poulet numbers with a record number of divisors that are also Poulet numbers
|
df529e2f1d
Update.
|
1 anno fa |
|
Poulet numbers with records of abundancy
|
4d085c9032
Remove commit history
|
4 anni fa |
|
Quadratic Mersenne primes for alpha = 2 + sqrt(2)
|
4c6de3b172
new file: pseudoprimes/oeis-pseudoprimes/fermat_with_small_znorder.txt
|
2 anni fa |
|
Semi-unitary perfect numbers
|
4d085c9032
Remove commit history
|
4 anni fa |
|
The number of terms of A354558 that are <= 10^n
|
ddbb6ebad1
modified: oeis-autoload/oeis.pl -- support for tables
|
2 anni fa |
|
Unitary harmonic numbers (A006086) that are not unitary arithmetic numbers (A103826)
|
c2abdafba4
new file: oeis-research/Amiram Eldar/Unitary harmonic numbers (A006086) that are not unitary arithmetic numbers (A103826)/smooth_combinations_search.pl
|
2 anni fa |
|
a(n) is the least number k such that gpf(k)^n | k and gpf(k+1)^n | (k+1)
|
ddbb6ebad1
modified: oeis-autoload/oeis.pl -- support for tables
|
2 anni fa |
|
a(n) is the least number k such that the n-th odd squarefree divides lcm(1..k) over denom(harmonic(k))
|
d7a70e0ab2
modified: oeis-research/Amiram Eldar/a(n) is the least number k such that the n-th odd squarefree divides lcm(1..k) over denom(harmonic(k))/prog.sf
|
3 anni fa |
|
a(n) is the least start of exactly n consecutive numbers k that are sqrt(k)-smooth (A048098), or -1 in no such run exists
|
e348ccff91
new file: oeis-research/Amiram Eldar/Numbers k such that the arithmetic mean of the first k squarefree numbers is an integer/prog.pl
|
2 anni fa |
|
a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1
|
5e55b458a1
new file: oeis-research/Amiram Eldar/a(n) is the minimum number of distinct numbers with exactly n prime factors (counted with multiplicity) whose sum of reciprocals exceeds 1/prog.pl
|
1 mese fa |
|
bi-unitary divisors sum constant
|
4d085c9032
Remove commit history
|
4 anni fa |
