Sequences
392,541 sequences
- Permutation A057505 applied twice ("squared").A071661
Permutation A057505 applied twice ("squared").
- Permutation A057506 applied twice ("squared").A071662
Permutation A057506 applied twice ("squared").
- Permutation A057505 applied three times ("cubed").A071663
Permutation A057505 applied three times ("cubed").
- Permutation A057506 applied three times ("cubed").A071664
Permutation A057506 applied three times ("cubed").
- Permutation A057505 applied four times ("^4"), permutation A071661 squared.A071665
Permutation A057505 applied four times ("^4"), permutation A071661 squared.
- Permutation A057506 applied four times ("^4"), permutation A071662 squared.A071666
Permutation A057506 applied four times ("^4"), permutation A071662 squared.
- Permutation A057505 applied five times ("^5").A071667
Permutation A057505 applied five times ("^5").
- Permutation A057506 applied five times ("^5").A071668
Permutation A057506 applied five times ("^5").
- Permutation A057505 applied six times, permutation A071661 cubed, permutation A071663 squared.A071669
Permutation A057505 applied six times, permutation A071661 cubed, permutation A071663 squared.
- Permutation A057506 applied six times ("^6"), permutation A071662 cubed, permutation A071664 squared.A071670
Permutation A057506 applied six times ("^6"), permutation A071662 cubed, permutation A071664 squared.
- The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.A071671
The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.
- The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.A071672
The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.
- Sequence a(n) obtained by setting a(0) = 0; then reading the table T(x,y)=a(x)+a(y)+1 in antidiagonal fashion.A071673
Sequence a(n) obtained by setting a(0) = 0; then reading the table T(x,y)=a(x)+a(y)+1 in antidiagonal fashion.
- Sequence A071673 reduced modulo 2.A071674
Sequence A071673 reduced modulo 2.
- Array read by antidiagonals of trinomial coefficients.A071675
Array read by antidiagonals of trinomial coefficients.
- Array read by antidiagonals of signed variant of trinomial coefficients with T(n,k)=T(n-1,k)+T(n-1,k-1)-T(n-1,k-2) starting with T(0,0)=1.A071676
Array read by antidiagonals of signed variant of trinomial coefficients with T(n,k)=T(n-1,k)+T(n-1,k-1)-T(n-1,k-2) starting with T(0,0)=1.
- Numbers k such that the number of divisors of k equals the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k.A071677
Numbers k such that the number of divisors of k equals the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k.
- GCD of n! and the reverse of n!.A071678
GCD of n! and the reverse of n!.
- Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k equals n.A071679
Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k equals n.
- Primes that are the arithmetic mean of their prime predecessor and another prime.A071680
Primes that are the arithmetic mean of their prime predecessor and another prime.
- Number of ways to represent the n-th prime as arithmetic mean of two other primes.A071681
Number of ways to represent the n-th prime as arithmetic mean of two other primes.
- Least m such that A060207(m) = n.A071682
Least m such that A060207(m) = n.
- Nonprimes which are the average of two consecutive Fibonacci numbers.A071683
Nonprimes which are the average of two consecutive Fibonacci numbers.
- Number of plane trees with n edges and having an odd number of leaves.A071684
Number of plane trees with n edges and having an odd number of leaves.
- Non-palindromic numbers n, not divisible by 10, such that either n divides R(n) or R(n) divides n, where R(n) is the digit-reversal of n.A071685
Non-palindromic numbers n, not divisible by 10, such that either n divides R(n) or R(n) divides n, where R(n) is the digit-reversal of n.
- Smallest solution to gcd(x, Rev(x)) = 2^n.A071686
Smallest solution to gcd(x, Rev(x)) = 2^n.
- Non-palindromic numbers such that either x=q1.Rev[x] or Rev[x]=q2.x, where R[x]=A004086[x] and q1 or q2 are integers not divisible by 10.A071687
Non-palindromic numbers such that either x=q1.Rev[x] or Rev[x]=q2.x, where R[x]=A004086[x] and q1 or q2 are integers not divisible by 10.
- Number of plane trees with even number of leaves.A071688
Number of plane trees with even number of leaves.
- Number of ways to write n as n = x*y*z*t+x+y+z+t 0<=x<=y<=z<=t<=n.A071689
Number of ways to write n as n = x*y*z*t+x+y+z+t 0<=x<=y<=z<=t<=n.
- Number of ways to write n as n = x*y*z*t/(x+y+z+t) with 1 <= x <= y <= z <= t <= n.A071690
Number of ways to write n as n = x*y*z*t/(x+y+z+t) with 1 <= x <= y <= z <= t <= n.
- Number of ways to write n as n = x!+y!+z!+t! with 0<=x<=y<=z<=t<=n.A071691
Number of ways to write n as n = x!+y!+z!+t! with 0<=x<=y<=z<=t<=n.
- Number of ways to write n as n = x! + y! + z! where 0<=x<=y<=z<=n.A071692
Number of ways to write n as n = x! + y! + z! where 0<=x<=y<=z<=n.
- Number of ways to write n as n = x*y*z + x + y + z where 0 <= x <= y <= z <= n.A071693
Number of ways to write n as n = x*y*z + x + y + z where 0 <= x <= y <= z <= n.
- Number of ways to write n as n = x*y*z/(x+y+z) 1 <= x <= y <= z <= n.A071694
Number of ways to write n as n = x*y*z/(x+y+z) 1 <= x <= y <= z <= n.
- Lesser members of twin prime pairs of form (4*k+1, 4*k+3), k > 0.A071695
Lesser members of twin prime pairs of form (4*k+1, 4*k+3), k > 0.
- Greater members of twin prime pairs of form (4*k+1,4*k+3), k>0.A071696
Greater members of twin prime pairs of form (4*k+1,4*k+3), k>0.
- Product of twin primes of form (4*k+1,4*k+3), k>0.A071697
Product of twin primes of form (4*k+1,4*k+3), k>0.
- Lesser members of twin prime pairs of form (4*k+3, 4*k+5), k >= 0.A071698
Lesser members of twin prime pairs of form (4*k+3, 4*k+5), k >= 0.
- Greater members of twin prime pairs of form (4*k+3, 4*k+5), k >= 0.A071699
Greater members of twin prime pairs of form (4*k+3, 4*k+5), k >= 0.
- Product of twin primes of form (4*k+3,4*(k+1)+1), k>=0.A071700
Product of twin primes of form (4*k+3,4*(k+1)+1), k>=0.
- Number of twin prime pairs <= n of form (4*k+1,4*k+3), k>0.A071701
Number of twin prime pairs <= n of form (4*k+1,4*k+3), k>0.
- Number of twin prime pairs <= n of form (4*k+3,4*(k+1)+1), k>=0.A071702
Number of twin prime pairs <= n of form (4*k+3,4*(k+1)+1), k>=0.
- Number of ways to represent the n-th prime as arithmetic mean of three odd primes.A071703
Number of ways to represent the n-th prime as arithmetic mean of three odd primes.
- Number of ways to represent the n-th prime as arithmetic mean of three other odd primes.A071704
Number of ways to represent the n-th prime as arithmetic mean of three other odd primes.
- Least k > n such that C(2n,n) divides C(2k,k).A071705
Least k > n such that C(2n,n) divides C(2k,k).
- Number of complete mappings f(x) of the cyclic group Z_{2n+1} such that -f(-x)=f.A071706
Number of complete mappings f(x) of the cyclic group Z_{2n+1} such that -f(-x)=f.
- Numbers k that divide tau(k)*sigma(k).A071707
Numbers k that divide tau(k)*sigma(k).
- Numerator of Sum_{k=1..n} phi(k)/k.A071708
Numerator of Sum_{k=1..n} phi(k)/k.
- Array A(i,j)= T(prime(i)^j) read by antidiagonals, where T(x) denote the "type" of the integer x: T(m)=1 or 2 depending on whether 1 or 2 is a descendant of n in the Half-totient tree.A071709
Array A(i,j)= T(prime(i)^j) read by antidiagonals, where T(x) denote the "type" of the integer x: T(m)=1 or 2 depending on whether 1 or 2 is a descendant of n in the Half-totient tree.
- Highly Wilsonian primes: smallest primes p such that w(p)=n where w(n) denote the number of nonnegative integers k such that k! = +1 or -1 (mod n).A071710
Highly Wilsonian primes: smallest primes p such that w(p)=n where w(n) denote the number of nonnegative integers k such that k! = +1 or -1 (mod n).