Sequences
392,541 sequences
- a(1) = 1; a(n) = smallest number such that the concatenation a(1).0^*.a(2).0^*....0^*.a(n) is a perfect cube (where any number of 0's can be inserted between the terms).A061111
a(1) = 1; a(n) = smallest number such that the concatenation a(1).0^*.a(2).0^*....0^*.a(n) is a perfect cube (where any number of 0's can be inserted between the terms).
- a(n) is the minimum number of divisors for any composite between prime(n) and prime(n+1).A061112
a(n) is the minimum number of divisors for any composite between prime(n) and prime(n+1).
- Concatenation of numbers in n-th row of triangle of Stirling numbers of second kind (A008277).A061113
Concatenation of numbers in n-th row of triangle of Stirling numbers of second kind (A008277).
- Concatenation of first n Bell numbers (starting with A000110(1)).A061114
Concatenation of first n Bell numbers (starting with A000110(1)).
- Concatenation of numbers in n-th row of triangle of unsigned Stirling numbers of first kind (A008275).A061115
Concatenation of numbers in n-th row of triangle of unsigned Stirling numbers of first kind (A008275).
- Numbers coprime to each of their decimal digits.A061116
Numbers coprime to each of their decimal digits.
- Maximum number of divisors for any composite between prime(n) and prime(n+1).A061117
Maximum number of divisors for any composite between prime(n) and prime(n+1).
- Let s(n) be the sequence of squares (A000290). Then this sequence is given by s(1), s(2)s(1)s(3), s(4)s(2)s(1)s(3)s(5), ...A061118
Let s(n) be the sequence of squares (A000290). Then this sequence is given by s(1), s(2)s(1)s(3), s(4)s(2)s(1)s(3)s(5), ...
- Primes in the sequence n^2 + 2^n (A001580).A061119
Primes in the sequence n^2 + 2^n (A001580).
- Compute sum of divisors of the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the smallest.A061120
Compute sum of divisors of the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the smallest.
- Number of degree-n permutations of order exactly 6.A061121
Number of degree-n permutations of order exactly 6.
- Number of degree-n permutations of order exactly 8.A061122
Number of degree-n permutations of order exactly 8.
- Number of degree-n permutations of order exactly 9.A061123
Number of degree-n permutations of order exactly 9.
- Number of degree-n permutations of order exactly 10.A061124
Number of degree-n permutations of order exactly 10.
- Number of degree-n permutations of order exactly 12.A061125
Number of degree-n permutations of order exactly 12.
- Number of degree-n permutations of order exactly 16.A061126
Number of degree-n permutations of order exactly 16.
- Number of degree-n permutations of order exactly 24.A061127
Number of degree-n permutations of order exactly 24.
- Number of degree-n permutations of order exactly 30.A061128
Number of degree-n permutations of order exactly 30.
- Number of degree-n even permutations of order dividing 4.A061129
Number of degree-n even permutations of order dividing 4.
- Number of degree-n even permutations of order dividing 6.A061130
Number of degree-n even permutations of order dividing 6.
- Number of degree-n even permutations of order dividing 8.A061131
Number of degree-n even permutations of order dividing 8.
- Number of degree-n even permutations of order dividing 10.A061132
Number of degree-n even permutations of order dividing 10.
- Number of degree-n even permutations of order exactly 6.A061133
Number of degree-n even permutations of order exactly 6.
- Number of degree-n even permutations of order exactly 8.A061134
Number of degree-n even permutations of order exactly 8.
- Number of degree-n even permutations of order exactly 10.A061135
Number of degree-n even permutations of order exactly 10.
- Number of degree-n odd permutations of order dividing 4.A061136
Number of degree-n odd permutations of order dividing 4.
- Number of degree-n odd permutations of order dividing 6.A061137
Number of degree-n odd permutations of order dividing 6.
- Number of degree-n odd permutations of order exactly 4.A061138
Number of degree-n odd permutations of order exactly 4.
- Number of degree-n odd permutations of order exactly 6.A061139
Number of degree-n odd permutations of order exactly 6.
- Number of degree-n odd permutations of order exactly 8.A061140
Number of degree-n odd permutations of order exactly 8.
- Compute sum of divisors of the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.A061141
Compute sum of divisors of the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.
- Replace each prime factor of n with 2: a(n) = 2^bigomega(n), where bigomega = A001222, number of prime factors counted with multiplicity.A061142
Replace each prime factor of n with 2: a(n) = 2^bigomega(n), where bigomega = A001222, number of prime factors counted with multiplicity.
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].A061143
a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].
- Sum of the areas of triangles whose vertices lie on the n X n grid with unit spacing as enumerated in A045996.A061144
Sum of the areas of triangles whose vertices lie on the n X n grid with unit spacing as enumerated in A045996.
- Sum of continued fraction terms in Sum_{k=1..n}(1/k^2).A061145
Sum of continued fraction terms in Sum_{k=1..n}(1/k^2).
- Decimal expansion of 11*Pi/10.A061146
Decimal expansion of 11*Pi/10.
- Product of all distinct numbers formed by permuting digits of n.A061147
Product of all distinct numbers formed by permuting digits of n.
- Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.A061148
Smallest positive integer for which the number of divisors is a product of 2 distinct primes: Min{x; d[x]=pq}.
- Smallest number whose number of divisors = n-th primorial (A002110).A061149
Smallest number whose number of divisors = n-th primorial (A002110).
- a(n) = Sum_{d|n} d*prime(d).A061150
a(n) = Sum_{d|n} d*prime(d).
- 1 + Sum_{n>=1} a_n x^n = 1/Product_{n>=1} (1+x^n)^prime(n).A061151
1 + Sum_{n>=1} a_n x^n = 1/Product_{n>=1} (1+x^n)^prime(n).
- Expansion of Product_{n>=1} (1+x^n)^prime(n).A061152
Expansion of Product_{n>=1} (1+x^n)^prime(n).
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.A061153
Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.A061154
Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.
- Numbers k such that k*2^m+1 is prime for exactly one exponent m in the range 0<=m<=k.A061155
Numbers k such that k*2^m+1 is prime for exactly one exponent m in the range 0<=m<=k.
- Exponent values m resulting from A061155.A061156
Exponent values m resulting from A061155.
- Numbers k such that k*2^m-1 is prime for exactly one exponent m in the range 0<=m<=k.A061157
Numbers k such that k*2^m-1 is prime for exactly one exponent m in the range 0<=m<=k.
- Exponent values m resulting from A061157.A061158
Exponent values m resulting from A061157.
- Numerators in expansion of Euler transform of b(n) = 1/2.A061159
Numerators in expansion of Euler transform of b(n) = 1/2.
- Numerators in expansion of Euler transform of b(n) = 1/3.A061160
Numerators in expansion of Euler transform of b(n) = 1/3.