| .. |
|
Carmichael numbers n such that n-1 is a perfect power
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Composite integers n such that the sum of the Pell numbers is divisible by n
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Integers n such that n-th prime divides the n-th golden rectangle number
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Integers n such that the n-th prime divides the n-th Pell number
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Least k such that k is the product of n distinct primes and sigma(k) is an n-th power
|
cbedf2c758
new file: oeis-research/Altug Alkan/Least k such that k is the product of n distinct primes and sigma(k) is an n-th power/smooth_generate_almost_primes.pl
|
%!s(int64=3) %!d(string=hai) anos |
|
Least k such that k^n + 1 is the product of n distinct primes
|
7d83987246
Update.
|
hai 9 meses |
|
Least k such that phi(k) is an n-th power when k is the product of n distinct primes
|
9303a08f23
Update.
|
hai 1 ano |
|
Least k such that sigma(k) is a Fibonacci number when k is the product of n distinct primes
|
147f6207b2
Update.
|
hai 1 ano |
|
Least prime p such that p^n + 1 is the product of n distinct primes
|
7bbb8b9505
Update.
|
hai 1 ano |
|
Smallest k such that psi(k) and phi(k) have same distinct prime factors when k is the product of n distinct primes
|
61449f48a1
Update.
|
hai 9 meses |
|
a(n) is the smallest k such that psi(k) = factorial(n)
|
61449f48a1
Update.
|
hai 9 meses |
|
a(n) is the smallest k such that usigma(k) = primorial(n)
|
03d527b095
new file: oeis-research/Altug Alkan/a(n) is the smallest k such that usigma(k) = primorial(n)/upper-bounds.sf
|
%!s(int64=3) %!d(string=hai) anos |
