Sequences
392,541 sequences
- Decimal expansion of binomial(Pi, e).A093961
Decimal expansion of binomial(Pi, e).
- Continued fraction expansion of binomial(Pi,e) (A093961).A093962
Continued fraction expansion of binomial(Pi,e) (A093961).
- Antidiagonal sums of array in A093966.A093963
Antidiagonal sums of array in A093966.
- a(n) = Sum_{k=1..n} k*k!*C(n,k).A093964
a(n) = Sum_{k=1..n} k*k!*C(n,k).
- Number of functions of [n] to [n] that simultaneously avoid the patterns 112 and 221.A093965
Number of functions of [n] to [n] that simultaneously avoid the patterns 112 and 221.
- Array read by antidiagonals: number of {112,221}-avoiding words.A093966
Array read by antidiagonals: number of {112,221}-avoiding words.
- a(n) = n * Pell(n).A093967
a(n) = n * Pell(n).
- Inverse binomial transform of n*Pell(n).A093968
Inverse binomial transform of n*Pell(n).
- a(n) = n*Pell(n-2).A093969
a(n) = n*Pell(n-2).
- Number of subsets A of {1..n} such that there are no solutions to a+b+c=d for a,b,c,d in A.A093970
Number of subsets A of {1..n} such that there are no solutions to a+b+c=d for a,b,c,d in A.
- Number of sum-full subsets of {1,...,n}; subsets A such that there is a solution to x+y=z for x,y,z in A.A093971
Number of sum-full subsets of {1,...,n}; subsets A such that there is a solution to x+y=z for x,y,z in A.
- Number of prime pairs below 10^n having a difference of 36.A093972
Number of prime pairs below 10^n having a difference of 36.
- Number of prime pairs below 10^n having a difference of 38.A093973
Number of prime pairs below 10^n having a difference of 38.
- Number of prime pairs below 10^n having a difference of 40.A093974
Number of prime pairs below 10^n having a difference of 40.
- Number of prime pairs below 10^n having a difference of 42.A093975
Number of prime pairs below 10^n having a difference of 42.
- Number of prime pairs below 10^n having a difference of 44.A093976
Number of prime pairs below 10^n having a difference of 44.
- Number of prime pairs below 10^n having a difference of 46.A093977
Number of prime pairs below 10^n having a difference of 46.
- Number of prime pairs below 10^n having a difference of 48.A093978
Number of prime pairs below 10^n having a difference of 48.
- Number of prime pairs below 10^n having a difference of 50.A093979
Number of prime pairs below 10^n having a difference of 50.
- Number of prime pairs below 10^n having a difference of 52.A093980
Number of prime pairs below 10^n having a difference of 52.
- Number of prime pairs below 10^n having a difference of 54.A093981
Number of prime pairs below 10^n having a difference of 54.
- Number of prime pairs below 10^n having a difference of 56.A093982
Number of prime pairs below 10^n having a difference of 56.
- Number of prime pairs below 10^n having a difference of 58.A093983
Number of prime pairs below 10^n having a difference of 58.
- Number of prime pairs below 10^n having a difference of 60.A093984
Number of prime pairs below 10^n having a difference of 60.
- a(1) = 1, a(2) = 2; a(n+1) = 2n*a(n) - a(n-1). Symmetrically, a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).A093985
a(1) = 1, a(2) = 2; a(n+1) = 2n*a(n) - a(n-1). Symmetrically, a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).
- a(1) = 1, a(2) = 1, a(n+1) = 2n*a(n) - a(n-1). Symmetrically a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).A093986
a(1) = 1, a(2) = 1, a(n+1) = 2n*a(n) - a(n-1). Symmetrically a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).
- a(1) = 1, a(2) = 2, a(n+1) = a(n)^(2n)/ a(n-1). Symmetrically a(n) = {a(n-1)*a(n+1)}^[1/{(n-1) +(n+1)}].A093987
a(1) = 1, a(2) = 2, a(n+1) = a(n)^(2n)/ a(n-1). Symmetrically a(n) = {a(n-1)*a(n+1)}^[1/{(n-1) +(n+1)}].
- Numbers k such that 2^k + 3*k is prime.A093988
Numbers k such that 2^k + 3*k is prime.
- Number of free n-celled polyzebras (or zebra-move-connected polyominoes).A093989
Number of free n-celled polyzebras (or zebra-move-connected polyominoes).
- Number of one-sided n-celled polyzebras (or zebra-move-connected polyominoes).A093990
Number of one-sided n-celled polyzebras (or zebra-move-connected polyominoes).
- Number of n-celled polyzebras with bilateral symmetry.A093991
Number of n-celled polyzebras with bilateral symmetry.
- Number of n-celled polyzebras without bilateral symmetry.A093992
Number of n-celled polyzebras without bilateral symmetry.
- Number of divisors of n with a prime digital sum.A093993
Number of divisors of n with a prime digital sum.
- Composite numbers all of whose divisors except the divisor 1 have a prime digital sum.A093994
Composite numbers all of whose divisors except the divisor 1 have a prime digital sum.
- n^2 appears n times, triangle read by rows.A093995
n^2 appears n times, triangle read by rows.
- G.f.: Product_{k>=2} (1 - x^{F_k}) where F_k are the Fibonacci numbers.A093996
G.f.: Product_{k>=2} (1 - x^{F_k}) where F_k are the Fibonacci numbers.
- Number of partitions of n with an odd number of distinct Fibonacci parts.A093997
Number of partitions of n with an odd number of distinct Fibonacci parts.
- Number of partitions of n with an even number of distinct Fibonacci parts.A093998
Number of partitions of n with an even number of distinct Fibonacci parts.
- Primes of the form abs(floor(k*log(k)-sqrt(k*(k+2*Pi)/Pi))).A093999
Primes of the form abs(floor(k*log(k)-sqrt(k*(k+2*Pi)/Pi))).
- Number of n X n (0,1)-matrices with no zero rows or columns and with all rows distinct and all columns distinct, up to permutation of rows.A094000
Number of n X n (0,1)-matrices with no zero rows or columns and with all rows distinct and all columns distinct, up to permutation of rows.
- Decimal expansion of (Pi + e)^Pi.A094001
Decimal expansion of (Pi + e)^Pi.
- a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=1, a(1)=5.A094002
a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=1, a(1)=5.
- a(1) = 2, a(n+1) = (a(n)^(n+1) - 1)/(a(n) - 1).A094003
a(1) = 2, a(n+1) = (a(n)^(n+1) - 1)/(a(n) - 1).
- a(n) = (conjectured) length of longest string that can be generated by a starting string of 2's and 3's of length n, using the rule described in the Comments lines.A094004
a(n) = (conjectured) length of longest string that can be generated by a starting string of 2's and 3's of length n, using the rule described in the Comments lines.
- a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's, using the rule described in the Comments lines.A094005
a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's, using the rule described in the Comments lines.
- a(1) = a(2) = 1; for n > 1, a(n+1) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.A094006
a(1) = a(2) = 1; for n > 1, a(n+1) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.
- Numbers k such that the denominator of the k-th convergent of the continued fraction expansion of e is prime.A094007
Numbers k such that the denominator of the k-th convergent of the continued fraction expansion of e is prime.
- Primes which are the denominators of convergents of the continued fraction expansion of e.A094008
Primes which are the denominators of convergents of the continued fraction expansion of e.
- Least number k such that k! in binary representation contains a run of exactly n consecutive ones.A094009
Least number k such that k! in binary representation contains a run of exactly n consecutive ones.
- Least number k such that k! in binary representation contains a run of exactly n consecutive nontrivial zeros.A094010
Least number k such that k! in binary representation contains a run of exactly n consecutive nontrivial zeros.