Sequences
392,541 sequences
- Least k such that (k-1)/n and k*n + 1 both are primes.A092961
Least k such that (k-1)/n and k*n + 1 both are primes.
- Primes (A092961(n)-1)/n.A092962
Primes (A092961(n)-1)/n.
- Primes n*A092961(n) + 1.A092963
Primes n*A092961(n) + 1.
- Numbers > 1 in A051168, with a(0) = 1.A092964
Numbers > 1 in A051168, with a(0) = 1.
- Greatest prime arising as the product of numbers chosen from among the first n numbers + 1.A092965
Greatest prime arising as the product of numbers chosen from among the first n numbers + 1.
- Number of interior balls in a truncated tetrahedral arrangement.A092966
Number of interior balls in a truncated tetrahedral arrangement.
- Largest prime of the form a squarefree number + 1 where the prime divisors of the squarefree number are < n.A092967
Largest prime of the form a squarefree number + 1 where the prime divisors of the squarefree number are < n.
- Numbers n such that 2n^2 + 11 is a prime.A092968
Numbers n such that 2n^2 + 11 is a prime.
- a(1) = 2; for n>1, a(n) = largest prime of the form n!/k + 1, where k < n, or 0 if no such prime exists.A092969
a(1) = 2; for n>1, a(n) = largest prime of the form n!/k + 1, where k < n, or 0 if no such prime exists.
- Smallest prime of the form n!/k + 1. k < = n, or 0 if no such prime exists.A092970
Smallest prime of the form n!/k + 1. k < = n, or 0 if no such prime exists.
- Row 6 of array in A288580.A092971
Row 6 of array in A288580.
- Row 7 of array in A288580.A092972
Row 7 of array in A288580.
- Row 8 of array in A288580.A092973
Row 8 of array in A288580.
- Row 9 of array in A288580.A092974
Row 9 of array in A288580.
- Consider all partitions of n into parts all of which are divisors of n; a(n) = maximal product of parts.A092975
Consider all partitions of n into parts all of which are divisors of n; a(n) = maximal product of parts.
- Consider all partitions of n into parts all of which are divisors of n; a(n) = number of distinct values taken by the product of the parts.A092976
Consider all partitions of n into parts all of which are divisors of n; a(n) = number of distinct values taken by the product of the parts.
- Duplicate of A057218.A092977
Duplicate of A057218.
- (Product of first n even numbers)/(product of first k odd numbers) where k is chosen to give the least integer.A092978
(Product of first n even numbers)/(product of first k odd numbers) where k is chosen to give the least integer.
- Least k such that (n+1)*(n+2)*...*(k-1)*k >= n!.A092979
Least k such that (n+1)*(n+2)*...*(k-1)*k >= n!.
- Partition the sequence of natural numbers into groups so that each group product is just >=n! until the group contains only one number which is >= n!; a(n) = the number of such groups.A092980
Partition the sequence of natural numbers into groups so that each group product is just >=n! until the group contains only one number which is >= n!; a(n) = the number of such groups.
- Least product of successive primes beginning from just greater than n which is > n!.A092981
Least product of successive primes beginning from just greater than n which is > n!.
- Number of prime divisors of the squarefree number A092981(n).A092982
Number of prime divisors of the squarefree number A092981(n).
- Least squarefree number > n!.A092983
Least squarefree number > n!.
- a(n) = the least k >= 1 such that n! + k is squarefree.A092984
a(n) = the least k >= 1 such that n! + k is squarefree.
- a(n) is the product of the first n terms of an arithmetic progression with the first term 1 and common difference n.A092985
a(n) is the product of the first n terms of an arithmetic progression with the first term 1 and common difference n.
- Coefficients arising in the enumeration of cloned structures (see reference for precise definition).A092986
Coefficients arising in the enumeration of cloned structures (see reference for precise definition).
- A092985(n) divided by {A057237(n)}!.A092987
A092985(n) divided by {A057237(n)}!.
- Least number k < n such that n*k has the maximum number of divisors.A092988
Least number k < n such that n*k has the maximum number of divisors.
- a(n) = tau(n*A092988(n)); maximal value attained by the number of divisors of n*k, k < n.A092989
a(n) = tau(n*A092988(n)); maximal value attained by the number of divisors of n*k, k < n.
- Least product of the partitions of n into two parts with maximal tau value: let n = a+b be a partition of n, then a(n) = a*b such that tau(a*b) is maximal.A092990
Least product of the partitions of n into two parts with maximal tau value: let n = a+b be a partition of n, then a(n) = a*b such that tau(a*b) is maximal.
- Least product of the parts of the partitions of n where that product has the maximum number of divisors.A092991
Least product of the parts of the partitions of n where that product has the maximum number of divisors.
- Smallest prime of the form concatenation of prime(n) with itself followed by a 1.A092992
Smallest prime of the form concatenation of prime(n) with itself followed by a 1.
- Smallest prime of the form concatenation(s) of prime(n) with itself followed by a 3, or 0 if no such prime exists.A092993
Smallest prime of the form concatenation(s) of prime(n) with itself followed by a 3, or 0 if no such prime exists.
- Smallest prime of the form concatenation of prime(n) with itself followed by a 7, or 0 if no such prime exists.A092994
Smallest prime of the form concatenation of prime(n) with itself followed by a 7, or 0 if no such prime exists.
- Smallest prime of the form concatenation of prime(n) with itself followed by a 9, or 0 if no such prime exists.A092995
Smallest prime of the form concatenation of prime(n) with itself followed by a 9, or 0 if no such prime exists.
- Least k such that 1 < p < n < c < k, where p is a prime and c is a composite number such that for every p there exists a distinct c.A092996
Least k such that 1 < p < n < c < k, where p is a prime and c is a composite number such that for every p there exists a distinct c.
- Least k such that 1 < c < n < p < k, where p is a prime and c is a composite number such that for every c there exists a distinct p.A092997
Least k such that 1 < c < n < p < k, where p is a prime and c is a composite number such that for every c there exists a distinct p.
- Least integer k > n such that the number of primes between 1 and n (exclusive) is the same as the number of primes between n and k (exclusive).A092998
Least integer k > n such that the number of primes between 1 and n (exclusive) is the same as the number of primes between n and k (exclusive).
- Duplicate of A077154.A092999
Duplicate of A077154.
- Least k such that Sum_{r=n+1..k} r >= n!.A093000
Least k such that Sum_{r=n+1..k} r >= n!.
- Least k such that Sum_{r=n+1..k} r is greater than or equal to the sum of the first n positive integers (i.e., the n-th triangular number, A000217(n)). Or, least k such that (sum of first n positive integers) <= (sum of numbers from n+1 up to k).A093001
Least k such that Sum_{r=n+1..k} r is greater than or equal to the sum of the first n positive integers (i.e., the n-th triangular number, A000217(n)). Or, least k such that (sum of first n positive integers) <= (sum of numbers from n+1 up to k).
- Product of factorials of next n numbers.A093002
Product of factorials of next n numbers.
- Number of composite numbers among next n numbers.A093003
Number of composite numbers among next n numbers.
- Erroneous version of A003588.A093004
Erroneous version of A003588.
- a(n) = n * ceiling(n/2).A093005
a(n) = n * ceiling(n/2).
- Referring to the triangle in A093005, sequence contains the least term with maximal number of divisors.A093006
Referring to the triangle in A093005, sequence contains the least term with maximal number of divisors.
- First nonprime number reached when iterating n under x->2*x+1.A093007
First nonprime number reached when iterating n under x->2*x+1.
- Smallest number of 1's to append to the binary representation of n such that primes become nonprimes and nonprimes become primes.A093008
Smallest number of 1's to append to the binary representation of n such that primes become nonprimes and nonprimes become primes.
- Smallest number m such that m is prime iff n is not prime and the binary representation of m equals n with appended trailing 1's.A093009
Smallest number m such that m is prime iff n is not prime and the binary representation of m equals n with appended trailing 1's.
- Triangle, read by rows, such that the convolution of the n-th row with the natural numbers forms the n-th diagonal, for n>=0, where each row begins with 1.A093010
Triangle, read by rows, such that the convolution of the n-th row with the natural numbers forms the n-th diagonal, for n>=0, where each row begins with 1.