Sequences
392,541 sequences
- Number of prime factors (counted with multiplicity) of d(n), the number of divisors of n.A058061
Number of prime factors (counted with multiplicity) of d(n), the number of divisors of n.
- Number of distinct prime factors of sigma(n), the sum of the divisors of n.A058062
Number of distinct prime factors of sigma(n), the sum of the divisors of n.
- Number of prime factors (when counted with multiplicity) of sigma(n), the sum of divisors of n.A058063
Number of prime factors (when counted with multiplicity) of sigma(n), the sum of divisors of n.
- Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.A058064
Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.
- Complement of A057843.A058065
Complement of A057843.
- a(n) = floor(n*t), t = 1 + sqrt(5)/2.A058066
a(n) = floor(n*t), t = 1 + sqrt(5)/2.
- Number of polynomial functions from Z to Z/nZ.A058067
Number of polynomial functions from Z to Z/nZ.
- Denominators of convergents to Champernowne constant (A033307).A058068
Denominators of convergents to Champernowne constant (A033307).
- Numerators of convergents to Champernowne constant (A033307).A058069
Numerators of convergents to Champernowne constant (A033307).
- "A sorry sequence".A058070
"A sorry sequence".
- A Fibonacci triangle: triangle T(n,k) = Fibonacci(k+1)*Fibonacci(n-k+1), for n >= 0, 0 <= k <= n.A058071
A Fibonacci triangle: triangle T(n,k) = Fibonacci(k+1)*Fibonacci(n-k+1), for n >= 0, 0 <= k <= n.
- Numbers k such that sigma(k) divides sigma(k+1), where sigma(k) is sum of positive divisors of k.A058072
Numbers k such that sigma(k) divides sigma(k+1), where sigma(k) is sum of positive divisors of k.
- Numbers k such that sigma(k+1) divides sigma(k), where sigma(k) is the sum of positive divisors of k.A058073
Numbers k such that sigma(k+1) divides sigma(k), where sigma(k) is the sum of positive divisors of k.
- Integers m such that gcd(d(m),d(m+1)) = 1, where d(m) is number of positive divisors of m.A058074
Integers m such that gcd(d(m),d(m+1)) = 1, where d(m) is number of positive divisors of m.
- Numbers k such that gcd(sigma(k), sigma(k+1)) = 1, where sigma(k) is sum of positive divisors of k.A058075
Numbers k such that gcd(sigma(k), sigma(k+1)) = 1, where sigma(k) is sum of positive divisors of k.
- Numbers n such that n | sigma_3(n) + sigma_2(n) + sigma_1(n) + sigma_0(n).A058076
Numbers n such that n | sigma_3(n) + sigma_2(n) + sigma_1(n) + sigma_0(n).
- Binomial coefficients formed from consecutive primes: a(n) = binomial( prime(n+1), prime(n) ).A058077
Binomial coefficients formed from consecutive primes: a(n) = binomial( prime(n+1), prime(n) ).
- Greatest common divisor of two binomial coefficients formed from consecutive primes: a(n) = gcd(C(prime(n+2), prime(n+1)), C(prime(n+1), prime(n))).A058078
Greatest common divisor of two binomial coefficients formed from consecutive primes: a(n) = gcd(C(prime(n+2), prime(n+1)), C(prime(n+1), prime(n))).
- a(n) = p3, where {p1,p2,p3} are 3 consecutive primes with increasing order such that gcd(C(p3,p2), C(p2,p1)) = 1, where C is the binomial coefficient.A058079
a(n) = p3, where {p1,p2,p3} are 3 consecutive primes with increasing order such that gcd(C(p3,p2), C(p2,p1)) = 1, where C is the binomial coefficient.
- Numbers whose product of divisors exceeds their square.A058080
Numbers whose product of divisors exceeds their square.
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3),...,a(n-1),a(n)] and [a(n); a(n-1), a(n-2),...,a(2), a(1)].A058081
a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3),...,a(n-1),a(n)] and [a(n); a(n-1), a(n-2),...,a(2), a(1)].
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].A058082
a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].
- a(1) = 1; a(n+1) = sum of terms in continued fraction for sum of continued fractions, [a(n); a(n-1), a(n-2),...,a(1)] and [0; a(n), a(n-1), a(n-2),...,a(1)].A058083
a(1) = 1; a(n+1) = sum of terms in continued fraction for sum of continued fractions, [a(n); a(n-1), a(n-2),...,a(1)] and [0; a(n), a(n-1), a(n-2),...,a(1)].
- Smallest m such that binomial(m,k) = n for some k.A058084
Smallest m such that binomial(m,k) = n for some k.
- Coefficients of ménage hit polynomials.A058085
Coefficients of ménage hit polynomials.
- Coefficients of ménage hit polynomials.A058086
Coefficients of ménage hit polynomials.
- Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n.A058087
Triangle read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n.
- McKay-Thompson series of class 8b for Monster.A058088
McKay-Thompson series of class 8b for Monster.
- Coefficients of ménage hit polynomials.A058089
Coefficients of ménage hit polynomials.
- Coefficients of ménage hit polynomials.A058090
Coefficients of ménage hit polynomials.
- McKay-Thompson series of class 9B for the Monster group.A058091
McKay-Thompson series of class 9B for the Monster group.
- McKay-Thompson series of class 9a for the Monster group.A058092
McKay-Thompson series of class 9a for the Monster group.
- Erroneous version of A112146.A058093
Erroneous version of A112146.
- Number of 321-hexagon-avoiding permutations in S_n, i.e., permutations of 1..n with no submatrix equivalent to 321, 56781234, 46781235, 56718234 or 46718235.A058094
Number of 321-hexagon-avoiding permutations in S_n, i.e., permutations of 1..n with no submatrix equivalent to 321, 56781234, 46781235, 56718234 or 46718235.
- McKay-Thompson series of class 9c for the Monster group.A058095
McKay-Thompson series of class 9c for the Monster group.
- McKay-Thompson series of class 9d for Monster.A058096
McKay-Thompson series of class 9d for Monster.
- McKay-Thompson series of class 10A for Monster.A058097
McKay-Thompson series of class 10A for Monster.
- McKay-Thompson series of class 10B for the Monster group with a(0) = 0.A058098
McKay-Thompson series of class 10B for the Monster group with a(0) = 0.
- McKay-Thompson series of class 10C for Monster.A058099
McKay-Thompson series of class 10C for Monster.
- McKay-Thompson series of class 10D for the Monster group.A058100
McKay-Thompson series of class 10D for the Monster group.
- McKay-Thompson series of class 10E for Monster.A058101
McKay-Thompson series of class 10E for Monster.
- McKay-Thompson series of class 10a for Monster.A058102
McKay-Thompson series of class 10a for Monster.
- McKay-Thompson series of class 10b for Monster.A058103
McKay-Thompson series of class 10b for Monster.
- Number of asymmetric semigroups of order n.A058104
Number of asymmetric semigroups of order n.
- Number of commutative asymmetric semigroups of order n.A058105
Number of commutative asymmetric semigroups of order n.
- Number of self-converse asymmetric semigroups of order n.A058106
Number of self-converse asymmetric semigroups of order n.
- Number of asymmetric semigroups of order n, considered to be equivalent when they are isomorphic or anti-isomorphic (by reversal of the operator).A058107
Number of asymmetric semigroups of order n, considered to be equivalent when they are isomorphic or anti-isomorphic (by reversal of the operator).
- Triangle read by rows: number of nonisomorphic semigroups of order n with k idempotents.A058108
Triangle read by rows: number of nonisomorphic semigroups of order n with k idempotents.
- Semigroups of order n with 1 idempotent.A058109
Semigroups of order n with 1 idempotent.
- Semigroups of order n with 2 idempotents.A058110
Semigroups of order n with 2 idempotents.