Sequences
392,541 sequences
- Add/multiply sequence, see example.A093361
Add/multiply sequence, see example.
- Increasing gaps in A038593 (upper terms).A093362
Increasing gaps in A038593 (upper terms).
- Erroneous version of A005115.A093363
Erroneous version of A005115.
- Gaps associated with the arithmetic progressions of primes in A005115.A093364
Gaps associated with the arithmetic progressions of primes in A005115.
- Least number which is the end of an arithmetic progression of n numbers that are the sums of two nonzero squares.A093365
Least number which is the end of an arithmetic progression of n numbers that are the sums of two nonzero squares.
- Gaps associated with the arithmetic progressions in A093365.A093366
Gaps associated with the arithmetic progressions in A093365.
- Number of n-bead necklaces using exactly three colors with no adjacent beads having the same color.A093367
Number of n-bead necklaces using exactly three colors with no adjacent beads having the same color.
- Number of asymmetric periodic cycles of iterative map described by Ma and Wainwright.A093368
Number of asymmetric periodic cycles of iterative map described by Ma and Wainwright.
- a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's that starts with a 2, using the rule described in the Comments lines.A093369
a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's that starts with a 2, using the rule described in the Comments lines.
- Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1.A093370
Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1.
- Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1.A093371
Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1.
- Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).A093372
Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).
- Numbers that are not the product of factorials.A093373
Numbers that are not the product of factorials.
- Number of 1-2-3-avoiding permutations with exactly thrice the 1-3-2 pattern.A093374
Number of 1-2-3-avoiding permutations with exactly thrice the 1-3-2 pattern.
- Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.A093375
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
- Number of labeled n-vertex graphs with 2-components and without isolated vertices(1-components).A093376
Number of labeled n-vertex graphs with 2-components and without isolated vertices(1-components).
- Number of labeled n-vertex graphs without 2-components and without isolated vertices (1-components).A093377
Number of labeled n-vertex graphs without 2-components and without isolated vertices (1-components).
- a(n) = numerator of any non-diagonal entry of the matrix A^n, where A is described in the Comments lines.A093378
a(n) = numerator of any non-diagonal entry of the matrix A^n, where A is described in the Comments lines.
- Expansion of x(1-2x-2x^2)/((1+x)(1-2x)(1-3x)).A093379
Expansion of x(1-2x-2x^2)/((1+x)(1-2x)(1-3x)).
- Expansion of (1+4x+x^2-10x^3)/((1-x)(1-x-2x^2)).A093380
Expansion of (1+4x+x^2-10x^3)/((1-x)(1-x-2x^2)).
- Expansion of (1 - 2*x - 3*x^2 - 4*x^3)/((1-x)*(1-2*x)*(1-3*x)*(1-4*x)).A093381
Expansion of (1 - 2*x - 3*x^2 - 4*x^3)/((1-x)*(1-2*x)*(1-3*x)*(1-4*x)).
- a(n) = length k of longest binary sequence x(1) ... x(k) such that for no n <= i < j <= k/2 is x(i) ... x(2i) a subsequence of x(j) ... x(2j).A093382
a(n) = length k of longest binary sequence x(1) ... x(k) such that for no n <= i < j <= k/2 is x(i) ... x(2i) a subsequence of x(j) ... x(2j).
- One of the 16 sequences illustrating the fact that A093382(2) = 31.A093383
One of the 16 sequences illustrating the fact that A093382(2) = 31.
- Another of the 16 sequences illustrating the fact that A093382(2) = 31.A093384
Another of the 16 sequences illustrating the fact that A093382(2) = 31.
- One of the 32 sequences illustrating the fact that A093382(2) = 199.A093385
One of the 32 sequences illustrating the fact that A093382(2) = 199.
- Another of the 32 sequences illustrating the fact that A093382(2) = 199.A093386
Another of the 32 sequences illustrating the fact that A093382(2) = 199.
- a(n) = 2^(n-1) - binomial(n, floor(n/2)).A093387
a(n) = 2^(n-1) - binomial(n, floor(n/2)).
- (n+1)^2*a(n+1) = (17n^2+17n+6)*a(n) - 72*n^2*a(n-1).A093388
(n+1)^2*a(n+1) = (17n^2+17n+6)*a(n) - 72*n^2*a(n-1).
- Duplicate of A093342.A093389
Duplicate of A093342.
- a(n) = floor(n/9) + floor((n+1)/9) + floor((n+2)/9).A093390
a(n) = floor(n/9) + floor((n+1)/9) + floor((n+2)/9).
- a(n) = floor(n/16) + floor((n+1)/16) + floor((n+2)/16) + floor((n+3)/16).A093391
a(n) = floor(n/16) + floor((n+1)/16) + floor((n+2)/16) + floor((n+3)/16).
- [n/25] + [(n+1)/25] + [(n+2)/25] + [(n+3)/25] + [(n+4)/25].A093392
[n/25] + [(n+1)/25] + [(n+2)/25] + [(n+3)/25] + [(n+4)/25].
- [n/9] + [n/4] + [(n+1)/9] + [(n+1)/4] + [(n+2)/9].A093393
[n/9] + [n/4] + [(n+1)/9] + [(n+1)/4] + [(n+2)/9].
- a(n) is the GCD of n and the product of the anti-divisors of n.A093394
a(n) is the GCD of n and the product of the anti-divisors of n.
- Numerators of n divided by the product of the anti-divisors of n.A093395
Numerators of n divided by the product of the anti-divisors of n.
- Denominators of n divided by the product of the anti-divisors of n.A093396
Denominators of n divided by the product of the anti-divisors of n.
- Absolute value of difference between counts of uninterrupted runs of single nonprimes in A093183 and A093184.A093397
Absolute value of difference between counts of uninterrupted runs of single nonprimes in A093183 and A093184.
- Absolute value of difference between counts of uninterrupted runs of 2 nonprimes in A093185 and A093186.A093398
Absolute value of difference between counts of uninterrupted runs of 2 nonprimes in A093185 and A093186.
- Absolute value of difference between counts of uninterrupted runs of 3 nonprimes in A093187 and A093188.A093399
Absolute value of difference between counts of uninterrupted runs of 3 nonprimes in A093187 and A093188.
- Primes of the form 10*R_k + 9, where R_k is the repunit (A002275) of length k.A093400
Primes of the form 10*R_k + 9, where R_k is the repunit (A002275) of length k.
- Primes of the form 20*R_k + 9, where R_k is the repunit (A002275) of length k.A093401
Primes of the form 20*R_k + 9, where R_k is the repunit (A002275) of length k.
- Primes of the form 40*R_k + 9, where R_k is the repunit (A002275) of length k.A093402
Primes of the form 40*R_k + 9, where R_k is the repunit (A002275) of length k.
- Primes of the form 50*R_k + 9, where R_k is the repunit (A002275) of length k.A093403
Primes of the form 50*R_k + 9, where R_k is the repunit (A002275) of length k.
- Primes of the form 70*R_k + 9, where R_k is the repunit (A002275) of length k.A093404
Primes of the form 70*R_k + 9, where R_k is the repunit (A002275) of length k.
- Primes of the form 80*R_k + 9, where R_k is the repunit (A002275) of length k.A093405
Primes of the form 80*R_k + 9, where R_k is the repunit (A002275) of length k.
- a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) + a(n-4).A093406
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) + a(n-4).
- For p = prime(n), the least k such that p divides the numerator of a sum 1/k + 1/x1 +...+ 1/xm, where x1,...,xm (for any m) are distinct positive integers <= k.A093407
For p = prime(n), the least k such that p divides the numerator of a sum 1/k + 1/x1 +...+ 1/xm, where x1,...,xm (for any m) are distinct positive integers <= k.
- For p = prime(n), the least k such that p is the numerator of a sum 1/k + 1/x1 +...+ 1/xm, where x1,...,xm (for any m) are distinct positive integers < k.A093408
For p = prime(n), the least k such that p is the numerator of a sum 1/k + 1/x1 +...+ 1/xm, where x1,...,xm (for any m) are distinct positive integers < k.
- Decimal expansion of the smaller real zero of 10x^6 - 75x^3 - 190x + 21.A093409
Decimal expansion of the smaller real zero of 10x^6 - 75x^3 - 190x + 21.
- Erroneous version of A090498.A093410
Erroneous version of A090498.