Sequences
392,541 sequences
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,2,4).A078961
Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,2,4).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,2,6).A078962
Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,2,6).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,6,2).A078963
Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,6,2).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,6,6).A078964
Primes p such that the differences between the 5 consecutive primes starting with p are (6,4,6,6).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,2,6).A078965
Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,2,6).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2).A078966
Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,6).A078967
Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,6).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,2).A078968
Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,2).
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,4).A078969
Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,4).
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.A078970
Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.
- Numbers n such that C(4n,n)/(3n+1) (A002293) is not divisible by 4.A078971
Numbers n such that C(4n,n)/(3n+1) (A002293) is not divisible by 4.
- Brilliant numbers: semiprimes (products of two primes, A001358) whose prime factors have the same number of decimal digits.A078972
Brilliant numbers: semiprimes (products of two primes, A001358) whose prime factors have the same number of decimal digits.
- Total dimension of the homology of a free 2-step nilpotent Lie algebra of rank n.A078973
Total dimension of the homology of a free 2-step nilpotent Lie algebra of rank n.
- Decimal expansion of constant C such that Sum_{k>=1} 1/C^p(k) = 1 where p(k) is the k-th prime.A078974
Decimal expansion of constant C such that Sum_{k>=1} 1/C^p(k) = 1 where p(k) is the k-th prime.
- Decimal expansion of constant C>0 such that sum(k>=1,1/C^(k^2)) = 1.A078975
Decimal expansion of constant C>0 such that sum(k>=1,1/C^(k^2)) = 1.
- Numerator of n-th convergent to e^(2/3).A078976
Numerator of n-th convergent to e^(2/3).
- Denominator of n-th convergent to e^(2/3).A078977
Denominator of n-th convergent to e^(2/3).
- Sequence is S(oo), where S(1)={1,2,3,4}, S(n+1)=S(n)S'(n) and S'(n) is obtained from S(n) by changing its last term using the cyclic permutation 1->2->3->4->1.A078978
Sequence is S(oo), where S(1)={1,2,3,4}, S(n+1)=S(n)S'(n) and S'(n) is obtained from S(n) by changing its last term using the cyclic permutation 1->2->3->4->1.
- a(n) = A078711(n) - 1.A078979
a(n) = A078711(n) - 1.
- Numerators of continued fraction convergents to sinh(1).A078980
Numerators of continued fraction convergents to sinh(1).
- Denominators of continued fraction convergents to sinh(1).A078981
Denominators of continued fraction convergents to sinh(1).
- Denominators of continued fraction convergents to cosh(1).A078982
Denominators of continued fraction convergents to cosh(1).
- Numerators of continued fraction convergents to cosh(1).A078983
Numerators of continued fraction convergents to cosh(1).
- Numerators of continued fraction convergents to zeta(3).A078984
Numerators of continued fraction convergents to zeta(3).
- Denominators of continued fraction convergents to zeta(3).A078985
Denominators of continued fraction convergents to zeta(3).
- Chebyshev T(n,19) polynomial.A078986
Chebyshev T(n,19) polynomial.
- Chebyshev U(n,x) polynomial evaluated at x=19.A078987
Chebyshev U(n,x) polynomial evaluated at x=19.
- Chebyshev sequence with Diophantine property.A078988
Chebyshev sequence with Diophantine property.
- Chebyshev sequence with Diophantine property.A078989
Chebyshev sequence with Diophantine property.
- Triangle arising from (4,2) tennis ball problem, read by rows.A078990
Triangle arising from (4,2) tennis ball problem, read by rows.
- Coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.A078991
Coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.
- Nonzero coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.A078992
Nonzero coefficients of the polynomials in the numerator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.
- Starting at the chess position shown, a(n) is the number of ways Black can make n consecutive moves, followed by a checkmate in one move by White.A078993
Starting at the chess position shown, a(n) is the number of ways Black can make n consecutive moves, followed by a checkmate in one move by White.
- Determinant of n X n matrix M(n) where m(i,i)=i if i>j, m(i,j)=i-j if j>i, m(i,j)=j-i.A078994
Determinant of n X n matrix M(n) where m(i,i)=i if i>j, m(i,j)=i-j if j>i, m(i,j)=j-i.
- a(n) = Sum_{k=0..n} C(4*k,k)*C(4*(n-k),n-k).A078995
a(n) = Sum_{k=0..n} C(4*k,k)*C(4*(n-k),n-k).
- Triangle read by rows: let f(x) = x/(1-x-x^2); n-th row gives coefficients of denominator polynomial of n-th derivative f(x)^(n), with highest powers first, for n >= 0.A078996
Triangle read by rows: let f(x) = x/(1-x-x^2); n-th row gives coefficients of denominator polynomial of n-th derivative f(x)^(n), with highest powers first, for n >= 0.
- Nonzero coefficients of the polynomials in the denominator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.A078997
Nonzero coefficients of the polynomials in the denominator of the generating function x/(1-x-x^2) for the Fibonacci sequence and its successive derivatives starting with the highest power of x.
- Choose a(n) so that a(1)+a(2)+...+a(n) = concatenation of n first natural numbers.A078998
Choose a(n) so that a(1)+a(2)+...+a(n) = concatenation of n first natural numbers.
- Coefficients A_n for the s=4 tennis ball problem.A078999
Coefficients A_n for the s=4 tennis ball problem.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".A079000
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".
- Digital equivalents of letters A, B, C, ..., Z on touch-tone telephone keypad.A079001
Digital equivalents of letters A, B, C, ..., Z on touch-tone telephone keypad.
- Numbers n such that the Fibonacci residues F(k) mod n form the complete set (0,1,2,...,n-1).A079002
Numbers n such that the Fibonacci residues F(k) mod n form the complete set (0,1,2,...,n-1).
- Least k >= 3 such that Fibonacci(k) == -1 (mod 3^n).A079003
Least k >= 3 such that Fibonacci(k) == -1 (mod 3^n).
- Least x>=3 such that F(x)==1 (mod 3^n) where F(x) denotes the x-th Fibonacci number (A000045).A079004
Least x>=3 such that F(x)==1 (mod 3^n) where F(x) denotes the x-th Fibonacci number (A000045).
- Exponential transform of unsigned Lah-triangle |A008297(n,k)|.A079005
Exponential transform of unsigned Lah-triangle |A008297(n,k)|.
- Expansion of q^(-1/4) * (eta(q) * eta(q^4)^2 / eta(q^2)^3)^2 in powers of q.A079006
Expansion of q^(-1/4) * (eta(q) * eta(q^4)^2 / eta(q^2)^3)^2 in powers of q.
- a(n) = smallest prime p_k such that the n successive differences between the primes p_k through p_(k+n) are all distinct.A079007
a(n) = smallest prime p_k such that the n successive differences between the primes p_k through p_(k+n) are all distinct.
- a(n) is smallest number k such that the n successive values of phi(k+j) (j=0,..,n-1) are all distinct.A079008
a(n) is smallest number k such that the n successive values of phi(k+j) (j=0,..,n-1) are all distinct.
- Least k such that the 2^n successive values of phi(k+j) (j=0..2^n-1) are all distinct.A079009
Least k such that the 2^n successive values of phi(k+j) (j=0..2^n-1) are all distinct.
- a(n) = nextprime(16 + A022008(n)) - (16 + A022008(n)).A079010
a(n) = nextprime(16 + A022008(n)) - (16 + A022008(n)).