Sequences
392,541 sequences
- a(3) = 5; a(n) = min(x>1,x^2+x*n+n^2 = 1 mod(x+n)).A066461
a(3) = 5; a(n) = min(x>1,x^2+x*n+n^2 = 1 mod(x+n)).
- Numbers k such that phi(sigma(phi(k))) = sigma(k).A066462
Numbers k such that phi(sigma(phi(k))) = sigma(k).
- Numbers k such that phi(sigma(phi(k))) = phi(k).A066463
Numbers k such that phi(sigma(phi(k))) = phi(k).
- Least number k such that k has n anti-divisors.A066464
Least number k such that k has n anti-divisors.
- Numbers k such that sigma(phi(sigma(k))) = phi(k).A066465
Numbers k such that sigma(phi(sigma(k))) = phi(k).
- Numbers having just one anti-divisor.A066466
Numbers having just one anti-divisor.
- Numbers having just two anti-divisors.A066467
Numbers having just two anti-divisors.
- Numbers having just three anti-divisors.A066468
Numbers having just three anti-divisors.
- Numbers having exactly four anti-divisors.A066469
Numbers having exactly four anti-divisors.
- Numbers having exactly five anti-divisors.A066470
Numbers having exactly five anti-divisors.
- Numbers k such that sigma(phi(sigma(k))) = sigma(k).A066471
Numbers k such that sigma(phi(sigma(k))) = sigma(k).
- Numbers having exactly six anti-divisors.A066472
Numbers having exactly six anti-divisors.
- Numbers having exactly seven anti-divisors.A066473
Numbers having exactly seven anti-divisors.
- Numbers having exactly eight anti-divisors.A066474
Numbers having exactly eight anti-divisors.
- Numbers having exactly nine anti-divisors.A066475
Numbers having exactly nine anti-divisors.
- Numbers having exactly ten anti-divisors.A066476
Numbers having exactly ten anti-divisors.
- Numbers having exactly eleven anti-divisors.A066477
Numbers having exactly eleven anti-divisors.
- Numbers having exactly twelve anti-divisors.A066478
Numbers having exactly twelve anti-divisors.
- a(n) = min( x : x^3+n^3+x^2+n^2+x+n=1 mod(x+n)).A066479
a(n) = min( x : x^3+n^3+x^2+n^2+x+n=1 mod(x+n)).
- Start of first run of exactly n consecutive integers with same number of anti-divisors.A066480
Start of first run of exactly n consecutive integers with same number of anti-divisors.
- Largest anti-divisor of n.A066481
Largest anti-divisor of n.
- The smallest anti-divisor of n.A066482
The smallest anti-divisor of n.
- Erroneous version of A062239, numbers n with property that every digit is a prime factor of n.A066483
Erroneous version of A062239, numbers n with property that every digit is a prime factor of n.
- Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.A066484
Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.
- Numbers n such that f(n) is a strict local extremum for the prime gaps function f(n) = prime(n+1)-prime(n), where prime(n) denotes the n-th prime; i.e., either f(n)>f(n-1) and f(n)>f(n+1) or f(n)<f(n-1) and f(n)<f(n+1).A066485
Numbers n such that f(n) is a strict local extremum for the prime gaps function f(n) = prime(n+1)-prime(n), where prime(n) denotes the n-th prime; i.e., either f(n)>f(n-1) and f(n)>f(n+1) or f(n)<f(n-1) and f(n)<f(n+1).
- a(n) = min( x : x^3 + n^3 == 0 mod (x+n-1) ).A066486
a(n) = min( x : x^3 + n^3 == 0 mod (x+n-1) ).
- a(n) = min( x : x^4 + n^4 = 0 mod (x+n-1) ).A066487
a(n) = min( x : x^4 + n^4 = 0 mod (x+n-1) ).
- Composite numbers k which divide A001045(k-1).A066488
Composite numbers k which divide A001045(k-1).
- Binary expansion of n followed by its reverse complement.A066489
Binary expansion of n followed by its reverse complement.
- Number of primes of the form 4m+3 that are <= n.A066490
Number of primes of the form 4m+3 that are <= n.
- Twin prime gaps: Pairs k, k+1 such that f(k) = f(k+1), where f is the prime gaps function given by f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime.A066491
Twin prime gaps: Pairs k, k+1 such that f(k) = f(k+1), where f is the prime gaps function given by f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime.
- a(n) = A056524(n)/11.A066492
a(n) = A056524(n)/11.
- a(n) = least k such that f(k) = n, where f is the prime gaps function given by f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.A066493
a(n) = least k such that f(k) = n, where f is the prime gaps function given by f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.
- Numbers n such that prime(n+1) - prime(n) = phi(n).A066494
Numbers n such that prime(n+1) - prime(n) = phi(n).
- Numbers k such that f(k) = f(k-1) + f(k-2) where f denotes the prime gaps function given by f(m) = prime(m+1) - prime(m).A066495
Numbers k such that f(k) = f(k-1) + f(k-2) where f denotes the prime gaps function given by f(m) = prime(m+1) - prime(m).
- a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.A066496
a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.
- Least number k such that phi(k) / Carmichael lambda(k) = 2n.A066497
Least number k such that phi(k) / Carmichael lambda(k) = 2n.
- Numbers k such that 3 divides phi(k).A066498
Numbers k such that 3 divides phi(k).
- Numbers k such that phi(k) == 2 (mod 4).A066499
Numbers k such that phi(k) == 2 (mod 4).
- Numbers k such that 5 divides phi(k).A066500
Numbers k such that 5 divides phi(k).
- Numbers k such that x^6 == 1 (mod(k)) has no solution 1 < x < k-1.A066501
Numbers k such that x^6 == 1 (mod(k)) has no solution 1 < x < k-1.
- Numbers k such that 7 divides phi(k).A066502
Numbers k such that 7 divides phi(k).
- a(n) = n - squarefree kernel of n, A007947.A066503
a(n) = n - squarefree kernel of n, A007947.
- Sum of n/p^k over all maximal prime-power divisors of n.A066504
Sum of n/p^k over all maximal prime-power divisors of n.
- f-amicable numbers where f(n) = n+1.A066505
f-amicable numbers where f(n) = n+1.
- Least k > n^2 such that (k^3+1)/(n^2+1) is an integer.A066506
Least k > n^2 such that (k^3+1)/(n^2+1) is an integer.
- Numbers k such that there is a solution to x^2 == 2^k (mod k).A066507
Numbers k such that there is a solution to x^2 == 2^k (mod k).
- a(n) = floor(Sum_{i=1..n} (1/i)^(1/i)).A066508
a(n) = floor(Sum_{i=1..n} (1/i)^(1/i)).
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.A066509
a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.
- Conjectured list of positive numbers which are not of the form r^i-s^j, where r,s,i,j are integers with i>1, j>1.A066510
Conjectured list of positive numbers which are not of the form r^i-s^j, where r,s,i,j are integers with i>1, j>1.