Sequences
392,541 sequences
- Numbers n which are a factor of (LPP(n)-1)!, where LPP(n) is the largest prime power factor of n.A057111
Numbers n which are a factor of (LPP(n)-1)!, where LPP(n) is the largest prime power factor of n.
- Sequence of 719 adjacent transpositions (a[n] a[n]+1), which, when starting from the identity permutation and applied successively, produce a Hamiltonian circuit/path through all 720 permutations of S_6, in such a way that S_{n-1} is always traversed before the rest of S_n.A057112
Sequence of 719 adjacent transpositions (a[n] a[n]+1), which, when starting from the identity permutation and applied successively, produce a Hamiltonian circuit/path through all 720 permutations of S_6, in such a way that S_{n-1} is always traversed before the rest of S_n.
- Positions of permutations produced by the transposition sequence A057112 in A055089.A057113
Positions of permutations produced by the transposition sequence A057112 in A055089.
- Permutation of N induced by the order-preserving permutation of the rational numbers (x -> x+1); positions in Stern-Brocot tree.A057114
Permutation of N induced by the order-preserving permutation of the rational numbers (x -> x+1); positions in Stern-Brocot tree.
- Order-preserving permutation of the rational numbers (x -> x-1); positions in Stern-Brocot tree.A057115
Order-preserving permutation of the rational numbers (x -> x-1); positions in Stern-Brocot tree.
- k = a*b where ab is cyclic permutation of the digits of k.A057116
k = a*b where ab is cyclic permutation of the digits of k.
- Permutation of nonnegative integers obtained by mapping each forest of A000108[n] rooted binary plane trees from breadth-first to depth-first encoding.A057117
Permutation of nonnegative integers obtained by mapping each forest of A000108[n] rooted binary plane trees from breadth-first to depth-first encoding.
- Permutation of natural numbers induced by the automorphism df->bf (switch from the Depth First to the Breadth First coding for the binary trees) acting on the planar binary trees encoded by A014486.A057118
Permutation of natural numbers induced by the automorphism df->bf (switch from the Depth First to the Breadth First coding for the binary trees) acting on the planar binary trees encoded by A014486.
- Iterative "rewrite" sequence of binary plane trees.A057119
Iterative "rewrite" sequence of binary plane trees.
- Global ranks of terms of A057119.A057120
Global ranks of terms of A057119.
- Local ranks of terms of A057119.A057121
Local ranks of terms of A057119.
- The binary encoding (as a rooted planar tree) of each rooted planar binary tree. See A057123 for illustration.A057122
The binary encoding (as a rooted planar tree) of each rooted planar binary tree. See A057123 for illustration.
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.A057123
Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.
- Local ranks of terms of A057122.A057124
Local ranks of terms of A057122.
- Numbers n such that 3 is a square mod n.A057125
Numbers n such that 3 is a square mod n.
- Numbers k such that 2 is a square mod k.A057126
Numbers k such that 2 is a square mod k.
- -2 is a square mod n.A057127
-2 is a square mod n.
- Numbers n such that -3 is a square mod n.A057128
Numbers n such that -3 is a square mod n.
- -4 is a square mod n.A057129
-4 is a square mod n.
- Product of first n primes of form 6k-1.A057130
Product of first n primes of form 6k-1.
- One less than six times product of first n primes of form 6k-1.A057131
One less than six times product of first n primes of form 6k-1.
- Number of equivalence classes of self-dual Boolean functions of n variables under action of symmetric group S_n.A057132
Number of equivalence classes of self-dual Boolean functions of n variables under action of symmetric group S_n.
- Number of equivalence classes of self-dual 3-valued Post functions of n variables under action of symmetric group S_n.A057133
Number of equivalence classes of self-dual 3-valued Post functions of n variables under action of symmetric group S_n.
- Number of equivalence classes of self-dual 4-valued Post functions of n variables under action of symmetric group S_n.A057134
Number of equivalence classes of self-dual 4-valued Post functions of n variables under action of symmetric group S_n.
- Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10.A057135
Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10.
- Palindromes whose square root is a palindrome.A057136
Palindromes whose square root is a palindrome.
- Concatenate next digit at right hand end (where the next digit after 9 is again 0).A057137
Concatenate next digit at right hand end (where the next digit after 9 is again 0).
- Add (n mod 10)*10^(n-1) to the previous term, with a(0) = 0.A057138
Add (n mod 10)*10^(n-1) to the previous term, with a(0) = 0.
- Odd number of digits palindrome based on sequential digits.A057139
Odd number of digits palindrome based on sequential digits.
- Number of equivalence classes of self-dual 3-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,3).A057140
Number of equivalence classes of self-dual 3-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,3).
- Number of equivalence classes of self-dual 4-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,4).A057141
Number of equivalence classes of self-dual 4-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,4).
- Occurrences of most frequently occurring number in 1-to-n multiplication table.A057142
Occurrences of most frequently occurring number in 1-to-n multiplication table.
- Largest of the most frequently occurring numbers in 1-to-n multiplication table.A057143
Largest of the most frequently occurring numbers in 1-to-n multiplication table.
- Smallest of the most frequently occurring numbers in 1-to-n multiplication table.A057144
Smallest of the most frequently occurring numbers in 1-to-n multiplication table.
- Square array of polygonal numbers T(n,k) = ((n-2)*k^2 - (n-4)*k)/2, n >= 2, k >= 1, read by antidiagonals upwards.A057145
Square array of polygonal numbers T(n,k) = ((n-2)*k^2 - (n-4)*k)/2, n >= 2, k >= 1, read by antidiagonals upwards.
- The sequence 2, floor(a), floor(a^2), floor(a^3), ..., with a = 1+sqrt(5).A057146
The sequence 2, floor(a), floor(a^2), floor(a^3), ..., with a = 1+sqrt(5).
- a(n) = n times sum of digits of n.A057147
a(n) = n times sum of digits of n.
- Palindromes only using 0 and 1 (i.e., base-2 palindromes).A057148
Palindromes only using 0 and 1 (i.e., base-2 palindromes).
- Triangle T(n,k) of n X n binary matrices with k ones, with no zero rows or columns, up to row and column permutation.A057149
Triangle T(n,k) of n X n binary matrices with k ones, with no zero rows or columns, up to row and column permutation.
- Triangle read by rows: T(n,k) = number of k X k binary matrices with n ones, with no zero rows or columns, up to row and column permutation.A057150
Triangle read by rows: T(n,k) = number of k X k binary matrices with n ones, with no zero rows or columns, up to row and column permutation.
- Number of square binary matrices with n ones, with no zero rows or columns, up to row and column permutation.A057151
Number of square binary matrices with n ones, with no zero rows or columns, up to row and column permutation.
- Limiting number of m X m binary matrices with m+n ones, with no zero rows or columns, up to row and column permutations, as m tends to infinity.A057152
Limiting number of m X m binary matrices with m+n ones, with no zero rows or columns, up to row and column permutations, as m tends to infinity.
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives first row of array.A057153
Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives first row of array.
- Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives numbers not used.A057154
Construct difference array so that (1) first row begins with 1, (2) every row is monotonic increasing, (3) no number appears more than once, (4) smallest number not yet used begins a new row. Sequence gives numbers not used.
- Denominator of Sum_{k<=n} P(k)/p(k), where p(k) (resp. P(k)) is smallest (resp. largest) prime divisor of k.A057155
Denominator of Sum_{k<=n} P(k)/p(k), where p(k) (resp. P(k)) is smallest (resp. largest) prime divisor of k.
- Number of functions from {0,1}^n to {0,1}^n.A057156
Number of functions from {0,1}^n to {0,1}^n.
- Number of non-invertible functions from {0,1}^n to {0,1}^n.A057157
Number of non-invertible functions from {0,1}^n to {0,1}^n.
- Numerator of Sum_{k<=n} P(k)/p(k), where p(k) (resp. P(k)) is smallest (resp. largest) prime divisor of k.A057158
Numerator of Sum_{k<=n} P(k)/p(k), where p(k) (resp. P(k)) is smallest (resp. largest) prime divisor of k.
- Numbers k that divide s(k-1), where s(1) = 1, s(k) = s(k-1) + (k+1)*3^k.A057159
Numbers k that divide s(k-1), where s(1) = 1, s(k) = s(k-1) + (k+1)*3^k.
- Smallest value of k for which the expression k*2^(2^n-1)-1 is prime.A057160
Smallest value of k for which the expression k*2^(2^n-1)-1 is prime.