Sequences
392,541 sequences
- Erroneous version of A127885.A072761
Erroneous version of A127885.
- n coded as binary word of length=n with k-th bit set iff k is prime (1<=k<=n), decimal value.A072762
n coded as binary word of length=n with k-th bit set iff k is prime (1<=k<=n), decimal value.
- Duplicate of A057846.A072763
Duplicate of A057846.
- Tabular N X N -> N bijection induced by Lisp/Scheme function 'cons' combining the two planar binary trees/general trees/parenthesizations encoded by A014486(X) and A014486(Y).A072764
Tabular N X N -> N bijection induced by Lisp/Scheme function 'cons' combining the two planar binary trees/general trees/parenthesizations encoded by A014486(X) and A014486(Y).
- Inverse permutation to A072764.A072765
Inverse permutation to A072764.
- Transpose of A072764, 'cons' with arguments swapped.A072766
Transpose of A072764, 'cons' with arguments swapped.
- Inverse permutation to A072766.A072767
Inverse permutation to A072766.
- The RASTxx transformation of the sequence A072643.A072768
The RASTxx transformation of the sequence A072643.
- Differences between A071673 and A072768.A072769
Differences between A071673 and A072768.
- Triangle A072768 computed modulo 2.A072770
Triangle A072768 computed modulo 2.
- X-projection of the tabular N X N -> N bijection A072764 and Y-projection of its transpose A072766.A072771
X-projection of the tabular N X N -> N bijection A072764 and Y-projection of its transpose A072766.
- Y-projection of the tabular N X N -> N bijection A072764 and X-projection of its transpose A072766.A072772
Y-projection of the tabular N X N -> N bijection A072764 and X-projection of its transpose A072766.
- The upper triangular region of A072764.A072773
The upper triangular region of A072764.
- Powers of squarefree numbers.A072774
Powers of squarefree numbers.
- Squarefree kernels of powers of squarefree numbers.A072775
Squarefree kernels of powers of squarefree numbers.
- Exponents of powers of squarefree numbers.A072776
Exponents of powers of squarefree numbers.
- Powers of squarefree numbers that are not squarefree.A072777
Powers of squarefree numbers that are not squarefree.
- Number of powers of squarefree numbers <= n.A072778
Number of powers of squarefree numbers <= n.
- a(n) = sigma_2(n) + phi(n) * sigma(n).A072779
a(n) = sigma_2(n) + phi(n) * sigma(n).
- a(n) = sigma_2(n) + phi(n) * sigma(n) - 2*n^2, which is A072779(n) - 2*n^2.A072780
a(n) = sigma_2(n) + phi(n) * sigma(n) - 2*n^2, which is A072779(n) - 2*n^2.
- X-projection of the tabular N X N -> N bijection A072735.A072781
X-projection of the tabular N X N -> N bijection A072735.
- Y-projection of the tabular N X N -> N bijection A072735.A072782
Y-projection of the tabular N X N -> N bijection A072735.
- Differences between A072740 and A072736.A072783
Differences between A072740 and A072736.
- Differences between A072741 and A072737.A072784
Differences between A072741 and A072737.
- Differences between A072781 and A072738.A072785
Differences between A072781 and A072738.
- Differences between A072782 and A072739.A072786
Differences between A072782 and A072739.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A072734 as the packing bijection N X N -> N.A072787
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A072734 as the packing bijection N X N -> N.
- Inverse permutation to A072787.A072788
Inverse permutation to A072787.
- The size of the parenthesizations obtained with the global ranking/unranking scheme presented in A072787-A072788.A072789
The size of the parenthesizations obtained with the global ranking/unranking scheme presented in A072787-A072788.
- Maximum position in A072789 where the value n occurs.A072790
Maximum position in A072789 where the value n occurs.
- Binary widths of A072790.A072791
Binary widths of A072790.
- Triangle A072789 computed modulo 2.A072792
Triangle A072789 computed modulo 2.
- Simple tabular N X N -> N bijection: first interleave the bits as with A054238, then apply the bijection A048680.A072793
Simple tabular N X N -> N bijection: first interleave the bits as with A054238, then apply the bijection A048680.
- Inverse permutation to A072793.A072794
Inverse permutation to A072793.
- A014486-indices of the plane binary trees AND plane general trees whose left subtree is just a stick: \. thus corresponding to the parenthesizations whose first element (of the top-level list) is an empty parenthesization: ().A072795
A014486-indices of the plane binary trees AND plane general trees whose left subtree is just a stick: \. thus corresponding to the parenthesizations whose first element (of the top-level list) is an empty parenthesization: ().
- Self-inverse permutation of natural numbers induced by the Catalan bijection swapping the two leftmost subtrees in the general tree context of the parenthesizations encoded by A014486. See illustrations in the comments.A072796
Self-inverse permutation of natural numbers induced by the Catalan bijection swapping the two leftmost subtrees in the general tree context of the parenthesizations encoded by A014486. See illustrations in the comments.
- Self-inverse permutation of natural numbers induced by a Catalan bijection acting on binary trees as encoded by A014486. See comments and examples for details.A072797
Self-inverse permutation of natural numbers induced by a Catalan bijection acting on binary trees as encoded by A014486. See comments and examples for details.
- Self-inverse permutation of nonnegative integers obtained by contracting the permutation A069787 induced by the telescoping Catalan bijection DeepRev1CarSide.A072798
Self-inverse permutation of nonnegative integers obtained by contracting the permutation A069787 induced by the telescoping Catalan bijection DeepRev1CarSide.
- Self-inverse permutation of natural numbers: A072798(n-1)+1. (one-based).A072799
Self-inverse permutation of natural numbers: A072798(n-1)+1. (one-based).
- Composition of A030101 and A014486. Binary encodings of parenthesizations, Dyck paths and other Catalan structures reversed.A072800
Composition of A030101 and A014486. Binary encodings of parenthesizations, Dyck paths and other Catalan structures reversed.
- Continued fraction expansion of Product_{p prime} (1 - 1/(p*(p^2-1))).A072801
Continued fraction expansion of Product_{p prime} (1 - 1/(p*(p^2-1))).
- Continued fraction expansion of Product_{p prime} (1 + 1/(p*(p^2-1))).A072802
Continued fraction expansion of Product_{p prime} (1 + 1/(p*(p^2-1))).
- a(n) is n written in base n mod 10, or 0 if n mod 10 = 0.A072803
a(n) is n written in base n mod 10, or 0 if n mod 10 = 0.
- n-th prime prime(n) written in base (prime(n) (mod 4)).A072804
n-th prime prime(n) written in base (prime(n) (mod 4)).
- Primes of form 4k+3 written in base 3.A072805
Primes of form 4k+3 written in base 3.
- Primes of the form 6k+5 written in base 5.A072806
Primes of the form 6k+5 written in base 5.
- n-th prime prime(n) written in base (prime(n) (mod prime(n-1))).A072807
n-th prime prime(n) written in base (prime(n) (mod prime(n-1))).
- Smallest m such that sigma(m) mod phi(m) = n or 0 if no solution exists.A072808
Smallest m such that sigma(m) mod phi(m) = n or 0 if no solution exists.
- Abntu sequence (Bantu alphabetized): list the numbers which have no 2's in their decimal expansion, but sort the digits of each term into alphabetical order.A072809
Abntu sequence (Bantu alphabetized): list the numbers which have no 2's in their decimal expansion, but sort the digits of each term into alphabetical order.
- a(0)=1, a(n) = a(n-1) - Sum_{k=2..n} mu(k) * a(n-k), where mu(k) is the Moebius function of k.A072810
a(0)=1, a(n) = a(n-1) - Sum_{k=2..n} mu(k) * a(n-k), where mu(k) is the Moebius function of k.