Sequences
392,541 sequences
- Numbers k for which there exists a permutation of the numbers 1 to k such that the sum of adjacent numbers is a square.A090461
Numbers k for which there exists a permutation of the numbers 1 to k such that the sum of adjacent numbers is a square.
- Decimal expansion of maximum real value at which the Pochhammer limit lim_{k->infinity} Product_{i=0..k} (z + i/k) converges.A090462
Decimal expansion of maximum real value at which the Pochhammer limit lim_{k->infinity} Product_{i=0..k} (z + i/k) converges.
- Decimal expansion of maximum imaginary value at which the Pochhammer limit lim_{k->Infinity} Product_{i=0..k}(z + i/k) converges.A090463
Decimal expansion of maximum imaginary value at which the Pochhammer limit lim_{k->Infinity} Product_{i=0..k}(z + i/k) converges.
- Smallest number m such that n with by m sevens appended yields a prime, or -1 if no such m exists.A090464
Smallest number m such that n with by m sevens appended yields a prime, or -1 if no such m exists.
- Smallest number m such that (n+1)*10^m-1 (i.e., n with m nines appended) yields a prime, or -1 if this will always yield a composite number.A090465
Smallest number m such that (n+1)*10^m-1 (i.e., n with m nines appended) yields a prime, or -1 if this will always yield a composite number.
- Regular figurative or polygonal numbers of order greater than 2.A090466
Regular figurative or polygonal numbers of order greater than 2.
- Numbers which are not regular figurative or polygonal numbers of order greater than 2. That is, numbers not of the form 1 + k*m*(m-1)/2 - (m-1)^2 where k > 2 and m > 2.A090467
Numbers which are not regular figurative or polygonal numbers of order greater than 2. That is, numbers not of the form 1 + k*m*(m-1)/2 - (m-1)^2 where k > 2 and m > 2.
- Class 13+ primes.A090468
Class 13+ primes.
- Least (distinct) composite k such that k+n, k+2n, k+3n, ... up to n terms are all composite.A090469
Least (distinct) composite k such that k+n, k+2n, k+3n, ... up to n terms are all composite.
- Expansion of e.g.f.: 1/((1-4*x)*sqrt(1-2*x)).A090470
Expansion of e.g.f.: 1/((1-4*x)*sqrt(1-2*x)).
- Smallest prime not already used that is of the form prime(n)+kn for some k > 0.A090471
Smallest prime not already used that is of the form prime(n)+kn for some k > 0.
- Primes in A089897.A090472
Primes in A089897.
- Primes in A047783.A090473
Primes in A047783.
- Beginning with 2, a(n+1) is the least prime == 1 (mod (Sum_{i=1..n} a(i))).A090474
Beginning with 2, a(n+1) is the least prime == 1 (mod (Sum_{i=1..n} a(i))).
- Beginning with 2, a(n+1) is the least prime == -1 (mod Product_{i=1..n} a(i) ).A090475
Beginning with 2, a(n+1) is the least prime == -1 (mod Product_{i=1..n} a(i) ).
- Beginning with 2, a(n+1) is the least prime == -1 (mod (Sum a(i), i=1 to n)).A090476
Beginning with 2, a(n+1) is the least prime == -1 (mod (Sum a(i), i=1 to n)).
- T(n,k) is the number of occurrences of the k-th prime in the first n partition numbers (with repetitions), 1 <= k <= n, triangular array read by rows.A090477
T(n,k) is the number of occurrences of the k-th prime in the first n partition numbers (with repetitions), 1 <= k <= n, triangular array read by rows.
- a(1) = 1; for n>=1, a(n+1) is the least number such that the concatenation of a(n), n and a(n+1) is prime.A090478
a(1) = 1; for n>=1, a(n+1) is the least number such that the concatenation of a(n), n and a(n+1) is prime.
- Beginning with 1, least number such that filling the first n gaps with numbers from 1 to n yields primes in every case.A090479
Beginning with 1, least number such that filling the first n gaps with numbers from 1 to n yields primes in every case.
- Primes arising in A090479.A090480
Primes arising in A090479.
- Primes p such that tau(p-1)+tau(p+1) is larger than for any previous term. (Smallest prime sandwiched between more composite numbers.)A090481
Primes p such that tau(p-1)+tau(p+1) is larger than for any previous term. (Smallest prime sandwiched between more composite numbers.)
- Smallest prime p such that tau(p-1) + tau(p+1) is n, or 0 if no such number exists.A090482
Smallest prime p such that tau(p-1) + tau(p+1) is n, or 0 if no such number exists.
- Indices of zero in A090482.A090483
Indices of zero in A090482.
- a(n) = Floor[(Exp[Prime[n]/n]-1)/Log[n]].A090484
a(n) = Floor[(Exp[Prime[n]/n]-1)/Log[n]].
- a(n) = Floor[(Exp[n/PrimePi[n]]-1)/Log[n]].A090485
a(n) = Floor[(Exp[n/PrimePi[n]]-1)/Log[n]].
- a(n) = Floor[(Pi/2)*(Exp[3+Prime[n]/n])/Log[n]].A090486
a(n) = Floor[(Pi/2)*(Exp[3+Prime[n]/n])/Log[n]].
- a(n) = Floor[(Pi/2)*(Exp[3+n/PrimePi[n]])/Log[n]].A090487
a(n) = Floor[(Pi/2)*(Exp[3+n/PrimePi[n]])/Log[n]].
- Decimal expansion of 2 + 2*sqrt(2).A090488
Decimal expansion of 2 + 2*sqrt(2).
- Duplicate of A090484.A090489
Duplicate of A090484.
- For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1).A090490
For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1).
- G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).A090491
G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).
- G.f.: (1+x^10)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)).A090492
G.f.: (1+x^10)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)).
- Least k such that n^k contains all the digits from 0 through 9, or 0 if no such k exists.A090493
Least k such that n^k contains all the digits from 0 through 9, or 0 if no such k exists.
- Product_{j=1..n} Product_{k=1..n} lcm(j,k).A090494
Product_{j=1..n} Product_{k=1..n} lcm(j,k).
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).A090495
Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).
- Ratio of numerator(Bernoulli(2*n)/(2*n)) to numerator(Bernoulli(2*n)/(2*n*(2*n-1))) for n's for which they are different.A090496
Ratio of numerator(Bernoulli(2*n)/(2*n)) to numerator(Bernoulli(2*n)/(2*n*(2*n-1))) for n's for which they are different.
- Smallest prime p such that the concatenation 2,3,5,7, ... (primes) ... p is a multiple of prime(n).A090497
Smallest prime p such that the concatenation 2,3,5,7, ... (primes) ... p is a multiple of prime(n).
- Number of divisors of all the numbers from (1/2)n(n-1)+1 to n(n+1)/2, i.e., tau(1), tau(2)+tau(3), tau(4)+tau(5)+tau(6), tau(7)+tau(8)+tau(9)+tau(10), ..., where tau(j) is the number of divisors of j.A090498
Number of divisors of all the numbers from (1/2)n(n-1)+1 to n(n+1)/2, i.e., tau(1), tau(2)+tau(3), tau(4)+tau(5)+tau(6), tau(7)+tau(8)+tau(9)+tau(10), ..., where tau(j) is the number of divisors of j.
- Group the natural numbers so that the sum of the numbers of divisors of the members of the (n+1)th group exceeds that for the n-th group. Sequence contains the first term of each group.A090499
Group the natural numbers so that the sum of the numbers of divisors of the members of the (n+1)th group exceeds that for the n-th group. Sequence contains the first term of each group.
- Sums described in A090499.A090500
Sums described in A090499.
- Group the natural numbers as in A090499; sequence gives the number of members in each group.A090501
Group the natural numbers as in A090499; sequence gives the number of members in each group.
- Numbers k such that tau(k) = tau(k-1) + tau(k+1).A090502
Numbers k such that tau(k) = tau(k-1) + tau(k+1).
- Number of hyperplanes in a finite projective space (of some dimension d over some finite field of order q).A090503
Number of hyperplanes in a finite projective space (of some dimension d over some finite field of order q).
- Beginning with 1, numbers such that the differences a(k)-a(k-1) are distinct and every concatenation n>1 is prime.A090504
Beginning with 1, numbers such that the differences a(k)-a(k-1) are distinct and every concatenation n>1 is prime.
- Primes arising in A090504.A090505
Primes arising in A090504.
- Least number beginning with n such that every concatenation is a prime.A090506
Least number beginning with n such that every concatenation is a prime.
- Primes arising in A090506.A090507
Primes arising in A090506.
- Least number beginning with prime(n) such that every concatenation is a prime.A090508
Least number beginning with prime(n) such that every concatenation is a prime.
- Primes arising in A090508.A090509
Primes arising in A090508.
- a(n) is the least prime beginning with prime(n) such that the concatenation a(1)a(2)...a(n) is a prime.A090510
a(n) is the least prime beginning with prime(n) such that the concatenation a(1)a(2)...a(n) is a prime.