Sequences
392,541 sequences
- Eighth column of Catalan triangle A009766.A064061
Eighth column of Catalan triangle A009766.
- Generalized Catalan numbers C(2; n).A064062
Generalized Catalan numbers C(2; n).
- Generalized Catalan numbers C(3; n).A064063
Generalized Catalan numbers C(3; n).
- n-th step is to add a(n) to each previous number a(k) (including itself, i.e., k <= n) to produce n+1 more terms of the sequence, starting with a(0)=1.A064064
n-th step is to add a(n) to each previous number a(k) (including itself, i.e., k <= n) to produce n+1 more terms of the sequence, starting with a(0)=1.
- n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=0, a(1)=1.A064065
n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=0, a(1)=1.
- n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=1.A064066
n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=1.
- n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=2.A064067
n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=2.
- Generalized Euler number c(7,n).A064068
Generalized Euler number c(7,n).
- Generalized Euler number c(8,n).A064069
Generalized Euler number c(8,n).
- Generalized Euler number c(9,n).A064070
Generalized Euler number c(9,n).
- Generalized Euler number c(10,n).A064071
Generalized Euler number c(10,n).
- Generalized tangent number d(7,n).A064072
Generalized tangent number d(7,n).
- Generalized tangent number d(8,n).A064073
Generalized tangent number d(8,n).
- Generalized tangent number d(9,n).A064074
Generalized tangent number d(9,n).
- Generalized tangent number d(10,n).A064075
Generalized tangent number d(10,n).
- Lesser of odd twin prime powers (greater = A064077).A064076
Lesser of odd twin prime powers (greater = A064077).
- Greater of odd twin prime powers (lesser = A064076).A064077
Greater of odd twin prime powers (lesser = A064076).
- Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2^n - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n.A064078
Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2^n - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n.
- Zsigmondy numbers for a = 3, b = 1: Zs(n, 3, 1) is the greatest divisor of 3^n - 1^n (A024023) that is relatively prime to 3^m - 1^m for all positive integers m < n.A064079
Zsigmondy numbers for a = 3, b = 1: Zs(n, 3, 1) is the greatest divisor of 3^n - 1^n (A024023) that is relatively prime to 3^m - 1^m for all positive integers m < n.
- Zsigmondy numbers for a = 4, b = 1: Zs(n, 4, 1) is the greatest divisor of 4^n - 1^n (A024036) that is relatively prime to 4^m - 1^m for all positive integers m < n.A064080
Zsigmondy numbers for a = 4, b = 1: Zs(n, 4, 1) is the greatest divisor of 4^n - 1^n (A024036) that is relatively prime to 4^m - 1^m for all positive integers m < n.
- Zsigmondy numbers for a = 5, b = 1: Zs(n, 5, 1) is the greatest divisor of 5^n - 1^n (A024049) that is relatively prime to 5^m - 1^m for all positive integers m < n.A064081
Zsigmondy numbers for a = 5, b = 1: Zs(n, 5, 1) is the greatest divisor of 5^n - 1^n (A024049) that is relatively prime to 5^m - 1^m for all positive integers m < n.
- Zsigmondy numbers for a = 6, b = 1: Zs(n, 6, 1) is the greatest divisor of 6^n - 1^n (A024062) that is relatively prime to 6^m - 1^m for all positive integers m < n.A064082
Zsigmondy numbers for a = 6, b = 1: Zs(n, 6, 1) is the greatest divisor of 6^n - 1^n (A024062) that is relatively prime to 6^m - 1^m for all positive integers m < n.
- Zsigmondy numbers for a = 7, b = 1: Zs(n, 7, 1) is the greatest divisor of 7^n - 1^n (A024075) that is relatively prime to 7^m - 1^m for all positive integers m < n.A064083
Zsigmondy numbers for a = 7, b = 1: Zs(n, 7, 1) is the greatest divisor of 7^n - 1^n (A024075) that is relatively prime to 7^m - 1^m for all positive integers m < n.
- A multiplicative version of 2^n - 1 (A000225).A064084
A multiplicative version of 2^n - 1 (A000225).
- Quotient of A000225 and A064084.A064085
Quotient of A000225 and A064084.
- Condensed version of A064085: all terms of A064085 with values greater than 1 (which coincides with all terms of A064085 with nonprime power index).A064086
Condensed version of A064085: all terms of A064085 with values greater than 1 (which coincides with all terms of A064085 with nonprime power index).
- Generalized Catalan numbers C(4; n).A064087
Generalized Catalan numbers C(4; n).
- Generalized Catalan numbers C(5; n).A064088
Generalized Catalan numbers C(5; n).
- Generalized Catalan numbers C(6; n).A064089
Generalized Catalan numbers C(6; n).
- Generalized Catalan numbers C(7; n).A064090
Generalized Catalan numbers C(7; n).
- Generalized Catalan numbers C(8; n).A064091
Generalized Catalan numbers C(8; n).
- Generalized Catalan numbers C(9; n).A064092
Generalized Catalan numbers C(9; n).
- Generalized Catalan numbers C(10; n).A064093
Generalized Catalan numbers C(10; n).
- Triangle composed of generalized Catalan numbers.A064094
Triangle composed of generalized Catalan numbers.
- Row sums of triangle A064094.A064095
Row sums of triangle A064094.
- Fifth diagonal of triangle A064094.A064096
Fifth diagonal of triangle A064094.
- A quasi-logarithm defined inductively by a(1) = 0 and a(p) = 1 + a(p-1) if p is prime and a(n*m) = a(n) + a(m) if m,n > 1.A064097
A quasi-logarithm defined inductively by a(1) = 0 and a(p) = 1 + a(p-1) if p is prime and a(n*m) = a(n) + a(m) if m,n > 1.
- a(n+1) = (a(n)^2 + a(n-1)^2)/a(n-2), with a(1) = a(2) = a(3) = 1.A064098
a(n+1) = (a(n)^2 + a(n-1)^2)/a(n-2), with a(1) = a(2) = a(3) = 1.
- a(n) = ceiling(log(3 + 2*n)/log(3)).A064099
a(n) = ceiling(log(3 + 2*n)/log(3)).
- a(n) = n * (100^n - 1)/99.A064100
a(n) = n * (100^n - 1)/99.
- Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).A064101
Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).
- Primes p = prime(k) such that prime(k) + prime(k+7) = prime(k+1) + prime(k+6) = prime(k+2) + prime(k+5) = prime(k+3) + prime(k+4).A064102
Primes p = prime(k) such that prime(k) + prime(k+7) = prime(k+1) + prime(k+6) = prime(k+2) + prime(k+5) = prime(k+3) + prime(k+4).
- Primes p = p(k) such that p(k) + p(k+9) = p(k+1) + p(k+8) = p(k+2) + p(k+7) = p(k+3) + p(k+6) = p(k+4) + p(k+5).A064103
Primes p = p(k) such that p(k) + p(k+9) = p(k+1) + p(k+8) = p(k+2) + p(k+7) = p(k+3) + p(k+6) = p(k+4) + p(k+5).
- Primes p = p(k) such that p(k) + p(k+11) = p(k+1) + p(k+10) = p(k+2) + p(k+9) = p(k+3) + p(k+8) = p(k+4) + p(k+7) = p(k+5) + p(k+6).A064104
Primes p = p(k) such that p(k) + p(k+11) = p(k+1) + p(k+10) = p(k+2) + p(k+9) = p(k+3) + p(k+8) = p(k+4) + p(k+7) = p(k+5) + p(k+6).
- 2nd column of 3rd-order Zeckendorf array A136189.A064105
2nd column of 3rd-order Zeckendorf array A136189.
- 3rd column of 3rd-order Zeckendorf array A136189.A064106
3rd column of 3rd-order Zeckendorf array A136189.
- Continued fraction quotients for e^e = 15.15426224... (A073226).A064107
Continued fraction quotients for e^e = 15.15426224... (A073226).
- a(n) = (20^n - 1)/19.A064108
a(n) = (20^n - 1)/19.
- (Product_{k=1..n} prime(k)) - prime(4n).A064109
(Product_{k=1..n} prime(k)) - prime(4n).
- Let s(n) = n-th single prime (cf. A007510). Sequence is defined by recurrence a(n+1) = s(a(n)), n = 0,1,2,..., a(0)=1.A064110
Let s(n) = n-th single prime (cf. A007510). Sequence is defined by recurrence a(n+1) = s(a(n)), n = 0,1,2,..., a(0)=1.