Sequences
392,541 sequences
- Numbers having at least one divisor, d, such that for some x, d-x and d+x are also divisors.A091011
Numbers having at least one divisor, d, such that for some x, d-x and d+x are also divisors.
- Numbers having exactly one divisor d such that for some x also d-x and d+x are divisors.A091012
Numbers having exactly one divisor d such that for some x also d-x and d+x are divisors.
- Numbers having more than one divisor d such that for some x also d-x and d+x are divisors.A091013
Numbers having more than one divisor d such that for some x also d-x and d+x are divisors.
- Smallest number having exactly n divisors d such that for some x also d-x and d+x are divisors.A091014
Smallest number having exactly n divisors d such that for some x also d-x and d+x are divisors.
- Least integer x>0 such that x^2=ceiling(x*r*floor(x/r)) where r=sqrt(n).A091015
Least integer x>0 such that x^2=ceiling(x*r*floor(x/r)) where r=sqrt(n).
- a(n) is the least x such that the n values x+0, x+6, x+12, ..., x+6*(n-1) are all products of exactly two primes (i.e., semiprimes).A091016
a(n) is the least x such that the n values x+0, x+6, x+12, ..., x+6*(n-1) are all products of exactly two primes (i.e., semiprimes).
- Nonpalindromic integers which have an even number of ones in binary and whose reverse does as well.A091017
Nonpalindromic integers which have an even number of ones in binary and whose reverse does as well.
- Numbers in n-th upward diagonal of triangle T : 0; 1, 2; 3, 4, 5; 6, 7, 8, 9; ...A091018
Numbers in n-th upward diagonal of triangle T : 0; 1, 2; 3, 4, 5; 6, 7, 8, 9; ...
- Denominators of the Taylor series of arccosh(z)/sqrt(2(x-1)) about 1.A091019
Denominators of the Taylor series of arccosh(z)/sqrt(2(x-1)) about 1.
- Numbers n such that in binary representation n is a substring of the n-th prime.A091020
Numbers n such that in binary representation n is a substring of the n-th prime.
- Primes p=prime(k) such that in binary representation k is a substring of p.A091021
Primes p=prime(k) such that in binary representation k is a substring of p.
- Semiprimes with semiprime indices.A091022
Semiprimes with semiprime indices.
- a(1)=1; for n >= 2, set a(n)=m, where n is the smallest unassigned index with exactly m-1 unassigned indices still remaining between m and m-1.A091023
a(1)=1; for n >= 2, set a(n)=m, where n is the smallest unassigned index with exactly m-1 unassigned indices still remaining between m and m-1.
- Let v(0) be the column vector (1,0,0,0)'; for n>0, let v(n) = [1 1 1 1 / 1 1 1 0 / 1 1 0 0/ 1 0 0 0] v(n-1). Sequence gives third entry of v(n).A091024
Let v(0) be the column vector (1,0,0,0)'; for n>0, let v(n) = [1 1 1 1 / 1 1 1 0 / 1 1 0 0/ 1 0 0 0] v(n-1). Sequence gives third entry of v(n).
- Smallest positive k such that phi(1+k*2^m) <= phi(k*2^m) for all m = n (mod 12), where phi is Euler's totient function.A091025
Smallest positive k such that phi(1+k*2^m) <= phi(k*2^m) for all m = n (mod 12), where phi is Euler's totient function.
- Fifth column (m=6) of array A090452.A091026
Fifth column (m=6) of array A090452.
- Sixth column (m=7) of array A090452.A091027
Sixth column (m=7) of array A090452.
- Alternating row sums of array A090440 (generalized Stirling2 array (4,3)).A091028
Alternating row sums of array A090440 (generalized Stirling2 array (4,3)).
- Signed array used for numerators of generating functions of the column sequences of array A090452.A091029
Signed array used for numerators of generating functions of the column sequences of array A090452.
- Partial sums of powers of 13 (A001022).A091030
Partial sums of powers of 13 (A001022).
- Third to last entries in rows of array A090452 (scaled (3,2)-Stirling2).A091031
Third to last entries in rows of array A090452 (scaled (3,2)-Stirling2).
- Second column (k=3) of array A090438 ((4,2)-Stirling2) divided by 8.A091032
Second column (k=3) of array A090438 ((4,2)-Stirling2) divided by 8.
- Third column (k=4) of array A090438 ((4,2)-Stirling2).A091033
Third column (k=4) of array A090438 ((4,2)-Stirling2).
- Fourth column (k=5) of array A090438 ((4,2)-Stirling2) divided by 24.A091034
Fourth column (k=5) of array A090438 ((4,2)-Stirling2) divided by 24.
- Fifth column (k=6) of array A090438 ((4,2)-Stirling2).A091035
Fifth column (k=6) of array A090438 ((4,2)-Stirling2).
- Sixth column (k=7) of array A090438 ((4,2)-Stirling2) divided by 48 = 4!*2.A091036
Sixth column (k=7) of array A090438 ((4,2)-Stirling2) divided by 48 = 4!*2.
- Second column (k=5) of array A090214 ((4,4)-Stirling2) divided by 4*4!=96.A091037
Second column (k=5) of array A090214 ((4,4)-Stirling2) divided by 4*4!=96.
- Second column (k=6) of array A090216 ((5,5)-Stirling2) divided by 5*5! = 600.A091038
Second column (k=6) of array A090216 ((5,5)-Stirling2) divided by 5*5! = 600.
- Triangle of scaled second column sequences of (k,k)-Stirling2 arrays.A091039
Triangle of scaled second column sequences of (k,k)-Stirling2 arrays.
- Row sums of triangle A091039 (scaled second columns of (k,k)-Stirling2 arrays).A091040
Row sums of triangle A091039 (scaled second columns of (k,k)-Stirling2 arrays).
- Alternating row sums of triangle A091039 (scaled second columns of (k,k)-Stirling2 arrays).A091041
Alternating row sums of triangle A091039 (scaled second columns of (k,k)-Stirling2 arrays).
- Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318.A091042
Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318.
- Normalized triangle of odd numbered entries of even numbered rows of Pascal's triangle A007318.A091043
Normalized triangle of odd numbered entries of even numbered rows of Pascal's triangle A007318.
- One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.A091044
One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.
- Partial sums of powers of 17 (A001026).A091045
Partial sums of powers of 17 (A001026).
- Stirling transform of first differences of Bell numbers (A005493), if offset zero: a(n) = Sum_{k=1..n} A008277(n,k)*A005493(k).A091046
Stirling transform of first differences of Bell numbers (A005493), if offset zero: a(n) = Sum_{k=1..n} A008277(n,k)*A005493(k).
- a(n) = the final value of n reached through repeated interpretation of n as a base b+1 number where b is the largest digit of n.A091047
a(n) = the final value of n reached through repeated interpretation of n as a base b+1 number where b is the largest digit of n.
- a(n) = the number of steps needed to reach the final value of n via repeated interpretation of n as a base b+1 number where b is the largest digit of n.A091048
a(n) = the number of steps needed to reach the final value of n via repeated interpretation of n as a base b+1 number where b is the largest digit of n.
- a(n) = first term which reduces to an unchanging value in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n).A091049
a(n) = first term which reduces to an unchanging value in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n).
- Number of divisors of n that are perfect powers.A091050
Number of divisors of n that are perfect powers.
- Sum of divisors of n that are perfect powers.A091051
Sum of divisors of n that are perfect powers.
- Record values in A091023.A091052
Record values in A091023.
- Where records occur in A091023.A091053
Where records occur in A091023.
- Expansion of (1 - 5*x - 2*x^2) / ((1 - x)*(1 + 2*x)*(1 - 6*x)).A091054
Expansion of (1 - 5*x - 2*x^2) / ((1 - x)*(1 + 2*x)*(1 - 6*x)).
- Expansion of x*(1-2*x)/((1-x)*(1+2*x)*(1-6*x)).A091055
Expansion of x*(1-2*x)/((1-x)*(1+2*x)*(1-6*x)).
- Expansion of x^2/((1-x)*(1+2*x)*(1-6*x)).A091056
Expansion of x^2/((1-x)*(1+2*x)*(1-6*x)).
- Number of n X n matrices over symbol set {1,...,n^2} equivalent under any permutation of row, columns or the symbol set.A091057
Number of n X n matrices over symbol set {1,...,n^2} equivalent under any permutation of row, columns or the symbol set.
- Number of n X n matrices over symbol set {1,...,n} equivalent under any permutation of row, columns or the symbol set.A091058
Number of n X n matrices over symbol set {1,...,n} equivalent under any permutation of row, columns or the symbol set.
- Number of n X n matrices over symbol set {1,2} equivalent under any permutation of row, columns or the symbol set.A091059
Number of n X n matrices over symbol set {1,2} equivalent under any permutation of row, columns or the symbol set.
- Number of n X n matrices over symbol set {1,2,3} equivalent under any permutation of row, columns or the symbol set.A091060
Number of n X n matrices over symbol set {1,2,3} equivalent under any permutation of row, columns or the symbol set.