Sequences
392,541 sequences
- Expansion of (1-3x+4x^2-3x^3+x^4)/(1-2x)^2.A084861
Expansion of (1-3x+4x^2-3x^3+x^4)/(1-2x)^2.
- Continued fraction expansion of Sum_{n>=1} zeta( 2*n ) / n!.A084862
Continued fraction expansion of Sum_{n>=1} zeta( 2*n ) / n!.
- Number of solutions to n = 2*u^2 + 3*v^2, u*v>0.A084863
Number of solutions to n = 2*u^2 + 3*v^2, u*v>0.
- Numbers that can be written in the form 2*u^2 + 3*v^2, u*v>0.A084864
Numbers that can be written in the form 2*u^2 + 3*v^2, u*v>0.
- Primes of the form 2x^2 + 3y^2.A084865
Primes of the form 2x^2 + 3y^2.
- Primes that can be written in the form 2*p^2 + 3*q^2 with p and q prime.A084866
Primes that can be written in the form 2*p^2 + 3*q^2 with p and q prime.
- Symmetric square table, read by antidiagonals, such that antidiagonal sums form the first row shifted left: T(0,0)=1, T(0,k) = Sum_{m=0..k-1} T(m,k-1-m) when k > 0; and T(n,k) = T(n-1,k) + T(n,k-1) when n > 0, k > 0.A084867
Symmetric square table, read by antidiagonals, such that antidiagonal sums form the first row shifted left: T(0,0)=1, T(0,k) = Sum_{m=0..k-1} T(m,k-1-m) when k > 0; and T(n,k) = T(n-1,k) + T(n,k-1) when n > 0, k > 0.
- Main diagonal of symmetric square table A084867, in which the antidiagonal sums (A006012) form the first row shifted left.A084868
Main diagonal of symmetric square table A084867, in which the antidiagonal sums (A006012) form the first row shifted left.
- Number of 2-multiantichains of an n-set.A084869
Number of 2-multiantichains of an n-set.
- Number of 3-multiantichains of an n-set.A084870
Number of 3-multiantichains of an n-set.
- Number of 4-multiantichains of an n-set.A084871
Number of 4-multiantichains of an n-set.
- Number of 5-multiantichains of an n-set.A084872
Number of 5-multiantichains of an n-set.
- Number of 6-multiantichains of an n-set.A084873
Number of 6-multiantichains of an n-set.
- Number of (k,m,n)-antichains of multisets with k=3 and m=2.A084874
Number of (k,m,n)-antichains of multisets with k=3 and m=2.
- Number of (k,m,n)-antichains of multisets with k=3 and m=3.A084875
Number of (k,m,n)-antichains of multisets with k=3 and m=3.
- Number of (k,m,n)-antichains of multisets with k=3 and m=4.A084876
Number of (k,m,n)-antichains of multisets with k=3 and m=4.
- Number of (k,m,n)-antichains of multisets with k=3 and m=5.A084877
Number of (k,m,n)-antichains of multisets with k=3 and m=5.
- Number of (k,m,n)-antichains of multisets with k=3 and m=6.A084878
Number of (k,m,n)-antichains of multisets with k=3 and m=6.
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=2.A084879
Number of (k,m,n)-multiantichains of multisets with k=3 and m=2.
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=3.A084880
Number of (k,m,n)-multiantichains of multisets with k=3 and m=3.
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=4.A084881
Number of (k,m,n)-multiantichains of multisets with k=3 and m=4.
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=5.A084882
Number of (k,m,n)-multiantichains of multisets with k=3 and m=5.
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=6.A084883
Number of (k,m,n)-multiantichains of multisets with k=3 and m=6.
- Triangular array, read by rows: T(n,k) = numerator of arithmetic derivative of n/k, 1<=k<=n.A084884
Triangular array, read by rows: T(n,k) = numerator of arithmetic derivative of n/k, 1<=k<=n.
- Triangular array, read by rows: T(n,k) = denominator of arithmetic derivative of n/k, 1<=k<=n.A084885
Triangular array, read by rows: T(n,k) = denominator of arithmetic derivative of n/k, 1<=k<=n.
- Triangular array, read by rows: T(n,k) = numerator of arithmetic derivative of k/n, 1<=k<=n.A084886
Triangular array, read by rows: T(n,k) = numerator of arithmetic derivative of k/n, 1<=k<=n.
- Triangular array, read by rows: T(n,k) = denominator of arithmetic derivative of k/n, 1<=k<=n.A084887
Triangular array, read by rows: T(n,k) = denominator of arithmetic derivative of k/n, 1<=k<=n.
- Number of partitions of n^3 into two squares>0.A084888
Number of partitions of n^3 into two squares>0.
- Duplicate of A000404.A084889
Duplicate of A000404.
- Triangular array, read by rows: T(n,k) = arithmetic derivative of n*k, 1<=k<=n.A084890
Triangular array, read by rows: T(n,k) = arithmetic derivative of n*k, 1<=k<=n.
- Multiples of 2, 3, 5, or 7, but not 7-smooth.A084891
Multiples of 2, 3, 5, or 7, but not 7-smooth.
- Decimal expansion of Product_{j>=1, j!=2} zeta(j/2) (negated).A084892
Decimal expansion of Product_{j>=1, j!=2} zeta(j/2) (negated).
- Decimal expansion of Product_{j>=1, j!=3} zeta(j/3).A084893
Decimal expansion of Product_{j>=1, j!=3} zeta(j/3).
- Number of permutations of length n such that at least one absolute difference between consecutive elements has a distinct partner.A084894
Number of permutations of length n such that at least one absolute difference between consecutive elements has a distinct partner.
- Decimal expansion of agm(1, 3), the arithmetic-geometric mean of 1 and 3.A084895
Decimal expansion of agm(1, 3), the arithmetic-geometric mean of 1 and 3.
- Decimal expansion of agm(1,4), the arithmetic-geometric mean of 1 and 4.A084896
Decimal expansion of agm(1,4), the arithmetic-geometric mean of 1 and 4.
- Decimal expansion of agm(1,5), the arithmetic-geometric mean of 1 and 5.A084897
Decimal expansion of agm(1,5), the arithmetic-geometric mean of 1 and 5.
- Numbers k such that k^k*k! + 1 is prime.A084898
Numbers k such that k^k*k! + 1 is prime.
- Binomial transform of heptagonal numbers A000566.A084899
Binomial transform of heptagonal numbers A000566.
- a(n) = 3^(n-2)*n*(5*n+1)/2.A084900
a(n) = 3^(n-2)*n*(5*n+1)/2.
- a(n) = 4^(n-2)*n*(5*n+3)/2.A084901
a(n) = 4^(n-2)*n*(5*n+3)/2.
- a(n) = 5^(n-1)*n*(n+1)/2.A084902
a(n) = 5^(n-1)*n*(n+1)/2.
- Binomial transform of positive cubes.A084903
Binomial transform of positive cubes.
- Number of places to insert a division operator in the decimal string of n such that an integer results.A084904
Number of places to insert a division operator in the decimal string of n such that an integer results.
- Smallest positive integer resulting after inserting division operator in the decimal string of n.A084905
Smallest positive integer resulting after inserting division operator in the decimal string of n.
- Numbers with at least one place in their decimal representation to insert a division operator such that an integer results.A084906
Numbers with at least one place in their decimal representation to insert a division operator such that an integer results.
- Indices of Fibonacci numbers that satisfy: Sum_{k>=1} 1/F(a(k)) = 1, where F(k) gives the k-th Fibonacci number with F(0)=1, such that the partial sums are nearest to, but never exceed, unity.A084907
Indices of Fibonacci numbers that satisfy: Sum_{k>=1} 1/F(a(k)) = 1, where F(k) gives the k-th Fibonacci number with F(0)=1, such that the partial sums are nearest to, but never exceed, unity.
- Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = 1, such that the partial sums are nearest to, but never exceed, unity.A084908
Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = 1, such that the partial sums are nearest to, but never exceed, unity.
- Indices of Fibonacci numbers that satisfy: Sum_{k>=1} 1/F(a(k)) = tau-1, where F(k) gives the k-th Fibonacci number with F(0)=1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2.A084909
Indices of Fibonacci numbers that satisfy: Sum_{k>=1} 1/F(a(k)) = tau-1, where F(k) gives the k-th Fibonacci number with F(0)=1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2.
- Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = tau-1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2.A084910
Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = tau-1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2.