Sequences
392,541 sequences
- a(n) = Fibonacci(4n+3) + 2, or Fibonacci(2n+3)*Lucas(2n).A081011
a(n) = Fibonacci(4n+3) + 2, or Fibonacci(2n+3)*Lucas(2n).
- a(n) = Fibonacci(4n+1) - 2, or Fibonacci(2n+2)*Lucas(2n-1).A081012
a(n) = Fibonacci(4n+1) - 2, or Fibonacci(2n+2)*Lucas(2n-1).
- a(n) = Fibonacci(4*n+3) - 2, or Fibonacci(2*n)*Lucas(2*n+3).A081013
a(n) = Fibonacci(4*n+3) - 2, or Fibonacci(2*n)*Lucas(2*n+3).
- a(n) = Lucas(4*n+1) + 1, or Lucas(2*n)*Lucas(2*n+1).A081014
a(n) = Lucas(4*n+1) + 1, or Lucas(2*n)*Lucas(2*n+1).
- a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).A081015
a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).
- a(n) = (Lucas(4*n+3) + 1)/5, or Fibonacci(2*n+1)*Fibonacci(2*n+2), or A081015(n)/5.A081016
a(n) = (Lucas(4*n+3) + 1)/5, or Fibonacci(2*n+1)*Fibonacci(2*n+2), or A081015(n)/5.
- a(n) = Lucas(4n+1) - 1, or 5*Fibonacci(2n)*Fibonacci(2n+1).A081017
a(n) = Lucas(4n+1) - 1, or 5*Fibonacci(2n)*Fibonacci(2n+1).
- a(n) = (Lucas(4n+1)-1)/5, or Fibonacci(2n)*Fibonacci(2n+1), or A081017(n)/5.A081018
a(n) = (Lucas(4n+1)-1)/5, or Fibonacci(2n)*Fibonacci(2n+1), or A081017(n)/5.
- a(n) = Lucas(4n+3) - 1, or Lucas(2n+1)*Lucas(2n+2).A081019
a(n) = Lucas(4n+3) - 1, or Lucas(2n+1)*Lucas(2n+2).
- Even order Taylor coefficients at x = 0 of exp(-x^2/(x^2-2)), odd order coefficients being equal to zero.A081020
Even order Taylor coefficients at x = 0 of exp(-x^2/(x^2-2)), odd order coefficients being equal to zero.
- Even order Taylor coefficients at x = 0 of exp( (sqrt(2)-sqrt(-2*x^2+2))/(-2*x^2+2)^(1/2) ), odd order coefficients being equal to zero.A081021
Even order Taylor coefficients at x = 0 of exp( (sqrt(2)-sqrt(-2*x^2+2))/(-2*x^2+2)^(1/2) ), odd order coefficients being equal to zero.
- Even order Taylor coefficients at x = 0 of exp( -(-2^(1/3)+(-3*x^2+2)^(1/3))/(-3*x^2+2)^(1/3) ), odd order coefficients being equal to zero.A081022
Even order Taylor coefficients at x = 0 of exp( -(-2^(1/3)+(-3*x^2+2)^(1/3))/(-3*x^2+2)^(1/3) ), odd order coefficients being equal to zero.
- Sequence based on wholly inaccurate version of Aronson's sentence (cf. A005224): "T is the second, third, fifth, sixth, seventh . . . letter of this sentence, not counting commas or spaces", where the sentence indicates exactly those letters that are not "T"s.A081023
Sequence based on wholly inaccurate version of Aronson's sentence (cf. A005224): "T is the second, third, fifth, sixth, seventh . . . letter of this sentence, not counting commas or spaces", where the sentence indicates exactly those letters that are not "T"s.
- Complement of A081023: actual locations of "t" in this wholly inaccurate variation of the Aronson sentence: "T is the second, third, fifth, sixth, seventh . . . letter of this sentence, not counting commas or spaces".A081024
Complement of A081023: actual locations of "t" in this wholly inaccurate variation of the Aronson sentence: "T is the second, third, fifth, sixth, seventh . . . letter of this sentence, not counting commas or spaces".
- Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) is smallest (n odd) or largest (n even) new number that is the sum of two distinct earlier terms.A081025
Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) is smallest (n odd) or largest (n even) new number that is the sum of two distinct earlier terms.
- Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = smallest (n odd) or largest (n even) number > a(n-1) that is a unique sum of two distinct earlier terms.A081026
Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = smallest (n odd) or largest (n even) number > a(n-1) that is a unique sum of two distinct earlier terms.
- Primes that are not in A080608.A081027
Primes that are not in A080608.
- Numbers k such that k-th term of A080997 is prime.A081028
Numbers k such that k-th term of A080997 is prime.
- Highly central numbers: numbers having a centrality higher than that of any larger number.A081029
Highly central numbers: numbers having a centrality higher than that of any larger number.
- a(n) = largest k such that (sum of digits of k^n) >= k.A081030
a(n) = largest k such that (sum of digits of k^n) >= k.
- Positions of white keys on piano keyboard, starting with A0 = the 1st key.A081031
Positions of white keys on piano keyboard, starting with A0 = the 1st key.
- Positions of black keys on piano keyboard, starting with A0 = the 1st key.A081032
Positions of black keys on piano keyboard, starting with A0 = the 1st key.
- 6th binomial transform of the periodic sequence (1,7,1,1,7,1...).A081033
6th binomial transform of the periodic sequence (1,7,1,1,7,1...).
- 7th binomial transform of the periodic sequence (1,8,1,1,8,1...).A081034
7th binomial transform of the periodic sequence (1,8,1,1,8,1...).
- 8th binomial transform of the periodic sequence (1,9,1,1,9,1...).A081035
8th binomial transform of the periodic sequence (1,9,1,1,9,1...).
- 9th binomial transform of the periodic sequence (1,10,1,1,10,1...).A081036
9th binomial transform of the periodic sequence (1,10,1,1,10,1...).
- Inverse binary transform of A027656.A081037
Inverse binary transform of A027656.
- 3rd binomial transform of (1,2,0,0,0,0,0,0,...).A081038
3rd binomial transform of (1,2,0,0,0,0,0,0,...).
- 4th binomial transform of (1,3,0,0,0,0,0,.....).A081039
4th binomial transform of (1,3,0,0,0,0,0,.....).
- 5th binomial transform of (1,4,0,0,0,0,...).A081040
5th binomial transform of (1,4,0,0,0,0,...).
- 6th binomial transform of (1,5,0,0,0,0,0,0,...).A081041
6th binomial transform of (1,5,0,0,0,0,0,0,...).
- 7th binomial transform of (1,6,0,0,0,0,0,0,...).A081042
7th binomial transform of (1,6,0,0,0,0,0,0,...).
- 8th binomial transform of (1,7,0,0,0,0,0,...).A081043
8th binomial transform of (1,7,0,0,0,0,0,...).
- 9th binomial transform of (1,8,0,0,0,0,0,0,.....).A081044
9th binomial transform of (1,8,0,0,0,0,0,0,.....).
- 10th binomial transform of (1,9,0,0,0,0,0,...).A081045
10th binomial transform of (1,9,0,0,0,0,0,...).
- Difference of the first two Stirling numbers of the first kind.A081046
Difference of the first two Stirling numbers of the first kind.
- Difference of Stirling numbers of the first kind.A081047
Difference of Stirling numbers of the first kind.
- Signed Stirling numbers of the first kind.A081048
Signed Stirling numbers of the first kind.
- Generalized Stirling numbers of the first kind.A081049
Generalized Stirling numbers of the first kind.
- Generalized Stirling numbers of the first kind.A081050
Generalized Stirling numbers of the first kind.
- Stirling numbers of the first kind.A081051
Stirling numbers of the first kind.
- Difference of Stirling numbers of the first kind.A081052
Difference of Stirling numbers of the first kind.
- Sum of a prime and the square of a prime.A081053
Sum of a prime and the square of a prime.
- Crossing matchings: linear chord diagrams with 2n nodes and n arcs in which each arc crosses another arc.A081054
Crossing matchings: linear chord diagrams with 2n nodes and n arcs in which each arc crosses another arc.
- Number of partitions of 2n in which no parts are multiples of 4.A081055
Number of partitions of 2n in which no parts are multiples of 4.
- Number of partitions of 2n+1 in which no parts are multiples of 4.A081056
Number of partitions of 2n+1 in which no parts are multiples of 4.
- E.g.f.: Sum_{n>=0} a(n)*x^n/n! = {Sum_{n>=0} F(n+1)*x^n/n!}^2, where F(n) is the n-th Fibonacci number.A081057
E.g.f.: Sum_{n>=0} a(n)*x^n/n! = {Sum_{n>=0} F(n+1)*x^n/n!}^2, where F(n) is the n-th Fibonacci number.
- Number of shuffles in Guy's shuffle (see A035485) for the card that is at the top of the deck after n shuffles to come to the top again.A081058
Number of shuffles in Guy's shuffle (see A035485) for the card that is at the top of the deck after n shuffles to come to the top again.
- Shuffle number in Guy's shuffle (see A035485) for the card that is at the top of the deck after n shuffles to come to the top again.A081059
Shuffle number in Guy's shuffle (see A035485) for the card that is at the top of the deck after n shuffles to come to the top again.
- Product of differences of distinct prime factors of n.A081060
Product of differences of distinct prime factors of n.