Sequences
392,541 sequences
- Solution to the Dancing School Problem with 6 girls and n+6 boys: f(6,n).A079911
Solution to the Dancing School Problem with 6 girls and n+6 boys: f(6,n).
- Solution to the Dancing School Problem with 7 girls and n+7 boys: f(7,n).A079912
Solution to the Dancing School Problem with 7 girls and n+7 boys: f(7,n).
- Solution to the Dancing School Problem with 8 girls and n+8 boys: f(8,n).A079913
Solution to the Dancing School Problem with 8 girls and n+8 boys: f(8,n).
- Solution to the Dancing School Problem with 9 girls and n+9 boys: f(9,n).A079914
Solution to the Dancing School Problem with 9 girls and n+9 boys: f(9,n).
- Solution to the Dancing School Problem with 10 girls and n+10 boys: f(10,n).A079915
Solution to the Dancing School Problem with 10 girls and n+10 boys: f(10,n).
- Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n).A079916
Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n).
- Solution to the Dancing School Problem with 12 girls and n+12 boys: f(12,n).A079917
Solution to the Dancing School Problem with 12 girls and n+12 boys: f(12,n).
- Solution to the Dancing School Problem with 13 girls and n+13 boys: f(13,n).A079918
Solution to the Dancing School Problem with 13 girls and n+13 boys: f(13,n).
- Solution to the Dancing School Problem with 14 girls and n+14 boys: f(14,n).A079919
Solution to the Dancing School Problem with 14 girls and n+14 boys: f(14,n).
- Solution to the Dancing School Problem with 15 girls and n+15 boys: f(15,n).A079920
Solution to the Dancing School Problem with 15 girls and n+15 boys: f(15,n).
- Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).A079921
Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).
- Solution to the Dancing School Problem with n girls and n+3 boys: f(n,3).A079922
Solution to the Dancing School Problem with n girls and n+3 boys: f(n,3).
- Solution to the Dancing School Problem with n girls and n+4 boys: f(n,4).A079923
Solution to the Dancing School Problem with n girls and n+4 boys: f(n,4).
- Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).A079924
Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).
- Solution to the Dancing School Problem with n girls and n+6 boys: f(n,6).A079925
Solution to the Dancing School Problem with n girls and n+6 boys: f(n,6).
- Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7).A079926
Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7).
- Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).A079927
Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).
- Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9).A079928
Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9).
- a(n)=(3*n+1)!/(n!*3^n).A079929
a(n)=(3*n+1)!/(n!*3^n).
- Greedy powers of (1/sqrt(e)): Sum_{n>=1} (1/sqrt(e))^a(n) = 1.A079930
Greedy powers of (1/sqrt(e)): Sum_{n>=1} (1/sqrt(e))^a(n) = 1.
- Greedy powers of (1/sqrt(Pi)): Sum_{n>=1} (1/sqrt(Pi))^a(n) = 1.A079931
Greedy powers of (1/sqrt(Pi)): Sum_{n>=1} (1/sqrt(Pi))^a(n) = 1.
- Greedy powers of (1/sqrt(2)): sum_{n=1..inf} (1/sqrt(2))^a(n) = 1.A079932
Greedy powers of (1/sqrt(2)): sum_{n=1..inf} (1/sqrt(2))^a(n) = 1.
- Greedy powers of (1/sqrt(3)): sum_{n=1..inf} (1/sqrt(3))^a(n) = 1.A079933
Greedy powers of (1/sqrt(3)): sum_{n=1..inf} (1/sqrt(3))^a(n) = 1.
- Greedy frac multiples of sqrt(2): a(1)=1, Sum_{n>=0} frac(a(n)*x)=1 at x=sqrt(2).A079934
Greedy frac multiples of sqrt(2): a(1)=1, Sum_{n>=0} frac(a(n)*x)=1 at x=sqrt(2).
- a(n) = 4*a(n-1) - a(n-2) with a(1) = 1, a(2) = 3.A079935
a(n) = 4*a(n-1) - a(n-2) with a(1) = 1, a(2) = 3.
- Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).A079936
Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).
- Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.A079937
Greedy frac multiples of Pi^2/6: a(1)=1, Sum_{n>=1} frac(a(n)*x) = 1 at x = Pi^2/6.
- Greedy frac multiples of Pi: a(1)=1, Sum_{n>=1} frac(a(n)*Pi) = 1.A079938
Greedy frac multiples of Pi: a(1)=1, Sum_{n>=1} frac(a(n)*Pi) = 1.
- Greedy frac multiples of e: a(1)=1, Sum_{n>0} frac(a(n)*e)=1.A079939
Greedy frac multiples of e: a(1)=1, Sum_{n>0} frac(a(n)*e)=1.
- Greedy fractional multiples of 1/e: a(1)=1, Sum_{n>0} frac(a(n)/e) = 1.A079940
Greedy fractional multiples of 1/e: a(1)=1, Sum_{n>0} frac(a(n)/e) = 1.
- Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.A079941
Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.
- Numerators of the convergents of the continued fraction for log(2).A079942
Numerators of the convergents of the continued fraction for log(2).
- Denominators of the convergents of the continued fraction for log(2).A079943
Denominators of the convergents of the continued fraction for log(2).
- A run of 2^n 0's followed by a run of 2^n 1's, for n=0, 1, 2, ...A079944
A run of 2^n 0's followed by a run of 2^n 1's, for n=0, 1, 2, ...
- Partial sums of A079882.A079945
Partial sums of A079882.
- Numbers k whose binary expansion begins with two or more 1's and ends with at least one 0.A079946
Numbers k whose binary expansion begins with two or more 1's and ends with at least one 0.
- Partial sums of A030300.A079947
Partial sums of A030300.
- First differences of A079000.A079948
First differences of A079000.
- Special values of Hermite polynomials.A079949
Special values of Hermite polynomials.
- Triangle of n-th prime modulo twice primes less n-th prime.A079950
Triangle of n-th prime modulo twice primes less n-th prime.
- Number of primes p with prime(n) == 1 (modulo 2*p).A079951
Number of primes p with prime(n) == 1 (modulo 2*p).
- Number of primes less than prime(n)/2.A079952
Number of primes less than prime(n)/2.
- Smallest prime p such that prime(n) mod 2*p = prime(n).A079953
Smallest prime p such that prime(n) mod 2*p = prime(n).
- Partial sums of A030301.A079954
Partial sums of A030301.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.A079955
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,4}.A079956
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,4}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,3}.A079957
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,3}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={3,4}.A079958
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={3,4}.
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={2,4}.A079959
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={2,4}.
- Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={2,3}.A079960
Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={2,3}.