Sequences
392,541 sequences
- Smallest number prefixed with corresponding term of the sequence of numbers == 1, 3, 7 or 9 (mod 10), i.e., (1, 3, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29, 31, 33, 37, 39, ...) that yields a prime.A088261
Smallest number prefixed with corresponding term of the sequence of numbers == 1, 3, 7 or 9 (mod 10), i.e., (1, 3, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29, 31, 33, 37, 39, ...) that yields a prime.
- Triangle in which row n gives n primes ending in k where k is the n-th odd number not divisible by 5.A088262
Triangle in which row n gives n primes ending in k where k is the n-th odd number not divisible by 5.
- Diagonal of A088262.A088263
Diagonal of A088262.
- Smallest number k > 0 such that prefixing k to the n-th quadruple in the set {(1,3,7,9), (11,13,17,19), (21,23,27,29), ...} yields all primes.A088264
Smallest number k > 0 such that prefixing k to the n-th quadruple in the set {(1,3,7,9), (11,13,17,19), (21,23,27,29), ...} yields all primes.
- Numbers of the form 10^k + 1, 3, 7, or 9 for k>=1.A088265
Numbers of the form 10^k + 1, 3, 7, or 9 for k>=1.
- Smallest number that yields a prime when concatenated with A088265(k) for all k <= n.A088266
Smallest number that yields a prime when concatenated with A088265(k) for all k <= n.
- Smallest number that on prefixing with the n-th term of A088265 yields prime.A088267
Smallest number that on prefixing with the n-th term of A088265 yields prime.
- Palindromes in A007530.A088268
Palindromes in A007530.
- Palindromic primes that yield a prime when sandwiched between two 1's. (Prefixing and suffixing a 1 on both sides yields another palindromic prime.)A088269
Palindromic primes that yield a prime when sandwiched between two 1's. (Prefixing and suffixing a 1 on both sides yields another palindromic prime.)
- Palindromic primes that yield a prime when sandwiched between two 3's. (Prefixing and suffixing a -three' on both sides yields another pal prime).A088270
Palindromic primes that yield a prime when sandwiched between two 3's. (Prefixing and suffixing a -three' on both sides yields another pal prime).
- Palindromic primes that yield a prime when sandwiched between two 7's. (Prefixing and suffixing a 'seven' on both sides yields another pal prime).A088271
Palindromic primes that yield a prime when sandwiched between two 7's. (Prefixing and suffixing a 'seven' on both sides yields another pal prime).
- Palindromic primes that yield a prime when sandwiched between two 9's.A088272
Palindromic primes that yield a prime when sandwiched between two 9's.
- Duplicate of A049054.A088273
Duplicate of A049054.
- Numbers k such that 10^k + 7 is prime.A088274
Numbers k such that 10^k + 7 is prime.
- Numbers k such that 10^k + 9 is prime.A088275
Numbers k such that 10^k + 9 is prime.
- Smallest k such that 10^k + r is a prime ending (least significant digits) in r where r is the n-th odd number not divisible by 5. 0 if no such number exists.A088276
Smallest k such that 10^k + r is a prime ending (least significant digits) in r where r is the n-th odd number not divisible by 5. 0 if no such number exists.
- Let f(n) be the n-th palindrome in A089743. Then a(n) is the smallest palindromic prime that begins with f(n).A088277
Let f(n) be the n-th palindrome in A089743. Then a(n) is the smallest palindromic prime that begins with f(n).
- Smallest palindromic triangular numbers beginning with palindromes whose first digit is 1, 3, 5, 6, or 8.A088278
Smallest palindromic triangular numbers beginning with palindromes whose first digit is 1, 3, 5, 6, or 8.
- Smallest n-digit palindrome beginning with n.A088279
Smallest n-digit palindrome beginning with n.
- Noncomposites in A088279.A088280
Noncomposites in A088279.
- a(1) = 11; for n > 1, palindromic primes in which a single digit is sandwiched between strings of '1's.A088281
a(1) = 11; for n > 1, palindromic primes in which a single digit is sandwiched between strings of '1's.
- Palindromic primes in which a single digit is sandwiched between strings of 3's.A088282
Palindromic primes in which a single digit is sandwiched between strings of 3's.
- Palindromic primes in which a single digit is sandwiched between strings of 7's.A088283
Palindromic primes in which a single digit is sandwiched between strings of 7's.
- Palindromic primes in which a single digit is sandwiched between nonempty strings of 9's.A088284
Palindromic primes in which a single digit is sandwiched between nonempty strings of 9's.
- Palindromes in which the sum of the internal digits = the sum of the external digits.A088285
Palindromes in which the sum of the internal digits = the sum of the external digits.
- Primes in A088285. Palindromic primes in which the sum of the internal digits = the sum of the external digits.A088286
Primes in A088285. Palindromic primes in which the sum of the internal digits = the sum of the external digits.
- Palindromes divisible by the number formed by their internal digits.A088287
Palindromes divisible by the number formed by their internal digits.
- Palindromic primes made of only two digits say a and b such that replacing a with b and vice versa one gets another prime.A088288
Palindromic primes made of only two digits say a and b such that replacing a with b and vice versa one gets another prime.
- Triangular numbers in which the sum of the external digits equals the sum of the internal digits.A088289
Triangular numbers in which the sum of the external digits equals the sum of the internal digits.
- Prime numbers in which the sum of the external digits = the sum of the internal digits.A088290
Prime numbers in which the sum of the external digits = the sum of the internal digits.
- Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.A088291
Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.
- Smallest prime in which the digit string can be partitioned in n+1 parts (0 parts allowed) such that the sum of the first n parts = the (n+1)th one.A088292
Smallest prime in which the digit string can be partitioned in n+1 parts (0 parts allowed) such that the sum of the first n parts = the (n+1)th one.
- Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one.A088293
Smallest prime in which the digit string can be partitioned into n+1 parts (only nonzero parts allowed) such that the sum of the first n parts = the (n+1)th one.
- Primes in which the digit string can be partitioned into three parts such that third (least significant) part is the product of the first two.A088294
Primes in which the digit string can be partitioned into three parts such that third (least significant) part is the product of the first two.
- Smallest prime in which the digit string can be partitioned in n+1 parts such that the product of the first n parts = the (n+1)th one.A088295
Smallest prime in which the digit string can be partitioned in n+1 parts such that the product of the first n parts = the (n+1)th one.
- Values of y - x, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).A088296
Values of y - x, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).
- Primes in which no digit is coprime to its neighbors.A088297
Primes in which no digit is coprime to its neighbors.
- Values of 2x + y, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).A088298
Values of 2x + y, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).
- Values of x + 2y, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).A088299
Values of x + 2y, where x^2 + xy + y^2=p (x<y) is a prime of the form 6n + 1 (=A002476).
- a(1) = 1. For n>1, the smallest number greater than n! with the prime signature of n!.A088300
a(1) = 1. For n>1, the smallest number greater than n! with the prime signature of n!.
- a(n) = p(n)/p(n-1), where p(n) = ( floor(n*log(n)) / Product_{j=2..pi(floor(n*log(n)))} prime(j) )!.A088301
a(n) = p(n)/p(n-1), where p(n) = ( floor(n*log(n)) / Product_{j=2..pi(floor(n*log(n)))} prime(j) )!.
- Smallest integer value of n!/(2!3!...p!), where denominator contains product of factorials of primes in increasing order.A088302
Smallest integer value of n!/(2!3!...p!), where denominator contains product of factorials of primes in increasing order.
- Smallest integer value of n!/(m_1!*m_2!*...*m_k!), where 1=m_1 < m_2 < ... is the sequence of integers coprime to n.A088303
Smallest integer value of n!/(m_1!*m_2!*...*m_k!), where 1=m_1 < m_2 < ... is the sequence of integers coprime to n.
- a(1) = 1. For n > 1, a(n) = a(n-1) if n is prime, a(n) = a(n-1)/n if n is composite and divides a(n-1) else a(n) = n*a(n-1).A088304
a(1) = 1. For n > 1, a(n) = a(n-1) if n is prime, a(n) = a(n-1)/n if n is composite and divides a(n-1) else a(n) = n*a(n-1).
- a(0) = 1, a(n) = Fibonacci(2*n). It has the property that a(n) = 1*a(n-1) + 2*a(n-2) + 3*a(n-3) + 4*a(n-4) + ...A088305
a(0) = 1, a(n) = Fibonacci(2*n). It has the property that a(n) = 1*a(n-1) + 2*a(n-2) + 3*a(n-3) + 4*a(n-4) + ...
- Integers n with tan n > |n|, ordered by |n|.A088306
Integers n with tan n > |n|, ordered by |n|.
- Triangle, read by rows, T(n,k) = n^2 + k^2 if gcd(n,k)=1, otherwise 0.A088307
Triangle, read by rows, T(n,k) = n^2 + k^2 if gcd(n,k)=1, otherwise 0.
- 2 followed by list of composite numbers mod 10.A088308
2 followed by list of composite numbers mod 10.
- Number of equivalence classes of n X n (0,1)-matrices with all rows distinct and all columns distinct.A088309
Number of equivalence classes of n X n (0,1)-matrices with all rows distinct and all columns distinct.
- Number of n X n (0,1)-matrices with all rows distinct and all columns distinct.A088310
Number of n X n (0,1)-matrices with all rows distinct and all columns distinct.