Sequences
392,541 sequences
- a(n) = number of occurrences of n as a trinomial coefficient (in A046816).A094011
a(n) = number of occurrences of n as a trinomial coefficient (in A046816).
- Expansion of x*(1-6*x+10*x^2)/(1-4*x+2*x^2)^2.A094012
Expansion of x*(1-6*x+10*x^2)/(1-4*x+2*x^2)^2.
- Expansion of (1-4*x)/(1-4*x-4*x^2).A094013
Expansion of (1-4*x)/(1-4*x-4*x^2).
- Expansion of (1-2*x)/(1-8*x^2).A094014
Expansion of (1-2*x)/(1-8*x^2).
- Expansion of (1+4*x)/(1-8*x^2).A094015
Expansion of (1+4*x)/(1-8*x^2).
- Complement of A092601.A094016
Complement of A092601.
- Duplicate of A092762.A094017
Duplicate of A092762.
- Records in A092762.A094018
Records in A092762.
- An approximation to Prime(n) and pi(n).A094019
An approximation to Prime(n) and pi(n).
- Least k <= n such that n*bigomega(k) = k*bigomega(n), where bigomega(n) = the number of prime divisors of n (counted with multiplicity) A001222.A094020
Least k <= n such that n*bigomega(k) = k*bigomega(n), where bigomega(n) = the number of prime divisors of n (counted with multiplicity) A001222.
- Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).A094021
Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).
- Expansion of eta(q^2) * eta(q^30) / (eta(q^3) * eta(q^5)) in powers of q.A094022
Expansion of eta(q^2) * eta(q^30) / (eta(q^3) * eta(q^5)) in powers of q.
- Expansion of eta(q^6) * eta(q^10) / (eta(q) * eta(q^15)) in powers of q.A094023
Expansion of eta(q^6) * eta(q^10) / (eta(q) * eta(q^15)) in powers of q.
- Alternating 1 with one less than the powers of 2.A094024
Alternating 1 with one less than the powers of 2.
- Expansion of (1+3x)/((1-x^2)(1-3x^2)).A094025
Expansion of (1+3x)/((1-x^2)(1-3x^2)).
- Expansion of x(1+10x)/((1-x^2)(1-10x^2)).A094026
Expansion of x(1+10x)/((1-x^2)(1-10x^2)).
- Expansion of x(1+100x)/((1-x^2)(1-100x^2)).A094027
Expansion of x(1+100x)/((1-x^2)(1-100x^2)).
- Expansion of 1/((1-x)*(1-100*x)).A094028
Expansion of 1/((1-x)*(1-100*x)).
- Number of n-crossing links with alternating braids of 3 strands.A094029
Number of n-crossing links with alternating braids of 3 strands.
- Number of n-crossing knots with alternating braids of 3 strands.A094030
Number of n-crossing knots with alternating braids of 3 strands.
- Number of n-crossing 2 component links with alternating braids of 3 strands.A094031
Number of n-crossing 2 component links with alternating braids of 3 strands.
- Number of n-crossing 3 component links with alternating braids of 3 strands.A094032
Number of n-crossing 3 component links with alternating braids of 3 strands.
- Number of connected 2-element antichains on a labeled n-set.A094033
Number of connected 2-element antichains on a labeled n-set.
- Number of connected 3-element antichains on a labeled n-set.A094034
Number of connected 3-element antichains on a labeled n-set.
- Number of connected 4-element antichains on a labeled n-set.A094035
Number of connected 4-element antichains on a labeled n-set.
- Number of connected 5-element antichains on a labeled n-set.A094036
Number of connected 5-element antichains on a labeled n-set.
- Number of connected 6-element antichains on a labeled n-set.A094037
Number of connected 6-element antichains on a labeled n-set.
- Binomial transform of (Pell(-n)+Pell(n))/2.A094038
Binomial transform of (Pell(-n)+Pell(n))/2.
- Binomial transform of (Jacobsthal(n) + 2^n*Jacobsthal(-n))/2.A094039
Binomial transform of (Jacobsthal(n) + 2^n*Jacobsthal(-n))/2.
- Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k edges.A094040
Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k edges.
- Beatty sequence for e^Pi - Pi^e - i^i.A094041
Beatty sequence for e^Pi - Pi^e - i^i.
- Beatty sequence for e^Pi - Pi^e - i^i.A094042
Beatty sequence for e^Pi - Pi^e - i^i.
- Alternate composite and prime numbers not included earlier such that every partial concatenation is a prime: a(2n) is prime and a(2n-1) is not prime.A094043
Alternate composite and prime numbers not included earlier such that every partial concatenation is a prime: a(2n) is prime and a(2n-1) is not prime.
- Alternate prime and nonprime numbers not included earlier such that every concatenation of a pair of terms is a prime: a(2n) is nonprime and a(2n-1) is prime.A094044
Alternate prime and nonprime numbers not included earlier such that every concatenation of a pair of terms is a prime: a(2n) is nonprime and a(2n-1) is prime.
- Alternate composite and prime numbers not included earlier such that every concatenation of a pair of terms is a prime: a(2n) is prime and a(2n-1) is nonprime.A094045
Alternate composite and prime numbers not included earlier such that every concatenation of a pair of terms is a prime: a(2n) is prime and a(2n-1) is nonprime.
- Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.A094046
Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.
- Number of seating arrangements of n couples around a round table (up to rotations) so that each person sits between two people of the opposite sex and no couple is seated together.A094047
Number of seating arrangements of n couples around a round table (up to rotations) so that each person sits between two people of the opposite sex and no couple is seated together.
- Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.A094048
Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.
- Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least k for which m^2+1=p(n)*k^2 has a solution.A094049
Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least k for which m^2+1=p(n)*k^2 has a solution.
- Duplicate of A000479.A094050
Duplicate of A000479.
- a(n) = phi(phi(p))/2 where p = prime(n).A094051
a(n) = phi(phi(p))/2 where p = prime(n).
- Number of walks of length n between two adjacent nodes in the cycle graph C_7.A094052
Number of walks of length n between two adjacent nodes in the cycle graph C_7.
- Triangle read by rows: T(n,k) = k*(n-k), 1 <= k <= n.A094053
Triangle read by rows: T(n,k) = k*(n-k), 1 <= k <= n.
- a(n) = round( (sqrt n)^(sqrt n) ).A094054
a(n) = round( (sqrt n)^(sqrt n) ).
- Duplicate of A094056.A094055
Duplicate of A094056.
- Number of digits in A002860(n) (number of Latin squares).A094056
Number of digits in A002860(n) (number of Latin squares).
- Number of decimal digits of Lucas(2^n).A094057
Number of decimal digits of Lucas(2^n).
- Positions of ones in binary expansion of e/4.A094058
Positions of ones in binary expansion of e/4.
- Analog of A054474 for walks on a 3-dimensional grid.A094059
Analog of A054474 for walks on a 3-dimensional grid.
- Number of walks of length n on hexagonal grid that start and end at the origin. Intermediate returns to the origin are not permitted.A094060
Number of walks of length n on hexagonal grid that start and end at the origin. Intermediate returns to the origin are not permitted.