Sequences
392,541 sequences
- Number of points (i,j,k) on the surface of a sphere around (0,0,0) with squared radius A071609(n).A071611
Number of points (i,j,k) on the surface of a sphere around (0,0,0) with squared radius A071609(n).
- a(n) is the smallest prime that is the first of n consecutive primes which are all emirps.A071612
a(n) is the smallest prime that is the first of n consecutive primes which are all emirps.
- a(n) is the smallest prime that is the first of n consecutive primes with equal digit sum.A071613
a(n) is the smallest prime that is the first of n consecutive primes with equal digit sum.
- a(n) is the smallest emirp that is the first of n consecutive emirps with equal digit sum.A071614
a(n) is the smallest emirp that is the first of n consecutive emirps with equal digit sum.
- a(n) is the least m such that 2*n*m is a nontotient value; that is, 2*n*a(n) is in A005277.A071615
a(n) is the least m such that 2*n*m is a nontotient value; that is, 2*n*a(n) is in A005277.
- Smallest even number divisible by 2n which is nontotient, i.e., in A005277.A071616
Smallest even number divisible by 2n which is nontotient, i.e., in A005277.
- a(n) = phi(p)^phi(p) where p = prime(n).A071617
a(n) = phi(p)^phi(p) where p = prime(n).
- a(n+1) - 3*a(n) + a(n-1) = (2/3)(1+w^(n+1)+w^(2n+2)), where w = exp(2 Pi I / 3).A071618
a(n+1) - 3*a(n) + a(n-1) = (2/3)(1+w^(n+1)+w^(2n+2)), where w = exp(2 Pi I / 3).
- a(n) = ceiling(2*n^2 / 3).A071619
a(n) = ceiling(2*n^2 / 3).
- Integer lengths of the Champernowne primes (concatenation of first a(n) entries (digits) of A033307 is prime).A071620
Integer lengths of the Champernowne primes (concatenation of first a(n) entries (digits) of A033307 is prime).
- Primes that can be written as "a * b + c * d", where a, b, c and d are also primes.A071621
Primes that can be written as "a * b + c * d", where a, b, c and d are also primes.
- a(n) = (-1)*Sum_{k=1..n} (-1)^floor((4/3)^k).A071622
a(n) = (-1)*Sum_{k=1..n} (-1)^floor((4/3)^k).
- Least k such that n = A071532(k).A071623
Least k such that n = A071532(k).
- Numbers k such that phi(m) = 96*k+2 has no solution.A071624
Numbers k such that phi(m) = 96*k+2 has no solution.
- Number of distinct exponents when n is factorized as a product of primes.A071625
Number of distinct exponents when n is factorized as a product of primes.
- Number of distinct exponents in the prime factorization of n!.A071626
Number of distinct exponents in the prime factorization of n!.
- The n-th term of Chernoff sequence A006939 divided by (n + 1)!.A071627
The n-th term of Chernoff sequence A006939 divided by (n + 1)!.
- Smallest m such that (2n-1)*2^m is totient, that is, in A002202, or -1 if (2n-1)*2^m is never a totient.A071628
Smallest m such that (2n-1)*2^m is totient, that is, in A002202, or -1 if (2n-1)*2^m is never a totient.
- Number of terms in the set InvPhi(4*prime(n)), where prime(n) is the n-th prime.A071629
Number of terms in the set InvPhi(4*prime(n)), where prime(n) is the n-th prime.
- Number of terms in the set InvPhi(8*prime(n)), where prime(n) is the n-th prime.A071630
Number of terms in the set InvPhi(8*prime(n)), where prime(n) is the n-th prime.
- Number of terms in the set InvPhi(16*prime(n)), where prime(n) is the n-th prime.A071631
Number of terms in the set InvPhi(16*prime(n)), where prime(n) is the n-th prime.
- Number of terms in the set InvPhi(1024*prime(n)), where prime(n) is the n-th prime.A071632
Number of terms in the set InvPhi(1024*prime(n)), where prime(n) is the n-th prime.
- Number of terms in the set InvPhi(65536*prime(n)), where prime(n) is the n-th prime.A071633
Number of terms in the set InvPhi(65536*prime(n)), where prime(n) is the n-th prime.
- Number of terms in the set InvPhi(1048576*prime(n)), where prime(n) is the n-th prime.A071634
Number of terms in the set InvPhi(1048576*prime(n)), where prime(n) is the n-th prime.
- Number of decompositions of 4*n+2 into sum of two primes of form 4*k+1.A071635
Number of decompositions of 4*n+2 into sum of two primes of form 4*k+1.
- Numbers n=4*k+2 such that there is no pair of primes p and q of form 4*i+1 with p+q=n; A071635(n)=0.A071636
Numbers n=4*k+2 such that there is no pair of primes p and q of form 4*i+1 with p+q=n; A071635(n)=0.
- Largest exponent k >=0 such that (n+1)^k divides n!.A071637
Largest exponent k >=0 such that (n+1)^k divides n!.
- Numbers n such that phi(n) = b(n,1)^b(n,0) where b(n,1) is the number of 1's in binary representation of n and b(n,0) the number of 0's.A071638
Numbers n such that phi(n) = b(n,1)^b(n,0) where b(n,1) is the number of 1's in binary representation of n and b(n,0) the number of 0's.
- Numbers k such that core(k) = b(k,1)*b(k,0) where b(k,1) is the number of 1's in binary representation of k, b(k,0) the number of 0's and core(k) the squarefree part of k.A071639
Numbers k such that core(k) = b(k,1)*b(k,0) where b(k,1) is the number of 1's in binary representation of k, b(k,0) the number of 0's and core(k) the squarefree part of k.
- a(n) = Sum_{i=1..n} A040051(i).A071640
a(n) = Sum_{i=1..n} A040051(i).
- a(n) defined by recursion in the formula section.A071641
a(n) defined by recursion in the formula section.
- Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(2).A071642
Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(2).
- Optimal Hamming complexity of normal basis for GF(2^n) over GF(2).A071643
Optimal Hamming complexity of normal basis for GF(2^n) over GF(2).
- a(n) = A005148(2^n-1)/8^(n-1).A071644
a(n) = A005148(2^n-1)/8^(n-1).
- a(n) = A051193(A072109(n))/A018804(A072109(n)).A071645
a(n) = A051193(A072109(n))/A018804(A072109(n)).
- Number of base 4 n-digit numbers with digit sum n.A071646
Number of base 4 n-digit numbers with digit sum n.
- a(n) is the maximum number of elements among the continued fractions for n/1, n/2, n/3, n/4, ..., n/n.A071647
a(n) is the maximum number of elements among the continued fractions for n/1, n/2, n/3, n/4, ..., n/n.
- Sum of even decimal digits of n.A071648
Sum of even decimal digits of n.
- Sum of odd decimal digits of n.A071649
Sum of odd decimal digits of n.
- Difference between sums of odd and even digits of n.A071650
Difference between sums of odd and even digits of n.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using the bivariate form of A061579 as the packing bijection N x N -> N.A071651
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using the bivariate form of A061579 as the packing bijection N x N -> N.
- Inverse permutation to A071651.A071652
Inverse permutation to A071651.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using the bivariate form of A001477 as the packing bijection N x N -> N.A071653
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using the bivariate form of A001477 as the packing bijection N x N -> N.
- Inverse permutation to A071653.A071654
Inverse permutation to A071653.
- Permutation of natural numbers induced by the automorphism robr_car_cdr! acting on the parenthesizations encoded by A014486.A071655
Permutation of natural numbers induced by the automorphism robr_car_cdr! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_cdr_robl! acting on the parenthesizations encoded by A014486.A071656
Permutation of natural numbers induced by the automorphism car_cdr_robl! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_robr_cdr! acting on the parenthesizations encoded by A014486.A071657
Permutation of natural numbers induced by the automorphism car_robr_cdr! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism cdr_robl_car! acting on the parenthesizations encoded by A014486.A071658
Permutation of natural numbers induced by the automorphism cdr_robl_car! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism car_cdr_robr! acting on the parenthesizations encoded by A014486.A071659
Permutation of natural numbers induced by the automorphism car_cdr_robr! acting on the parenthesizations encoded by A014486.
- Permutation of natural numbers induced by the automorphism robl_car_cdr! acting on the parenthesizations encoded by A014486.A071660
Permutation of natural numbers induced by the automorphism robl_car_cdr! acting on the parenthesizations encoded by A014486.