Sequences
392,541 sequences
- a(n) = sum of absolute values of coefficients of (1+x-x^2)^n.A084611
a(n) = sum of absolute values of coefficients of (1+x-x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x - 2*x^2)^n.A084612
Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x - 2*x^2)^n.
- a(n) = sum of absolute values of coefficients of (1 + x - 2*x^2)^n.A084613
a(n) = sum of absolute values of coefficients of (1 + x - 2*x^2)^n.
- Triangle, read by rows, where the n-th row lists the (2*n+1) coefficients of (1 + x - 3*x^2)^n.A084614
Triangle, read by rows, where the n-th row lists the (2*n+1) coefficients of (1 + x - 3*x^2)^n.
- a(n) = sum of absolute values of coefficients of (1+x-3x^2)^n.A084615
a(n) = sum of absolute values of coefficients of (1+x-3x^2)^n.
- Maximum number of circles of diameter 1 that can be packed in a square of area n (i.e., with side length n^(1/2)).A084616
Maximum number of circles of diameter 1 that can be packed in a square of area n (i.e., with side length n^(1/2)).
- Maximum number of circles with diameter 1 that can be packed in a square of side length n.A084617
Maximum number of circles with diameter 1 that can be packed in a square of side length n.
- Maximum number of circles of area 1 that can be packed in a circle of area n.A084618
Maximum number of circles of area 1 that can be packed in a circle of area n.
- Duplicate of A023393.A084619
Duplicate of A023393.
- Numbers n such that concatenation of Fibonacci n and its 10's complement is a prime.A084620
Numbers n such that concatenation of Fibonacci n and its 10's complement is a prime.
- Numbers k such that Fibonacci(k) concatenated with its 10's complement is prime.A084621
Numbers k such that Fibonacci(k) concatenated with its 10's complement is prime.
- Numbers n such that f(n) is a strict local extremum for the function f(x) = phi(x) + sigma(x); i.e., either f(n) > f(n-1) and f(n) > f(n+1) or f(n) < f(n-1) and f(n) < f(n+1).A084622
Numbers n such that f(n) is a strict local extremum for the function f(x) = phi(x) + sigma(x); i.e., either f(n) > f(n-1) and f(n) > f(n+1) or f(n) < f(n-1) and f(n) < f(n+1).
- Numerator of 2^(n-1)/n.A084623
Numerator of 2^(n-1)/n.
- a(n) = floor(C(n+5,5)/C(n+2,2)).A084624
a(n) = floor(C(n+5,5)/C(n+2,2)).
- Binomial transform of A084624.A084625
Binomial transform of A084624.
- a(n) = floor(C(n+6,6)/C(n+2,2)).A084626
a(n) = floor(C(n+6,6)/C(n+2,2)).
- a(n) = floor(C(n+6,6)/C(n+3,3)).A084627
a(n) = floor(C(n+6,6)/C(n+3,3)).
- a(n) = floor(binomial(n+7,7)/binomial(n+3,3)).A084628
a(n) = floor(binomial(n+7,7)/binomial(n+3,3)).
- Brilliant numbers such that when they are concatenated with their 10's complement, which also must be brilliant, the result is a prime.A084629
Brilliant numbers such that when they are concatenated with their 10's complement, which also must be brilliant, the result is a prime.
- a(n) = floor(C(n+7,7)/C(n+5,5)).A084630
a(n) = floor(C(n+7,7)/C(n+5,5)).
- a(n) = floor(C(n+8,8)/C(n+2,2)).A084631
a(n) = floor(C(n+8,8)/C(n+2,2)).
- Semiprimes such that when they are concatenated with their 10's complement, which also must be a semiprime, the result is a prime.A084632
Semiprimes such that when they are concatenated with their 10's complement, which also must be a semiprime, the result is a prime.
- Inverse binomial transform of repeated odd numbers.A084633
Inverse binomial transform of repeated odd numbers.
- Binomial transform of 1, 1, 1, 2, 2, 2, 2, 2, ...A084634
Binomial transform of 1, 1, 1, 2, 2, 2, 2, 2, ...
- Binomial transform of 1,0,1,0,1,1,1,...A084635
Binomial transform of 1,0,1,0,1,1,1,...
- Binomial transform of (1,0,1,0,1,0,2,0,2,0,2,0,...).A084636
Binomial transform of (1,0,1,0,1,0,2,0,2,0,2,0,...).
- Binomial transform of (1,0,1,0,1,0,1,1,1,1,1,...).A084637
Binomial transform of (1,0,1,0,1,0,1,1,1,1,1,...).
- Binomial transform of (1,0,1,0,1,0,1,0,2,0,2,0,2,....).A084638
Binomial transform of (1,0,1,0,1,0,1,0,2,0,2,0,2,....).
- Expansion of x*(1+2*x)/((1+x)*(1-x)*(1-2*x)).A084639
Expansion of x*(1+2*x)/((1+x)*(1-x)*(1-2*x)).
- Generalized Jacobsthal numbers.A084640
Generalized Jacobsthal numbers.
- Binomial transform of n^7.A084641
Binomial transform of n^7.
- A Jacobsthal ratio.A084642
A Jacobsthal ratio.
- a(n) = 3^(n-1)*(2*n-3) + 2^(n+1).A084643
a(n) = 3^(n-1)*(2*n-3) + 2^(n+1).
- Best packings of m>1 equal circles into a larger circle setting a new density record.A084644
Best packings of m>1 equal circles into a larger circle setting a new density record.
- Hypotenuses for which there exists a unique integer-sided right triangle.A084645
Hypotenuses for which there exists a unique integer-sided right triangle.
- Hypotenuses for which there exist exactly 2 distinct integer triangles.A084646
Hypotenuses for which there exist exactly 2 distinct integer triangles.
- Hypotenuses for which there exist exactly 3 distinct integer triangles.A084647
Hypotenuses for which there exist exactly 3 distinct integer triangles.
- Hypotenuses for which there exist exactly 4 distinct integer triangles.A084648
Hypotenuses for which there exist exactly 4 distinct integer triangles.
- Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles.A084649
Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles.
- Duplicate of A067919.A084650
Duplicate of A067919.
- Engel expansion for cos(1).A084651
Engel expansion for cos(1).
- Engel expansion for tan(1).A084652
Engel expansion for tan(1).
- Pseudoprimes whose prime factors do not divide any smaller pseudoprime.A084653
Pseudoprimes whose prime factors do not divide any smaller pseudoprime.
- Smallest prime factor of pseudoprimes in A084653.A084654
Smallest prime factor of pseudoprimes in A084653.
- Largest prime factor of pseudoprimes in A084653.A084655
Largest prime factor of pseudoprimes in A084653.
- Number of unlabeled connected claw-free cubic graphs on 2n vertices.A084656
Number of unlabeled connected claw-free cubic graphs on 2n vertices.
- Number of unlabeled 2-connected claw-free cubic graphs on 2n vertices.A084657
Number of unlabeled 2-connected claw-free cubic graphs on 2n vertices.
- Number of unlabeled 3-connected claw-free cubic graphs on 2n vertices.A084658
Number of unlabeled 3-connected claw-free cubic graphs on 2n vertices.
- Number of labeled claw-free cubic graphs on 2n nodes (not necessarily connected).A084659
Number of labeled claw-free cubic graphs on 2n nodes (not necessarily connected).
- Decimal expansion of solution of area bisectors problem.A084660
Decimal expansion of solution of area bisectors problem.