Sequences
392,541 sequences
- Smallest prime beginning and ending in at least n 3's.A068161
Smallest prime beginning and ending in at least n 3's.
- Smallest prime beginning and ending in at least n 7's.A068162
Smallest prime beginning and ending in at least n 7's.
- Smallest prime beginning and ending in at least n 9's.A068163
Smallest prime beginning and ending in at least n 9's.
- Smallest prime obtained from n by inserting zero or more decimal digits.A068164
Smallest prime obtained from n by inserting zero or more decimal digits.
- Smallest square formed from n by inserting zero or more decimal digits.A068165
Smallest square formed from n by inserting zero or more decimal digits.
- Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 1.A068166
Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 1.
- Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 2.A068167
Define an increasing sequence as follows. Given the first term, called the seed (which need not share the property of the remaining terms), subsequent terms are obtained by inserting at least one digit in the previous term so as to obtain the smallest number with the specified property. This is the prime sequence with the seed a(1) = 2.
- Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 3.A068168
Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 3.
- Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 4.A068169
Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 4.
- Define an increasing sequence as follows. Given the first term, called the seed (the seed need not have the property of the remaining terms of the sequence), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 5.A068170
Define an increasing sequence as follows. Given the first term, called the seed (the seed need not have the property of the remaining terms of the sequence), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 5.
- Define an increasing sequence as follows: Given the first term called the seed (the seed need not have the property of the sequence.), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 6.A068171
Define an increasing sequence as follows: Given the first term called the seed (the seed need not have the property of the sequence.), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 6.
- Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 7.A068172
Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 7.
- Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 8.A068173
Define an increasing sequence as follows. Given the first term called the seed (the seed need not have the property of the sequence.). Subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 8.
- Define an increasing sequence as follows. Start with an initial term, the seed (which need not have the property of the sequence); subsequent terms are obtained by inserting/placing at least one digit in the previous term to obtain the smallest number with the given property. This is the prime sequence with the seed a(1) = 9.A068174
Define an increasing sequence as follows. Start with an initial term, the seed (which need not have the property of the sequence); subsequent terms are obtained by inserting/placing at least one digit in the previous term to obtain the smallest number with the given property. This is the prime sequence with the seed a(1) = 9.
- a(1) = 1; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).A068175
a(1) = 1; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).
- a(1) = 2; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).A068176
a(1) = 2; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).
- a(1) = 3; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).A068177
a(1) = 3; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).
- a(1) = 4; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).A068178
a(1) = 4; for n>1, a(n) is the smallest square > a(n-1) obtained by inserting digits into a(n-1).
- Product_{i=1..3} (i+x) / Product_{i=1..3} (i-x) = Sum_{n>=0} (a(n)/b(n))*x^n.A068179
Product_{i=1..3} (i+x) / Product_{i=1..3} (i-x) = Sum_{n>=0} (a(n)/b(n))*x^n.
- (Product_{i=1..4} (x+i)) / (Product_{i=1..4} (x-i)) = Sum_{n>=1} a(n)/A067419(n)*x^n.A068180
(Product_{i=1..4} (x+i)) / (Product_{i=1..4} (x-i)) = Sum_{n>=1} a(n)/A067419(n)*x^n.
- a(n)=-1/b(2n) where 1/(e^y-e^(y/3))= sum(i=-1,inf,b(i)*y^i).A068181
a(n)=-1/b(2n) where 1/(e^y-e^(y/3))= sum(i=-1,inf,b(i)*y^i).
- Number of combinatorially non-equivalent "triangulations" of a compact genus n surface which have only 1 vertex (all vertices of the triangles are identified). Also the number of combinatorially distinct identifications of pairs of edges of a polygon P having 12g-6 sides leading to a compact oriented genus g surface containing the boundary of P as a 3-regular graph.A068182
Number of combinatorially non-equivalent "triangulations" of a compact genus n surface which have only 1 vertex (all vertices of the triangles are identified). Also the number of combinatorially distinct identifications of pairs of edges of a polygon P having 12g-6 sides leading to a compact oriented genus g surface containing the boundary of P as a 3-regular graph.
- Largest number without decimal digits equal to 1 whose product of digits gives n!.A068183
Largest number without decimal digits equal to 1 whose product of digits gives n!.
- Smallest number whose product of digits equals n!.A068184
Smallest number whose product of digits equals n!.
- Number of ways writing n^n as a product of decimal digits of some other number which has no digits equal to 1.A068185
Number of ways writing n^n as a product of decimal digits of some other number which has no digits equal to 1.
- a(n) is the largest number whose product of decimal digits equals n^n.A068186
a(n) is the largest number whose product of decimal digits equals n^n.
- a(n) is the smallest number such that the product of its decimal digits equals n^n, or 0 if no solutions exist.A068187
a(n) is the smallest number such that the product of its decimal digits equals n^n, or 0 if no solutions exist.
- Tetradic primes (primes in A006072).A068188
Tetradic primes (primes in A006072).
- Smallest positive number whose product of digits equals n, or a(n)=0 if no such number exists, i.e. when n has a prime divisor greater than 7.A068189
Smallest positive number whose product of digits equals n, or a(n)=0 if no such number exists, i.e. when n has a prime divisor greater than 7.
- Largest number whose digit product equals n; a(n)=0 if no such number exists, e.g., when n has a prime factor larger than 7; no digit=1 is permitted to avoid an infinite number of solutions.A068190
Largest number whose digit product equals n; a(n)=0 if no such number exists, e.g., when n has a prime factor larger than 7; no digit=1 is permitted to avoid an infinite number of solutions.
- Numbers n such that A067734(n)=0; complement of A002473; at least one prime-factor of n is larger than 7, it has 2 decimal digits.A068191
Numbers n such that A067734(n)=0; complement of A002473; at least one prime-factor of n is larger than 7, it has 2 decimal digits.
- Let a(1)=2, f(n) = 4*a(1)*a(2)*...*a(n-1) for n >= 1 and a(n) = f(n)-prevprime(f(n)-1) for n >= 2, where prevprime(x) is the largest prime < x.A068192
Let a(1)=2, f(n) = 4*a(1)*a(2)*...*a(n-1) for n >= 1 and a(n) = f(n)-prevprime(f(n)-1) for n >= 2, where prevprime(x) is the largest prime < x.
- The prime indices of sequence A068192. (That sequence is conjectured to contain only primes.).A068193
The prime indices of sequence A068192. (That sequence is conjectured to contain only primes.).
- Numbers k for which the only representation of k*(k+1)/2 as a sum of 2 or more consecutive positive integers is 1+2+...+k.A068194
Numbers k for which the only representation of k*(k+1)/2 as a sum of 2 or more consecutive positive integers is 1+2+...+k.
- Numbers of the form n(n+1)/2 whose only representation as a sum of 2 or more consecutive positive integers is 1+2+...+n.A068195
Numbers of the form n(n+1)/2 whose only representation as a sum of 2 or more consecutive positive integers is 1+2+...+n.
- Origin numbers: integers unreachable by Bergerson's Alpha construction (see the Ross Eckler link).A068196
Origin numbers: integers unreachable by Bergerson's Alpha construction (see the Ross Eckler link).
- Number of squares (of another matrix) in M_2(n) - the ring of 2 X 2 matrices over Z_n.A068197
Number of squares (of another matrix) in M_2(n) - the ring of 2 X 2 matrices over Z_n.
- Duplicate of A064899.A068198
Duplicate of A064899.
- One of a family of sequences that interpolates between the Bell numbers and the factorials.A068199
One of a family of sequences that interpolates between the Bell numbers and the factorials.
- One of a family of sequences that interpolates between the Bell numbers and the factorials.A068200
One of a family of sequences that interpolates between the Bell numbers and the factorials.
- One of a family of sequences that interpolates between the Bell numbers and the factorials.A068201
One of a family of sequences that interpolates between the Bell numbers and the factorials.
- Next-to-middle coefficient in expansion of Product_{k=1..n} (1 + x^k).A068202
Next-to-middle coefficient in expansion of Product_{k=1..n} (1 + x^k).
- Chebyshev T-polynomials T(n,15) with Diophantine property.A068203
Chebyshev T-polynomials T(n,15) with Diophantine property.
- Let (x_n, y_n) be n-th solution to the Pell equation x^2 = 14*y^2 + 1. Sequence gives {y_n}.A068204
Let (x_n, y_n) be n-th solution to the Pell equation x^2 = 14*y^2 + 1. Sequence gives {y_n}.
- Denominator of S(n)/Pi^n, where S(n) = Sum((4k+1)^(-n),k,-inf,+inf).A068205
Denominator of S(n)/Pi^n, where S(n) = Sum((4k+1)^(-n),k,-inf,+inf).
- Let N(2n) denote the numerator of B(2n), the 2n-th Bernoulli number and D(2n) the denominator; sequence gives values of n such that gcd(N(2n),D(2n-2))=7.A068206
Let N(2n) denote the numerator of B(2n), the 2n-th Bernoulli number and D(2n) the denominator; sequence gives values of n such that gcd(N(2n),D(2n-2))=7.
- Numbers k such that the number of divisors of k^2-1 equals the number of divisors of k.A068207
Numbers k such that the number of divisors of k^2-1 equals the number of divisors of k.
- Numbers k such that tau(k) - tau(k+1) = 1.A068208
Numbers k such that tau(k) - tau(k+1) = 1.
- Primes p of the form 3k - 1 such that there exist nontrivial solutions (x other than 0 or -1 modulo p) to the congruence (x+1)^p - x^p == 1 (mod p^2).A068209
Primes p of the form 3k - 1 such that there exist nontrivial solutions (x other than 0 or -1 modulo p) to the congruence (x+1)^p - x^p == 1 (mod p^2).
- n-th prime's factorial raised to n-th prime power.A068210
n-th prime's factorial raised to n-th prime power.