Sequences
392,541 sequences
- Fourth binomial transform of A010686 (period 2: repeat 1,5).A080961
Fourth binomial transform of A010686 (period 2: repeat 1,5).
- 5th binomial transform of the periodic sequence (1,6,1,1,6,1...).A080962
5th binomial transform of the periodic sequence (1,6,1,1,6,1...).
- Expansion of theta_3(q)*theta_3(q^2)*theta_4(q^8) in powers of q.A080963
Expansion of theta_3(q)*theta_3(q^2)*theta_4(q^8) in powers of q.
- Euler transform of period-16 sequence [2,-3,2,1,2,-3,2,-6,2,-3,2,1,2,-3,2,-3,...].A080964
Euler transform of period-16 sequence [2,-3,2,1,2,-3,2,-6,2,-3,2,1,2,-3,2,-3,...].
- Expansion of eta(q^2)^12/(eta(q)^4eta(q^4)^5) in powers of q.A080965
Expansion of eta(q^2)^12/(eta(q)^4eta(q^4)^5) in powers of q.
- Expansion of theta_4(q^2) * theta_2(q)^2/(4*q^(1/2)) in powers of q.A080966
Expansion of theta_4(q^2) * theta_2(q)^2/(4*q^(1/2)) in powers of q.
- Orbit size of each tree encoded by A014486(n) under Donaghey's "Map M" Catalan automorphism.A080967
Orbit size of each tree encoded by A014486(n) under Donaghey's "Map M" Catalan automorphism.
- Orbit size of each branch-reduced tree encoded by A080981(n) under Donaghey's "Map M" Catalan automorphism.A080968
Orbit size of each branch-reduced tree encoded by A080981(n) under Donaghey's "Map M" Catalan automorphism.
- Orbit size of each non-branch-reduced tree encoded by A080971(n) under Donaghey's "Map M" Catalan automorphism.A080969
Orbit size of each non-branch-reduced tree encoded by A080971(n) under Donaghey's "Map M" Catalan automorphism.
- A014486-indices of the trees whose interior zigzag-tree (Stanley's c) is not branch-reduced (in the sense defined by Donaghey).A080970
A014486-indices of the trees whose interior zigzag-tree (Stanley's c) is not branch-reduced (in the sense defined by Donaghey).
- A014486-encodings of the trees whose interior zigzag-tree (Stanley's c) is not branch-reduced (in the sense defined by Donaghey).A080971
A014486-encodings of the trees whose interior zigzag-tree (Stanley's c) is not branch-reduced (in the sense defined by Donaghey).
- a(n) = A080969(n)/A080967(A080979(A080970(n))).A080972
a(n) = A080969(n)/A080967(A080979(A080970(n))).
- A014486-encoding of the "Moose trees".A080973
A014486-encoding of the "Moose trees".
- A063171-encoding of the "Moose trees".A080974
A063171-encoding of the "Moose trees".
- A014486-index of the "Moose trees".A080975
A014486-index of the "Moose trees".
- a(n) = A080301(A080973(n)).A080976
a(n) = A080301(A080973(n)).
- a(n) = A080272(2*n)/A080292(n).A080977
a(n) = A080272(2*n)/A080292(n).
- a(n) = 2*A006046(n) + 1.A080978
a(n) = 2*A006046(n) + 1.
- Each tree encoded in A014486 mapped to the corresponding branch-reduced zigzag-tree (positions in A014486).A080979
Each tree encoded in A014486 mapped to the corresponding branch-reduced zigzag-tree (positions in A014486).
- A014486-indices of the trees whose interior zigzag-tree (Stanley's c) is branch-reduced (in the sense defined by Donaghey).A080980
A014486-indices of the trees whose interior zigzag-tree (Stanley's c) is branch-reduced (in the sense defined by Donaghey).
- A014486-encodings of the trees whose interior zigzag-tree (Stanley's c) is branch-reduced (in the sense defined by Donaghey).A080981
A014486-encodings of the trees whose interior zigzag-tree (Stanley's c) is branch-reduced (in the sense defined by Donaghey).
- Smallest k such that the k-th triangular number has n^2 as divisor.A080982
Smallest k such that the k-th triangular number has n^2 as divisor.
- Smallest triangular number having n^2 as divisor.A080983
Smallest triangular number having n^2 as divisor.
- Define b by b(1) = 1 and for n > 1, b(n) = b(n-1) + 1/(2 + 1/b(n-1)); sequence gives numerator of b(n).A080984
Define b by b(1) = 1 and for n > 1, b(n) = b(n-1) + 1/(2 + 1/b(n-1)); sequence gives numerator of b(n).
- Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(2+1/b(n-1)); sequence gives denominator of b(n).A080985
Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(2+1/b(n-1)); sequence gives denominator of b(n).
- Ratios of successive terms of A080984.A080986
Ratios of successive terms of A080984.
- Ratios of successive terms of A080985.A080987
Ratios of successive terms of A080985.
- Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(3+1/b(n-1)); sequence gives numerator of b(n).A080988
Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(3+1/b(n-1)); sequence gives numerator of b(n).
- Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(3+1/b(n-1)); sequence gives denominator of b(n).A080989
Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(3+1/b(n-1)); sequence gives denominator of b(n).
- Ratios of successive terms of A080988.A080990
Ratios of successive terms of A080988.
- Ratios of successive terms of A080989.A080991
Ratios of successive terms of A080989.
- Entries in Dürer's magic square.A080992
Entries in Dürer's magic square.
- Point values of letters and blank in Scrabble (English version).A080993
Point values of letters and blank in Scrabble (English version).
- Number of letters and blanks in Scrabble (English version).A080994
Number of letters and blanks in Scrabble (English version).
- Characteristic function of generalized pentagonal numbers A001318.A080995
Characteristic function of generalized pentagonal numbers A001318.
- Special values of the hypergeometric function 3F1: a(n) = binomial(n,2) * hypergeom([1,-n+1,-n+2],[3],1).A080996
Special values of the hypergeometric function 3F1: a(n) = binomial(n,2) * hypergeom([1,-n+1,-n+2],[3],1).
- The positive integers arranged in nonincreasing order of centrality (the fraction of n represented by the average gcd of n and the other positive integers).A080997
The positive integers arranged in nonincreasing order of centrality (the fraction of n represented by the average gcd of n and the other positive integers).
- a(n) is n's rank among the positive integers in terms of centrality: the fraction of n represented by the average gcd of n and the positive integers, or A018804(n)/n^2 (cf. A080997).A080998
a(n) is n's rank among the positive integers in terms of centrality: the fraction of n represented by the average gcd of n and the positive integers, or A018804(n)/n^2 (cf. A080997).
- Centrality of A080997(n) = a(n)/(A080997(n))^2.A080999
Centrality of A080997(n) = a(n)/(A080997(n))^2.
- n is a member if and only if it ranks among top n positive integers in centrality (cf. A080997 for fuller description of this concept).A081000
n is a member if and only if it ranks among top n positive integers in centrality (cf. A080997 for fuller description of this concept).
- n is in the sequence if and only if it does not rank among the top n positive integers in centrality (cf. A080997 for fuller explanation of this concept).A081001
n is in the sequence if and only if it does not rank among the top n positive integers in centrality (cf. A080997 for fuller explanation of this concept).
- a(n) = Fibonacci(4n) + 1, or Fibonacci(2n-1)*Lucas(2n+1).A081002
a(n) = Fibonacci(4n) + 1, or Fibonacci(2n-1)*Lucas(2n+1).
- a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).A081003
a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).
- a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).A081004
a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).
- a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).A081005
a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).
- a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).A081006
a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).
- a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).A081007
a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).
- a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).A081008
a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).
- a(n) = Fibonacci(4n+3) - 1, or Fibonacci(2n+2)*Lucas(2n+1).A081009
a(n) = Fibonacci(4n+3) - 1, or Fibonacci(2n+2)*Lucas(2n+1).
- a(n) = Fibonacci(4n+1) + 2, or Fibonacci(2n-1)*Lucas(2n+2).A081010
a(n) = Fibonacci(4n+1) + 2, or Fibonacci(2n-1)*Lucas(2n+2).