Sequences
392,541 sequences
- Remainder when the n-th composite number is divided by pi(n), the number of primes not exceeding n.A065861
Remainder when the n-th composite number is divided by pi(n), the number of primes not exceeding n.
- Remainder when n-th composite number is divided by the number of nonprimes not exceeding n.A065862
Remainder when n-th composite number is divided by the number of nonprimes not exceeding n.
- Remainder when n-th prime is divided by the number of nonprimes not exceeding n.A065863
Remainder when n-th prime is divided by the number of nonprimes not exceeding n.
- Remainder when n is divided by the number of nonprimes not exceeding n.A065864
Remainder when n is divided by the number of nonprimes not exceeding n.
- a(n) is the least k such that nk - 1 and nk + 1 are both composite.A065865
a(n) is the least k such that nk - 1 and nk + 1 are both composite.
- a(n) = n! * Catalan(n+1).A065866
a(n) = n! * Catalan(n+1).
- Primes which are the sum of a prime number of consecutive primes.A065867
Primes which are the sum of a prime number of consecutive primes.
- Initial n digits in decimal portion of golden ratio phi = (1 + sqrt 5)/2 form a prime number.A065868
Initial n digits in decimal portion of golden ratio phi = (1 + sqrt 5)/2 form a prime number.
- a(n) = (2^(prime(n)^2) + 1)/(2^prime(n) + 1).A065869
a(n) = (2^(prime(n)^2) + 1)/(2^prime(n) + 1).
- n-th prime - n-th semiprime.A065870
n-th prime - n-th semiprime.
- Numbers k such that usigma(k) + 1 is a prime.A065871
Numbers k such that usigma(k) + 1 is a prime.
- Numbers k such that usigma(k) - 1 is a prime (cf. A034448).A065872
Numbers k such that usigma(k) - 1 is a prime (cf. A034448).
- Numbers k such that usigma(k) +-1 are twin primes, where usigma(k) is the sum of the unitary divisors of k (A034448).A065873
Numbers k such that usigma(k) +-1 are twin primes, where usigma(k) is the sum of the unitary divisors of k (A034448).
- a(n) = (7^(n+1) - (-6)^(n+1))/13.A065874
a(n) = (7^(n+1) - (-6)^(n+1))/13.
- Numbers k such that usigma(phi(k)) is a prime.A065875
Numbers k such that usigma(phi(k)) is a prime.
- a(n) is the smallest m > n such that n^2 + 1 divides m^2 + 1.A065876
a(n) is the smallest m > n such that n^2 + 1 divides m^2 + 1.
- Non-Niven (or non-Harshad) numbers: numbers which are not a multiple of the sum of their digits.A065877
Non-Niven (or non-Harshad) numbers: numbers which are not a multiple of the sum of their digits.
- Numbers which are not an integer multiple of their number of binary 1's.A065878
Numbers which are not an integer multiple of their number of binary 1's.
- a(n) is the smallest positive number that is n times the number of 1's in its binary expansion, or 0 if no such number exists.A065879
a(n) is the smallest positive number that is n times the number of 1's in its binary expansion, or 0 if no such number exists.
- Largest positive number that is n times the number of 1's in its binary expansion, or 0 if no such number exists.A065880
Largest positive number that is n times the number of 1's in its binary expansion, or 0 if no such number exists.
- Ultimate modulo 10: right-hand nonzero digit of n.A065881
Ultimate modulo 10: right-hand nonzero digit of n.
- Ultimate modulo 4: right-hand nonzero digit of n when written in base 4.A065882
Ultimate modulo 4: right-hand nonzero digit of n when written in base 4.
- Remove factors of 4 from n (i.e., write n in base 4, drop final zeros, then rewrite in decimal).A065883
Remove factors of 4 from n (i.e., write n in base 4, drop final zeros, then rewrite in decimal).
- a(n) = A065824(A047845(n+1)).A065884
a(n) = A065824(A047845(n+1)).
- a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.A065885
a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.
- Smallest square divisible by n!.A065886
Smallest square divisible by n!.
- Smallest number whose square is divisible by n!.A065887
Smallest number whose square is divisible by n!.
- a(n) = number of endofunctions on [n] with a 4-cycle a->b->c->d->a and for any x in [n], some iterate f^k(x) = a.A065888
a(n) = number of endofunctions on [n] with a 4-cycle a->b->c->d->a and for any x in [n], some iterate f^k(x) = a.
- a(n) = number of unicyclic connected simple graphs whose cycle has length 4.A065889
a(n) = number of unicyclic connected simple graphs whose cycle has length 4.
- Number of composites less than the n-th prime.A065890
Number of composites less than the n-th prime.
- The a(n)-th composite number is 2^n.A065891
The a(n)-th composite number is 2^n.
- Which composite number is n! ?: a(n) = k such that A002808(k) = n!, or 0 if n! is not composite.A065892
Which composite number is n! ?: a(n) = k such that A002808(k) = n!, or 0 if n! is not composite.
- Which composite number is the square of n? Index of n^2 in A002808.A065893
Which composite number is the square of n? Index of n^2 in A002808.
- Number of composites <= 10^n.A065894
Number of composites <= 10^n.
- Which composite number is n^n ?: a(n) = k such that A002808(k) = n^n, or 0 if n^n is not composite.A065895
Which composite number is n^n ?: a(n) = k such that A002808(k) = n^n, or 0 if n^n is not composite.
- Number of composites <= 2*n.A065896
Number of composites <= 2*n.
- The a(n)-th composite number is twice the n-th prime.A065897
The a(n)-th composite number is twice the n-th prime.
- Which composite number is the product of first n primes (the n-th primorial number)?: a(n) = k such that A002808(k) = A002110(n), or 0 if A002110(n) is not composite.A065898
Which composite number is the product of first n primes (the n-th primorial number)?: a(n) = k such that A002808(k) = A002110(n), or 0 if A002110(n) is not composite.
- a(n) is the index of the n-th compositorial number, A036691(n), in the sequence of composites (A002808).A065899
a(n) is the index of the n-th compositorial number, A036691(n), in the sequence of composites (A002808).
- Numbers n such that sigma(n) = sigma(n-1) + sigma(n-2).A065900
Numbers n such that sigma(n) = sigma(n-1) + sigma(n-2).
- Duplicate of A053662.A065901
Duplicate of A053662.
- Smallest prime p such that n is a solution mod p of x^4 = 2, or 0 if no such prime exists.A065902
Smallest prime p such that n is a solution mod p of x^4 = 2, or 0 if no such prime exists.
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.A065903
Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.
- Integers i > 1 for which there is one prime p such that i is a solution mod p of x^4 = 2.A065904
Integers i > 1 for which there is one prime p such that i is a solution mod p of x^4 = 2.
- Integers i > 1 for which there are two primes p such that i is a solution mod p of x^4 = 2.A065905
Integers i > 1 for which there are two primes p such that i is a solution mod p of x^4 = 2.
- Integers i > 1 for which there are three primes p such that i is a solution mod p of x^4 = 2.A065906
Integers i > 1 for which there are three primes p such that i is a solution mod p of x^4 = 2.
- First solution mod p of x^4 = 2 for primes p such that only two solutions exist.A065907
First solution mod p of x^4 = 2 for primes p such that only two solutions exist.
- Second solution mod p of x^4 = 2 for primes p such that only two solutions exist.A065908
Second solution mod p of x^4 = 2 for primes p such that only two solutions exist.
- First solution mod p of x^4 = 2 for primes p such that more than two solutions exist.A065909
First solution mod p of x^4 = 2 for primes p such that more than two solutions exist.
- Second solution mod p of x^4 = 2 for primes p such that more than two solution exists.A065910
Second solution mod p of x^4 = 2 for primes p such that more than two solution exists.