Sequences
392,541 sequences
- Number of n X n matrices over symbol set {1,2,3,4} equivalent under any permutation of row, columns or the symbol set.A091061
Number of n X n matrices over symbol set {1,2,3,4} equivalent under any permutation of row, columns or the symbol set.
- Number of n X n matrices over symbol set {1,2,3,4,5} equivalent under any permutation of row, columns or the symbol set.A091062
Number of n X n matrices over symbol set {1,2,3,4,5} equivalent under any permutation of row, columns or the symbol set.
- Triangle, read by rows, such that the initial terms of the binomial transform of the n-th row forms the n-th row of triangle A059438 transposed (permutations of [1..n] with k components).A091063
Triangle, read by rows, such that the initial terms of the binomial transform of the n-th row forms the n-th row of triangle A059438 transposed (permutations of [1..n] with k components).
- In binary representation: length of longest proper prefix of n, that is also a suffix.A091064
In binary representation: length of longest proper prefix of n, that is also a suffix.
- Numbers having in binary representation no proper prefix that is also a suffix.A091065
Numbers having in binary representation no proper prefix that is also a suffix.
- Numbers having in binary representation at least one proper prefix that is also a suffix.A091066
Numbers having in binary representation at least one proper prefix that is also a suffix.
- Numbers whose odd part is of the form 4*k+3.A091067
Numbers whose odd part is of the form 4*k+3.
- a(0) = 0; for n>0, a(n) = a(n-1) - n if that is >= 0, else a(n) = a(n-1) + n - 1.A091068
a(0) = 0; for n>0, a(n) = a(n-1) - n if that is >= 0, else a(n) = a(n-1) + n - 1.
- Moebius mu sequence for real quadratic extension sqrt(2).A091069
Moebius mu sequence for real quadratic extension sqrt(2).
- Number of automorphism groups of partial orders on n points.A091070
Number of automorphism groups of partial orders on n points.
- Number of normalizers of subgroups of the symmetric group on n points.A091071
Number of normalizers of subgroups of the symmetric group on n points.
- Positive numbers k such that the Kronecker Symbol (-1 / k) > 0.A091072
Positive numbers k such that the Kronecker Symbol (-1 / k) > 0.
- Number of transitive relations on n unlabeled points.A091073
Number of transitive relations on n unlabeled points.
- Fibonacci sequence beginning 12, 67.A091074
Fibonacci sequence beginning 12, 67.
- Primes occurring in A091074.A091075
Primes occurring in A091074.
- Indices of terms in A091074 which are prime numbers.A091076
Indices of terms in A091074 which are prime numbers.
- Numbers n which when converted to base 3, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091077
Numbers n which when converted to base 3, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 4, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091078
Numbers n which when converted to base 4, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 5, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091079
Numbers n which when converted to base 5, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 6, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091080
Numbers n which when converted to base 6, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 7, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091081
Numbers n which when converted to base 7, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 8, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091082
Numbers n which when converted to base 8, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- Numbers n which when converted to base 9, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.A091083
Numbers n which when converted to base 9, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.
- a(n) = A001045(n) mod 10.A091084
a(n) = A001045(n) mod 10.
- a(n) = mod(A078008(n),10).A091085
a(n) = mod(A078008(n),10).
- a(n) = A000975(n) mod 10.A091086
a(n) = A000975(n) mod 10.
- a(n) = floor(r*n) + floor(n/r), where r=sqrt(2).A091087
a(n) = floor(r*n) + floor(n/r), where r=sqrt(2).
- a(n) is the minimum odd number that must be appended to n to form a prime.A091088
a(n) is the minimum odd number that must be appended to n to form a prime.
- Numbers which form a prime by appending a 3-digit odd number and form no primes by appending any 1- or 2-digit odd number not beginning with 0.A091089
Numbers which form a prime by appending a 3-digit odd number and form no primes by appending any 1- or 2-digit odd number not beginning with 0.
- In binary representation: number of editing steps (delete, insert, or substitute) to transform n into n + 1.A091090
In binary representation: number of editing steps (delete, insert, or substitute) to transform n into n + 1.
- Numbers needing in binary and ternary representation an equal minimal number of editing steps (delete, insert or substitute) to transform them into their square.A091091
Numbers needing in binary and ternary representation an equal minimal number of editing steps (delete, insert or substitute) to transform them into their square.
- In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.A091092
In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.
- In ternary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.A091093
In ternary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.
- Number of partitions of n-th composite number not containing the smallest prime factor.A091094
Number of partitions of n-th composite number not containing the smallest prime factor.
- Expansion of (1+4x-24x^2)/((1-4x)(1+4x)).A091095
Expansion of (1+4x-24x^2)/((1-4x)(1+4x)).
- Expansion of (1+5x-40x^2)/((1-5x)(1+5x)).A091096
Expansion of (1+5x-40x^2)/((1-5x)(1+5x)).
- Expansion of (1+6x-60x^2)/((1-6x)(1+6x)).A091097
Expansion of (1+6x-60x^2)/((1-6x)(1+6x)).
- Number of primes of the form 4k+1 less than 10^n.A091098
Number of primes of the form 4k+1 less than 10^n.
- Number of primes of the form 4k+3 less than 10^n.A091099
Number of primes of the form 4k+3 less than 10^n.
- Number of Gaussian primes whose norm is less than 10^n.A091100
Number of Gaussian primes whose norm is less than 10^n.
- Number of first-quadrant Gaussian primes whose norm is less than 10^n.A091101
Number of first-quadrant Gaussian primes whose norm is less than 10^n.
- Number of first half-quadrant Gaussian primes whose norm is less than 10^n.A091102
Number of first half-quadrant Gaussian primes whose norm is less than 10^n.
- Expansion of (1-3*x+12*x^2)/((1-3*x)*(1+3*x)).A091103
Expansion of (1-3*x+12*x^2)/((1-3*x)*(1+3*x)).
- Expansion of (1-4x+24x^2)/((1-4x)(1+4x)).A091104
Expansion of (1-4x+24x^2)/((1-4x)(1+4x)).
- Expansion of (1-5x+40x^2)/((1-5x)(1+5x)).A091105
Expansion of (1-5x+40x^2)/((1-5x)(1+5x)).
- a(0)=a(1)=-1. For n>1: a(n)=Sum(i!i^2 Stirling2[n-1,i],i=2,..,n-1).A091106
a(0)=a(1)=-1. For n>1: a(n)=Sum(i!i^2 Stirling2[n-1,i],i=2,..,n-1).
- Number of nonorientable hyperbolic 3-manifolds of cusp type 2 obtained from n ideal tetrahedra.A091107
Number of nonorientable hyperbolic 3-manifolds of cusp type 2 obtained from n ideal tetrahedra.
- Number of cusped orientable hyperbolic 3-manifolds obtained from n ideal tetrahedra.A091108
Number of cusped orientable hyperbolic 3-manifolds obtained from n ideal tetrahedra.
- Number of occurrences of smallest prime factor in all partitions of n-th composite number: a(n)=A066633(A002808(n), A056608(n)).A091109
Number of occurrences of smallest prime factor in all partitions of n-th composite number: a(n)=A066633(A002808(n), A056608(n)).
- Number of editing steps (deletion, insertion, or substitution) to transform the binary representation of n into the ternary representation of n.A091110
Number of editing steps (deletion, insertion, or substitution) to transform the binary representation of n into the ternary representation of n.