Sequences
392,541 sequences
- a(n) = Sum_{i=0..floor(n/2)} (-1)^(i+floor(n/2))*T(2i+e), where T(n) are tribonacci numbers (A000073) and e = (1/2)(1-(-1)^n).A075111
a(n) = Sum_{i=0..floor(n/2)} (-1)^(i+floor(n/2))*T(2i+e), where T(n) are tribonacci numbers (A000073) and e = (1/2)(1-(-1)^n).
- a(n)=Sum((-1)^(i+Floor(n/2))S(2i+e),(i=0,..,Floor(n/2))), where S(n) are generalized Tetranacci numbers (A073817) and e=(1/2)(1-(-1)^n).A075112
a(n)=Sum((-1)^(i+Floor(n/2))S(2i+e),(i=0,..,Floor(n/2))), where S(n) are generalized Tetranacci numbers (A073817) and e=(1/2)(1-(-1)^n).
- a(n) = A000217(n) - A048702(n).A075113
a(n) = A000217(n) - A048702(n).
- Perfect powers k such that 2*k + 1 is a perfect power; the value of y^b in the solution of the Diophantine equation x^a - 2y^b = 1.A075114
Perfect powers k such that 2*k + 1 is a perfect power; the value of y^b in the solution of the Diophantine equation x^a - 2y^b = 1.
- Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)).A075115
Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)).
- Binomial transform of A073817: a(n)=Sum(Binomial(n,k)*A073817(k),(k=0,..,n)).A075116
Binomial transform of A073817: a(n)=Sum(Binomial(n,k)*A073817(k),(k=0,..,n)).
- Table by antidiagonals of generalized Lucas numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=2 and T(n,1)=1.A075117
Table by antidiagonals of generalized Lucas numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=2 and T(n,1)=1.
- Variant on Lucas numbers: a(n) = a(n-1) + 3*a(n-2) with a(0)=2 and a(1)=1.A075118
Variant on Lucas numbers: a(n) = a(n-1) + 3*a(n-2) with a(0)=2 and a(1)=1.
- Denominator of n/floor(sqrt(n)); numerator is A073890(n).A075119
Denominator of n/floor(sqrt(n)); numerator is A073890(n).
- Number of steps to reach the first integer (= A075121(n)) starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.A075120
Number of steps to reach the first integer (= A075121(n)) starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
- First integer reached when starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x) A075120(n) times, or -1 if no integer is ever reached.A075121
First integer reached when starting with n/floor(sqrt(n)) and iterating the map x -> x*ceiling(x) A075120(n) times, or -1 if no integer is ever reached.
- a(n) = least positive integer > a(n-1) and not a(i)+2*a(j) for 1<=i<j<n.A075122
a(n) = least positive integer > a(n-1) and not a(i)+2*a(j) for 1<=i<j<n.
- a(n) is the least positive integer > a(n-1) and a(n) is not 2*a(i)+a(j) for 1<=i<j<n.A075123
a(n) is the least positive integer > a(n-1) and a(n) is not 2*a(i)+a(j) for 1<=i<j<n.
- Orders of symmetric, cubic, connected graphs, sorted from smallest to largest with duplications when there exist multiple such graphs of the same order.A075124
Orders of symmetric, cubic, connected graphs, sorted from smallest to largest with duplications when there exist multiple such graphs of the same order.
- Number of parallelogram polyominoes of site-perimeter n (also called staircase polyominoes, although that term is overused).A075125
Number of parallelogram polyominoes of site-perimeter n (also called staircase polyominoes, although that term is overused).
- Number of bargraphs of site-perimeter n.A075126
Number of bargraphs of site-perimeter n.
- Safe perfect powers: perfect powers n such that (n-1)/2 is also a perfect power.A075127
Safe perfect powers: perfect powers n such that (n-1)/2 is also a perfect power.
- Binomial transform of generalized tetranacci numbers A073817: a(n)=Sum((-1)^k Binomial(n,k)*A073817(k),(k=0,..,n)).A075128
Binomial transform of generalized tetranacci numbers A073817: a(n)=Sum((-1)^k Binomial(n,k)*A073817(k),(k=0,..,n)).
- Binomial transform of reflected tetranacci numbers A074058: a(n)=Sum((-1)^k Binomial(n,k)*A074058(k),(k=0,..,n)).A075129
Binomial transform of reflected tetranacci numbers A074058: a(n)=Sum((-1)^k Binomial(n,k)*A074058(k),(k=0,..,n)).
- Primes with decimal representation 140{{0}10{9}89}.A075130
Primes with decimal representation 140{{0}10{9}89}.
- Picture-perfect numbers of form 57*p for p in A075130. The decimal reversal is equal to the sum of the reversed proper divisors.A075131
Picture-perfect numbers of form 57*p for p in A075130. The decimal reversal is equal to the sum of the reversed proper divisors.
- a(0)=1; for n > 0, a(n)=sum(binomial(n,k)*binomial(n+k,k+1)*binomial(n+k+1,k),k=0..n)/n.A075132
a(0)=1; for n > 0, a(n)=sum(binomial(n,k)*binomial(n+k,k+1)*binomial(n+k+1,k),k=0..n)/n.
- Indices of double-safe primes: p=prime(n) is double-safe: q=(p-1)/2 & r=(q-1)/2 are both prime (and q is safe).A075133
Indices of double-safe primes: p=prime(n) is double-safe: q=(p-1)/2 & r=(q-1)/2 are both prime (and q is safe).
- Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).A075134
Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).
- Numerator of the generalized harmonic number H(n,3,1) described below.A075135
Numerator of the generalized harmonic number H(n,3,1) described below.
- Numerator of the generalized harmonic number H(n,4,1).A075136
Numerator of the generalized harmonic number H(n,4,1).
- Numerator of the generalized harmonic number H(n,5,1).A075137
Numerator of the generalized harmonic number H(n,5,1).
- Denominator of the generalized harmonic number H(n,5,1).A075138
Denominator of the generalized harmonic number H(n,5,1).
- Numerator of the generalized harmonic number H(n,5,2).A075139
Numerator of the generalized harmonic number H(n,5,2).
- Denominator of the generalized harmonic number H(n,5,2).A075140
Denominator of the generalized harmonic number H(n,5,2).
- Numerator of the generalized harmonic number H(n,5,3).A075141
Numerator of the generalized harmonic number H(n,5,3).
- Denominator of the generalized harmonic number H(n,5,3).A075142
Denominator of the generalized harmonic number H(n,5,3).
- Numerator of the generalized harmonic number H(n,5,4).A075143
Numerator of the generalized harmonic number H(n,5,4).
- Denominator of the generalized harmonic number H(n,5,4).A075144
Denominator of the generalized harmonic number H(n,5,4).
- Prime basis of A061373.A075145
Prime basis of A061373.
- n-th perfect power - n-th prime: pp(n) - prime(n).A075146
n-th perfect power - n-th prime: pp(n) - prime(n).
- Number of Lyndon words (aperiodic necklaces) with n beads of n colors.A075147
Number of Lyndon words (aperiodic necklaces) with n beads of n colors.
- Table E(n,k) (listed antidiagonalwise as E(0,0), E(1,0), E(0,1), E(2,0), E(1,1), E(0,2), ...) where E(n,k) is F(n+k) for all even n and L(n+k) for all odd n. F(n) and L(n) are the n-th Fibonacci (A000045) and Lucas (A000032) numbers respectively.A075148
Table E(n,k) (listed antidiagonalwise as E(0,0), E(1,0), E(0,1), E(2,0), E(1,1), E(0,2), ...) where E(n,k) is F(n+k) for all even n and L(n+k) for all odd n. F(n) and L(n) are the n-th Fibonacci (A000045) and Lucas (A000032) numbers respectively.
- Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].A075149
Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].
- a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).A075150
a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).
- a(n)=L(n)^2*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (comment to A061084).A075151
a(n)=L(n)^2*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (comment to A061084).
- Number of possible permutations of a Rubik cube of size n X n X n.A075152
Number of possible permutations of a Rubik cube of size n X n X n.
- Trajectory of 318 under the Reverse and Add! operation carried out in base 4, written in base 10.A075153
Trajectory of 318 under the Reverse and Add! operation carried out in base 4, written in base 10.
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.A075154
a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.
- Cubes of Lucas numbers.A075155
Cubes of Lucas numbers.
- Binomial transform of pentanacci numbers A074048: a(n) = Sum_{k=0..n} binomial(n,k)*A074048(k).A075156
Binomial transform of pentanacci numbers A074048: a(n) = Sum_{k=0..n} binomial(n,k)*A074048(k).
- Run lengths in the binary expansion of n gives the vector of exponents in prime factorization of a(n)+1, with the least significant run corresponding to the exponent of the least prime, 2; with one subtracted from each run length, except for the most significant run of 1's.A075157
Run lengths in the binary expansion of n gives the vector of exponents in prime factorization of a(n)+1, with the least significant run corresponding to the exponent of the least prime, 2; with one subtracted from each run length, except for the most significant run of 1's.
- Prime factorization of n+1 encoded with the run lengths of binary expansion.A075158
Prime factorization of n+1 encoded with the run lengths of binary expansion.
- Run lengths in the binary expansion of n-1 gives the vector of exponents in prime factorization of a(n), with the least significant run corresponding to the exponent of the least prime, 2.A075159
Run lengths in the binary expansion of n-1 gives the vector of exponents in prime factorization of a(n), with the least significant run corresponding to the exponent of the least prime, 2.
- Prime factorization of n encoded with the run lengths of binary expansion + 1.A075160
Prime factorization of n encoded with the run lengths of binary expansion + 1.