Sequences
392,541 sequences
- Radius of the shortest interval (of positive length) centered at prime(n) that has prime endpoints.A078611
Radius of the shortest interval (of positive length) centered at prime(n) that has prime endpoints.
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.A078612
Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.
- Same numbers of distinct prime factors of forms 4*k+1 and 4*k+3.A078613
Same numbers of distinct prime factors of forms 4*k+1 and 4*k+3.
- First differences of A072633.A078614
First differences of A072633.
- a(n) = rad(n)^2, where rad is the squarefree kernel of n (A007947).A078615
a(n) = rad(n)^2, where rad is the squarefree kernel of n (A007947).
- a(n) = Sum_{k=0..n} A010815(k).A078616
a(n) = Sum_{k=0..n} A010815(k).
- Floor(average of first n squares).A078617
Floor(average of first n squares).
- a(n) = floor(average of first n cubes).A078618
a(n) = floor(average of first n cubes).
- Floor(average of first n factorials).A078619
Floor(average of first n factorials).
- Floor(average of first n Fibonacci numbers).A078620
Floor(average of first n Fibonacci numbers).
- Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.A078621
Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.
- Primes of the form prime(n)*prime(n*2)+2.A078622
Primes of the form prime(n)*prime(n*2)+2.
- Number of matched parentheses and brackets of length n, where a closing bracket will close any remaining open parentheses back to the matching open bracket (as in some versions of LISP).A078623
Number of matched parentheses and brackets of length n, where a closing bracket will close any remaining open parentheses back to the matching open bracket (as in some versions of LISP).
- Primes of the form 7*x^3 + 5*x^2 + 3*x + 2.A078624
Primes of the form 7*x^3 + 5*x^2 + 3*x + 2.
- Primes of the form 2*x^3 + 3*x^2 + 5*x + 7.A078625
Primes of the form 2*x^3 + 3*x^2 + 5*x + 7.
- Primes p which concatenated with p+2 give a prime.A078626
Primes p which concatenated with p+2 give a prime.
- Write n in binary; repeatedly sum the "digits" until reaching 1; a(n) = 1 + number of steps required.A078627
Write n in binary; repeatedly sum the "digits" until reaching 1; a(n) = 1 + number of steps required.
- Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).A078628
Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).
- Number of ways to lace a shoe that has n pairs of eyelets, assuming the lacing satisfies certain conditions.A078629
Number of ways to lace a shoe that has n pairs of eyelets, assuming the lacing satisfies certain conditions.
- Numerators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n.A078630
Numerators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n.
- Denominators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n.A078631
Denominators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n.
- Number of geometric subsequences of [1,...,n] with integral successive-term ratio and length > 1.A078632
Number of geometric subsequences of [1,...,n] with integral successive-term ratio and length > 1.
- Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.A078633
Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.
- E.g.f. exp( 1 - x - sqrt( 1 - 4*x + x^2 )).A078634
E.g.f. exp( 1 - x - sqrt( 1 - 4*x + x^2 )).
- Number of partitions of n into perfect powers.A078635
Number of partitions of n into perfect powers.
- a(n) = rad(n*(n+1)).A078636
a(n) = rad(n*(n+1)).
- a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).A078637
a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).
- a(n) = rad(n*(n+1)*(n+2)*(n+3)).A078638
a(n) = rad(n*(n+1)*(n+2)*(n+3)).
- Number of nonisomorphic graphic matroids (by rank or number of vertices).A078639
Number of nonisomorphic graphic matroids (by rank or number of vertices).
- Number of numbers between 1 and n-1 inclusive that are coprime to n*(n+1)*(n+2).A078640
Number of numbers between 1 and n-1 inclusive that are coprime to n*(n+1)*(n+2).
- Number of numbers between 1 and n-1 inclusive that are coprime to n*(n+1)*(n+2)*(n+3).A078641
Number of numbers between 1 and n-1 inclusive that are coprime to n*(n+1)*(n+2)*(n+3).
- Numbers with two representations as the sum of two Fibonacci numbers.A078642
Numbers with two representations as the sum of two Fibonacci numbers.
- Numbers with exactly one representation as the sum of two Fibonacci numbers.A078643
Numbers with exactly one representation as the sum of two Fibonacci numbers.
- a(n) = tau(2*n^2)/2.A078644
a(n) = tau(2*n^2)/2.
- Duplicate of A067139.A078645
Duplicate of A067139.
- Number of representations of n as a sum of two primes that are congruent modulo 3.A078646
Number of representations of n as a sum of two primes that are congruent modulo 3.
- Smallest integer that can be written in exactly n ways as the sum of two primes that are congruent modulo 3.A078647
Smallest integer that can be written in exactly n ways as the sum of two primes that are congruent modulo 3.
- Smallest integer that can be written in exactly n ways as the sum of two primes that are not congruent modulo 3.A078648
Smallest integer that can be written in exactly n ways as the sum of two primes that are not congruent modulo 3.
- Numbers n such that A000002(n)=A000002(n+1) where A000002 is the Kolakoski sequence.A078649
Numbers n such that A000002(n)=A000002(n+1) where A000002 is the Kolakoski sequence.
- 2-A000002(n) where A000002 is the Kolakoski sequence.A078650
2-A000002(n) where A000002 is the Kolakoski sequence.
- Number of increasing geometric-progression subsequences of [1,...,n] with integral successive-term ratio and length >= 1.A078651
Number of increasing geometric-progression subsequences of [1,...,n] with integral successive-term ratio and length >= 1.
- a(1)=1, a(2n)=nextprime(a(n-1)), a(2n+1)= sum of digits of all previous terms + 1.A078652
a(1)=1, a(2n)=nextprime(a(n-1)), a(2n+1)= sum of digits of all previous terms + 1.
- a(n) = prime(k) where k = n-th prime congruent to 1 mod 4.A078653
a(n) = prime(k) where k = n-th prime congruent to 1 mod 4.
- a(n) = prime(k) where k = n-th prime congruent to 3 mod 4.A078654
a(n) = prime(k) where k = n-th prime congruent to 3 mod 4.
- a(n) = prime(k) where k = n-th prime congruent to 1 mod 6.A078655
a(n) = prime(k) where k = n-th prime congruent to 1 mod 6.
- a(n) = prime(k) where k = n-th prime congruent to 1 mod 10.A078656
a(n) = prime(k) where k = n-th prime congruent to 1 mod 10.
- Expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1 - x^n).A078657
Expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1 - x^n).
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).A078658
a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).
- Expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).A078659
Expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).
- Expansion of Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).A078660
Expansion of Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).