Sequences
392,541 sequences
- Expansion of (1-2x-sqrt(1-4x+4x^2-4x^3))/(2x^2).A091561
Expansion of (1-2x-sqrt(1-4x+4x^2-4x^3))/(2x^2).
- Triangle read by rows, related to Pascal's triangle, starting with 1, 0, 0.A091562
Triangle read by rows, related to Pascal's triangle, starting with 1, 0, 0.
- Row sums of A090172.A091563
Row sums of A090172.
- Row sums of A090174.A091564
Row sums of A090174.
- Expansion of (1 - x - sqrt(1 - 2*x + x^2 - 8*x^3)) / (4*x^2) in powers of x.A091565
Expansion of (1 - x - sqrt(1 - 2*x + x^2 - 8*x^3)) / (4*x^2) in powers of x.
- Start with 10000 = DIX MILLE in French; to get the next term, replace each single letter with its equivalent Roman number if there is one; read the new number in French and repeat.A091566
Start with 10000 = DIX MILLE in French; to get the next term, replace each single letter with its equivalent Roman number if there is one; read the new number in French and repeat.
- Primes p such that p^2-p-1 is prime.A091567
Primes p such that p^2-p-1 is prime.
- Primes of the form p^2 - p - 1, where p is prime.A091568
Primes of the form p^2 - p - 1, where p is prime.
- a(1) = 1; for n > 1, a(n) is the smallest positive integer not already used such that a(n)*a(n-1) + 1 is a perfect square.A091569
a(1) = 1; for n > 1, a(n) is the smallest positive integer not already used such that a(n)*a(n-1) + 1 is a perfect square.
- Sum of odd proper divisors of n. Sum of the odd divisors of n that are less than n.A091570
Sum of odd proper divisors of n. Sum of the odd divisors of n that are less than n.
- Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_8.A091571
Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_8.
- Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_7.A091572
Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_7.
- Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_6.A091573
Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type E_6.
- Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type D_4.A091574
Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type D_4.
- Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_8.A091575
Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_8.
- Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_7.A091576
Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_7.
- Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_6.A091577
Poincaré series [or Poincare series] of the preprojective algebra of a Dynkin diagram of type E_6.
- Permutation of primes generated by 2-rowed array shown below.A091578
Permutation of primes generated by 2-rowed array shown below.
- Lengths of suffix blocks associated with A090822.A091579
Lengths of suffix blocks associated with A090822.
- Number of partitions of n into decimal palindromes.A091580
Number of partitions of n into decimal palindromes.
- Number of partitions of n into distinct decimal palindromes.A091581
Number of partitions of n into distinct decimal palindromes.
- Number of partitions of the n-th decimal palindrome.A091582
Number of partitions of the n-th decimal palindrome.
- Number of partitions of the n-th decimal palindrome into distinct integers.A091583
Number of partitions of the n-th decimal palindrome into distinct integers.
- Number of partitions of the n-th decimal palindrome into decimal palindromes.A091584
Number of partitions of the n-th decimal palindrome into decimal palindromes.
- Number of partitions of the n-th decimal palindrome into distinct decimal palindromes.A091585
Number of partitions of the n-th decimal palindrome into distinct decimal palindromes.
- First differences of A090822.A091586
First differences of A090822.
- Records in A091579.A091587
Records in A091579.
- A smoothed version of A091587.A091588
A smoothed version of A091587.
- Decimal expansion of the analog of the Mertens constant B_2 in the asymptotic series for the variance of the number of prime factors Omega.A091589
Decimal expansion of the analog of the Mertens constant B_2 in the asymptotic series for the variance of the number of prime factors Omega.
- Number of terms in the simple continued fraction for the 10^n-th harmonic number, H_n = sum_{k=1 to n} (1/k).A091590
Number of terms in the simple continued fraction for the 10^n-th harmonic number, H_n = sum_{k=1 to n} (1/k).
- Number of pairs of twin primes between n^2 and (n+1)^2.A091591
Number of pairs of twin primes between n^2 and (n+1)^2.
- Numbers n such that there are no twin primes between n^2 and (n+1)^2.A091592
Numbers n such that there are no twin primes between n^2 and (n+1)^2.
- Reversion of Jacobsthal numbers A001045.A091593
Reversion of Jacobsthal numbers A001045.
- Triangle read by rows: T(n,m) := Sum_{k=0..floor((n-m)/2)} binomial(n-2k,m) * binomial(n-m-k,k).A091594
Triangle read by rows: T(n,m) := Sum_{k=0..floor((n-m)/2)} binomial(n-2k,m) * binomial(n-m-k,k).
- Triangle read by rows: T(n,m) := Sum_{k=0..floor((n-m)/2)} binomial(n-2k,m) * binomial(n-m-k,k) * 2^k.A091595
Triangle read by rows: T(n,m) := Sum_{k=0..floor((n-m)/2)} binomial(n-2k,m) * binomial(n-m-k,k) * 2^k.
- Expansion of x*(1-2*x^2)/(1-x-2*x^2)^2.A091596
Expansion of x*(1-2*x^2)/(1-x-2*x^2)^2.
- Triangle read by rows: T(n,0) = A001045(n+1), T(n,n)=1, T(n,m) = T(n-1,m-1) + T(n-1,m).A091597
Triangle read by rows: T(n,0) = A001045(n+1), T(n,n)=1, T(n,m) = T(n-1,m-1) + T(n-1,m).
- Triangle read by rows: T(n,0) = A078008(n), T(n,m) = T(n-1,m-1) + T(n-1,m).A091598
Triangle read by rows: T(n,0) = A078008(n), T(n,m) = T(n-1,m-1) + T(n-1,m).
- Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).A091599
Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).
- Expansion of solution to xA(x)(A(x)-x+1)=A(xA(x)).A091600
Expansion of solution to xA(x)(A(x)-x+1)=A(xA(x)).
- Number of compositions (ordered partitions) of n with designated summands.A091601
Number of compositions (ordered partitions) of n with designated summands.
- Triangle: T(n,k) is the number of partitions of n such that some part is repeated k times and no part is repeated more than k times.A091602
Triangle: T(n,k) is the number of partitions of n such that some part is repeated k times and no part is repeated more than k times.
- Matrix inverse of triangle A091602.A091603
Matrix inverse of triangle A091602.
- Matrix square of triangle A091602.A091604
Matrix square of triangle A091602.
- Column 2 of triangle A091602.A091605
Column 2 of triangle A091602.
- Column 3 of triangle A091602.A091606
Column 3 of triangle A091602.
- Column 4 of triangle A091602.A091607
Column 4 of triangle A091602.
- Column 5 of triangle A091602.A091608
Column 5 of triangle A091602.
- Column 6 of triangle A091602.A091609
Column 6 of triangle A091602.
- Row sums of triangle A091604.A091610
Row sums of triangle A091604.