Sequences
392,541 sequences
- Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082351.A082361
Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082351.
- Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082352.A082362
Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082352.
- Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082355.A082363
Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082355.
- Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082356.A082364
Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082356.
- A Jacobsthal number sequence.A082365
A Jacobsthal number sequence.
- G.f.: (1 - 7*x - sqrt(49*x^2 - 18*x + 1))/(2*x).A082366
G.f.: (1 - 7*x - sqrt(49*x^2 - 18*x + 1))/(2*x).
- G.f.: (1-8*x-sqrt(64*x^2-20*x+1))/(2*x).A082367
G.f.: (1-8*x-sqrt(64*x^2-20*x+1))/(2*x).
- a(n) = (4*n-1)! / (n! * n! * n! * (n-1)! * 3!).A082368
a(n) = (4*n-1)! / (n! * n! * n! * (n-1)! * 3!).
- Numbers congruent to 13 mod 30.A082369
Numbers congruent to 13 mod 30.
- a(n) = number of sets of consecutive primes whose arithmetic mean is A000040(n).A082370
a(n) = number of sets of consecutive primes whose arithmetic mean is A000040(n).
- Indices n such that the congruence prime(n)^x + prime(n+1)^x == prime(n+2) mod prime(n+3) has no solution.A082371
Indices n such that the congruence prime(n)^x + prime(n+1)^x == prime(n+2) mod prime(n+3) has no solution.
- Primes prime(n) such that there are no solutions to the equation prime(n)^x + prime(n+1)^x = prime(n+2) (mod prime(n+3)) with x an integer.A082372
Primes prime(n) such that there are no solutions to the equation prime(n)^x + prime(n+1)^x = prime(n+2) (mod prime(n+3)) with x an integer.
- Table with 4 consecutive primes prime(k), prime(k+1), prime(k+2) and prime(k+3) in a row such that prime(k)^x + prime(k+1)^x == prime(k+2) (mod prime(k+3)) has no solution x.A082373
Table with 4 consecutive primes prime(k), prime(k+1), prime(k+2) and prime(k+3) in a row such that prime(k)^x + prime(k+1)^x == prime(k+2) (mod prime(k+3)) has no solution x.
- Numbers k such that the congruence prime(k+1)^x - prime(k)^x == prime(k+2) mod prime(k+3) does not have a solution.A082374
Numbers k such that the congruence prime(k+1)^x - prime(k)^x == prime(k+2) mod prime(k+3) does not have a solution.
- Irregular triangle read by rows: row n begins with n and decreases by 2 until 0 or 1 is reached, for n >= 0.A082375
Irregular triangle read by rows: row n begins with n and decreases by 2 until 0 or 1 is reached, for n >= 0.
- First of quadruple of consecutive primes p1,p2,p3,p4 such that the congruence p2^x - p1^x == p3 (mod p4) has no solution.A082376
First of quadruple of consecutive primes p1,p2,p3,p4 such that the congruence p2^x - p1^x == p3 (mod p4) has no solution.
- Numbers k such that rad(k) - phi(k) <= 1, where rad = A007947 and phi = A000010.A082377
Numbers k such that rad(k) - phi(k) <= 1, where rad = A007947 and phi = A000010.
- Positive integers that can be written in exactly one way as the product ab of positive integers where a+b is composite.A082378
Positive integers that can be written in exactly one way as the product ab of positive integers where a+b is composite.
- Number of length-n 7/3-power-free words over the alphabet {0,1}.A082379
Number of length-n 7/3-power-free words over the alphabet {0,1}.
- Number of 7/3+-power-free words over the alphabet {0,1}.A082380
Number of 7/3+-power-free words over the alphabet {0,1}.
- Sequence of the squared digital root of a number until 1 or 4 is reached. The initial numbers 1,2,..n are not output.A082381
Sequence of the squared digital root of a number until 1 or 4 is reached. The initial numbers 1,2,..n are not output.
- Table which contains in row n the track of n->A003132(n) until reaching 1 or 4.A082382
Table which contains in row n the track of n->A003132(n) until reaching 1 or 4.
- a(0)=1, a(n)=2^n+n-2*a(n-1).A082383
a(0)=1, a(n)=2^n+n-2*a(n-1).
- a(0)=1, a(n)=2^n+n^2-2*a(n-1).A082384
a(0)=1, a(n)=2^n+n^2-2*a(n-1).
- For each n append T(n), T(T(n)), T^3(n), ..., T^r(n), where T(n) = A055012(n) and r is the smallest integer such that T^r(n) is one of the following numbers: 1, 55, 136, 153, 160, 370, 371, 407, 919.A082385
For each n append T(n), T(T(n)), T^3(n), ..., T^r(n), where T(n) = A055012(n) and r is the smallest integer such that T^r(n) is one of the following numbers: 1, 55, 136, 153, 160, 370, 371, 407, 919.
- Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity).A082386
Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity).
- Numbers k such that (5^k + 2^k)/7 is prime.A082387
Numbers k such that (5^k + 2^k)/7 is prime.
- a(1) = 1, a(2) = 2; further terms are defined by rules that for k >= 2, a(2^k-i) = a(2^k+i) for 1 <= i <= 2^k-1 and a(2^k) = a(2^(k-1)) + Sum_{i < 2^k} a(i).A082388
a(1) = 1, a(2) = 2; further terms are defined by rules that for k >= 2, a(2^k-i) = a(2^k+i) for 1 <= i <= 2^k-1 and a(2^k) = a(2^(k-1)) + Sum_{i < 2^k} a(i).
- a(n) = floor((n+2)*phi) - floor((n+1)*phi) where phi=(1+sqrt(5))/2.A082389
a(n) = floor((n+2)*phi) - floor((n+1)*phi) where phi=(1+sqrt(5))/2.
- Numbers on a computer numpad, read in a clockwise spiral.A082390
Numbers on a computer numpad, read in a clockwise spiral.
- Start with the sequence a(1) to a(4) = 1, 3, 2, 3. Then in step s, append "1", "1,2", or "1,2,3", whichever ends with a(s+2).A082391
Start with the sequence a(1) to a(4) = 1, 3, 2, 3. Then in step s, append "1", "1,2", or "1,2,3", whichever ends with a(s+2).
- Expansion of (1/x) * Sum_{k>=0} x^2^k / (1 - 2*x^2^(k+1)).A082392
Expansion of (1/x) * Sum_{k>=0} x^2^k / (1 - 2*x^2^(k+1)).
- Let p = n-th prime of the form 4k+1, take the integer solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with the smallest y >= 1; sequence gives value of y.A082393
Let p = n-th prime of the form 4k+1, take the integer solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with the smallest y >= 1; sequence gives value of y.
- Let p = n-th prime of the form 4k+3, take the solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and smallest y >= 1; sequence gives value of y.A082394
Let p = n-th prime of the form 4k+3, take the solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and smallest y >= 1; sequence gives value of y.
- Number of shifted Young tableaux with height <= 3.A082395
Number of shifted Young tableaux with height <= 3.
- Numbers k such that k/(2*k-A082851(k)) is an integer.A082396
Numbers k such that k/(2*k-A082851(k)) is an integer.
- Number of directed aggregates of height <= 2 with n cells.A082397
Number of directed aggregates of height <= 2 with n cells.
- Number of directed, diagonally convex polyominoes with n cells.A082398
Number of directed, diagonally convex polyominoes with n cells.
- a(1) = 1; thereafter, a(n) is the smallest nonnegative number such that the number Sum_{i=1..n} a(i)*10^(n-i) is divisible by n.A082399
a(1) = 1; thereafter, a(n) is the smallest nonnegative number such that the number Sum_{i=1..n} a(i)*10^(n-i) is divisible by n.
- Numbers k such that 2^k + 3^(k-1) is prime.A082400
Numbers k such that 2^k + 3^(k-1) is prime.
- a(n) = A005374(n) - floor(r*n) where r is the positive root of x^3+x-1=0.A082401
a(n) = A005374(n) - floor(r*n) where r is the positive root of x^3+x-1=0.
- Number of n-node labeled weakly connected acyclic digraphs.A082402
Number of n-node labeled weakly connected acyclic digraphs.
- E.g.f.: 1-1/B(x) where B(x) is e.g.f. for A003024.A082403
E.g.f.: 1-1/B(x) where B(x) is e.g.f. for A003024.
- Triangle in which n-th row gives trajectory of n under the map x -> x/2 if x is even, x -> x-1 if x is odd, stopping when we reach 1.A082404
Triangle in which n-th row gives trajectory of n under the map x -> x/2 if x is even, x -> x-1 if x is odd, stopping when we reach 1.
- a(n) = 34*a(n-1) - a(n-2); a(0)=0, a(1)=6.A082405
a(n) = 34*a(n-1) - a(n-2); a(0)=0, a(1)=6.
- Numbers k such that k divides Sum_{j=1..k} binomial(2j,j).A082406
Numbers k such that k divides Sum_{j=1..k} binomial(2j,j).
- Define u(k) as u(1)=1, u(k)=binomial(2*u(k-1),u(k-1)) (mod k), sequence gives values of k such that u(k)=0.A082407
Define u(k) as u(1)=1, u(k)=binomial(2*u(k-1),u(k-1)) (mod k), sequence gives values of k such that u(k)=0.
- Least k such that the continued fraction for n/k contains no element > 2.A082408
Least k such that the continued fraction for n/k contains no element > 2.
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.A082409
Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.
- a(1)=0. Thereafter, the sequence is constructed using the rule: for any k >= 0, if a(1), a(2), ..., a(2^k+1) are known, the next 2^k terms are given as follows: a(2^k+1+i) = 1 - a(2^k+1-i) for 1 <= i <= 2^k.A082410
a(1)=0. Thereafter, the sequence is constructed using the rule: for any k >= 0, if a(1), a(2), ..., a(2^k+1) are known, the next 2^k terms are given as follows: a(2^k+1+i) = 1 - a(2^k+1-i) for 1 <= i <= 2^k.