Sequences
392,541 sequences
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1}.A080011
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={0}.A080012
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={0}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={0,1}.A080013
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={0,1}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={1}.A080014
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={1}.
- Expansion of theta_3(q) / theta_3(q^2) in powers of q.A080015
Expansion of theta_3(q) / theta_3(q^2) in powers of q.
- Numerators of the convergents to the continued fraction of Pi^2/6.A080016
Numerators of the convergents to the continued fraction of Pi^2/6.
- Denominators of the convergents to the continued fraction of Pi^2/6.A080017
Denominators of the convergents to the continued fraction of Pi^2/6.
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.A080018
Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.
- Positive integers such that the smallest positive real solution to x^n + x = 2*Pi*a(n) forms a monotonically increasing sequence as n grows.A080019
Positive integers such that the smallest positive real solution to x^n + x = 2*Pi*a(n) forms a monotonically increasing sequence as n grows.
- Primes of the form 9k^2 + 3k + 367, where k can be negative.A080020
Primes of the form 9k^2 + 3k + 367, where k can be negative.
- log(n) is closer to an integer than is log(m) for any m with 2<=m<n.A080021
log(n) is closer to an integer than is log(m) for any m with 2<=m<n.
- Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.A080022
Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.
- log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio.A080023
log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio.
- Number of divisors d of n such that in binary representation d and n/d have the same number of 1's as n.A080024
Number of divisors d of n such that in binary representation d and n/d have the same number of 1's as n.
- Numbers n having at least one divisor d such that in binary representation d and n/d have the same number of 1's as n.A080025
Numbers n having at least one divisor d such that in binary representation d and n/d have the same number of 1's as n.
- Numbers k having exactly one divisor d such that in binary representation d and k/d have the same number of 1's as k.A080026
Numbers k having exactly one divisor d such that in binary representation d and k/d have the same number of 1's as k.
- Let s(1) = 1; let s(2m) = {s(2m-1),m+1,s(2m-1)}, s(2m+1) = {s(2m),s(2m)}; sequence gives limit of s(k) for large k.A080027
Let s(1) = 1; let s(2m) = {s(2m-1),m+1,s(2m-1)}, s(2m+1) = {s(2m),s(2m)}; sequence gives limit of s(k) for large k.
- Let s(1) = 1; let s(2m+1) = {s(2m),m+1,s(2m)}, s(2m) = {s(2m-1),s(2m-1)}; sequence gives limit of s(k) for large k.A080028
Let s(1) = 1; let s(2m+1) = {s(2m),m+1,s(2m)}, s(2m) = {s(2m-1),s(2m-1)}; sequence gives limit of s(k) for large k.
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".A080029
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 1 mod 3".A080030
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 1 mod 3".
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 2 mod 3".A080031
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 2 mod 3".
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is even".A080032
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is even".
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 4".A080033
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 4".
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 3 mod 4".A080034
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 3 mod 4".
- "Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.A080035
"Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.
- a(n) = n + round(sqrt(2*n)) + 1.A080036
a(n) = n + round(sqrt(2*n)) + 1.
- a(0)=2; for n > 0, a(n) = n + floor(sqrt(4n-3)) + 2.A080037
a(0)=2; for n > 0, a(n) = n + floor(sqrt(4n-3)) + 2.
- Start with a(1)=3; apply 3 -> 343, 4 -> 3443; iterate.A080038
Start with a(1)=3; apply 3 -> 343, 4 -> 3443; iterate.
- a(n) = floor((1+sqrt(2))^n).A080039
a(n) = floor((1+sqrt(2))^n).
- a(n) = 2*a(n-1) + 2*a(n-2) for n > 1; a(0)=2, a(1)=2.A080040
a(n) = 2*a(n-1) + 2*a(n-2) for n > 1; a(0)=2, a(1)=2.
- a(n) = floor((1+sqrt(3))^n).A080041
a(n) = floor((1+sqrt(3))^n).
- a(n) = 4*a(n-1)+3*a(n-2) for n>1, a(0)=2, a(1)=4.A080042
a(n) = 4*a(n-1)+3*a(n-2) for n>1, a(0)=2, a(1)=4.
- a(n)=floor((2+sqrt(7))^n).A080043
a(n)=floor((2+sqrt(7))^n).
- Numerators of triangular array: T(n,1)=T(n,n)=1/n and T(n,k)=T(n-1,k-1)+T(n-1,k), 1<k<n.A080044
Numerators of triangular array: T(n,1)=T(n,n)=1/n and T(n,k)=T(n-1,k-1)+T(n-1,k), 1<k<n.
- Denominators of triangular array: T(n,1)=T(n,n)=1/n and T(n,k)=T(n-1,k-1)+t(n-1,k), 1<k<n.A080045
Denominators of triangular array: T(n,1)=T(n,n)=1/n and T(n,k)=T(n-1,k-1)+t(n-1,k), 1<k<n.
- Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k).A080046
Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k).
- Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.A080047
Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.
- Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of loop repetitions in reversal step.A080048
Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of loop repetitions in reversal step.
- Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchange operations in step L4.A080049
Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchange operations in step L4.
- Primes p such that 2^p-1 and the p-th Fibonacci number have a common factor. Prime terms of A074776.A080050
Primes p such that 2^p-1 and the p-th Fibonacci number have a common factor. Prime terms of A074776.
- Common factors of 2^p-1 and the p-th Fibonacci number, p prime.A080051
Common factors of 2^p-1 and the p-th Fibonacci number, p prime.
- Value of n such that for any value of n, Pi^n is closer to its nearest integer than any value of Pi^k for 1 <= k < n.A080052
Value of n such that for any value of n, Pi^n is closer to its nearest integer than any value of Pi^k for 1 <= k < n.
- Exp(n) is further from an integer than any previous exp(k) for 1 <= k < n.A080053
Exp(n) is further from an integer than any previous exp(k) for 1 <= k < n.
- G.f.: Product_{n >= 0} (1+x^(2n+1))/(1-x^(2n+1)).A080054
G.f.: Product_{n >= 0} (1+x^(2n+1))/(1-x^(2n+1)).
- Greedy powers of log(2): Sum_{n>=1} (log(2))^a(n) = 1.A080055
Greedy powers of log(2): Sum_{n>=1} (log(2))^a(n) = 1.
- Greedy powers of (2/Pi): Sum_{n=1..inf} (2/Pi)^a(n) = 1.A080056
Greedy powers of (2/Pi): Sum_{n=1..inf} (2/Pi)^a(n) = 1.
- Greedy powers of exp(-gamma): Sum_{n>=1} exp(-gamma)^a(n) = 1, where exp(-gamma) = exp(-.57721566490153286...) = .561459483566885169...A080057
Greedy powers of exp(-gamma): Sum_{n>=1} exp(-gamma)^a(n) = 1, where exp(-gamma) = exp(-.57721566490153286...) = .561459483566885169...
- Greedy powers of (1/zeta(2)): Sum_{n>=1} (1/zeta(2))^a(n) = 1, where 1/zeta(2) = 6/Pi^2 = .607927101854...A080058
Greedy powers of (1/zeta(2)): Sum_{n>=1} (1/zeta(2))^a(n) = 1, where 1/zeta(2) = 6/Pi^2 = .607927101854...
- Greedy powers of (1/zeta(3)): Sum_{n>=1} (1/zeta(3))^a(n) = 1, where 1/zeta(3) = .83190737258070746868...A080059
Greedy powers of (1/zeta(3)): Sum_{n>=1} (1/zeta(3))^a(n) = 1, where 1/zeta(3) = .83190737258070746868...
- Erroneous version of A004137 given in the reference.A080060
Erroneous version of A004137 given in the reference.