Sequences
392,541 sequences
- Decimal expansion of (e/Pi)^4.A092161
Decimal expansion of (e/Pi)^4.
- Decimal expansion of (e/Pi)^6.A092162
Decimal expansion of (e/Pi)^6.
- a(n) = prime(2n) + prime(2n+1).A092163
a(n) = prime(2n) + prime(2n+1).
- Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (1,1) entry of M^n.A092164
Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (1,1) entry of M^n.
- Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (1,2) entry of M^n.A092165
Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (1,2) entry of M^n.
- Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (2,1) entry of M^n.A092166
Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (2,1) entry of M^n.
- Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (2,2) entry of M^n.A092167
Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (2,2) entry of M^n.
- Primes congruent to 3 (modulo 19).A092168
Primes congruent to 3 (modulo 19).
- a(n) = A000217(n)-A092674(n).A092169
a(n) = A000217(n)-A092674(n).
- Sum of squares of alternating factorials : n!^2 - (n-1)!^2 + (n-2)!^2 - ... 1!^2.A092170
Sum of squares of alternating factorials : n!^2 - (n-1)!^2 + (n-2)!^2 - ... 1!^2.
- Decimal expansion of Pi^(-e).A092171
Decimal expansion of Pi^(-e).
- Decimal expansion of Pi^(-2*e).A092172
Decimal expansion of Pi^(-2*e).
- Decimal expansion of Pi^(2*e).A092173
Decimal expansion of Pi^(2*e).
- Decimal expansion of Pi^(3e).A092174
Decimal expansion of Pi^(3e).
- Define d(n,k) to be the number of '1' digits required to write out all the integers from 1 through k in base n. E.g., d(10,9) = 1 (just '1'), d(10,10) = 2 ('1' and '10'), d(10,11) = 4 ('1', '10' and '11'). Then a(n) is the first k >= 1 such that d(n,k) > k.A092175
Define d(n,k) to be the number of '1' digits required to write out all the integers from 1 through k in base n. E.g., d(10,9) = 1 (just '1'), d(10,10) = 2 ('1' and '10'), d(10,11) = 4 ('1', '10' and '11'). Then a(n) is the first k >= 1 such that d(n,k) > k.
- A067076 + A000079/2.A092176
A067076 + A000079/2.
- a(n) = position of first occurrence of n in A093578. I.e., A093578(a(n)) = n and a(n) is the smallest number for which that is true.A092177
a(n) = position of first occurrence of n in A093578. I.e., A093578(a(n)) = n and a(n) is the smallest number for which that is true.
- Primes congruent to 8 mod 13.A092178
Primes congruent to 8 mod 13.
- Number of partitions of n^2 into squares providing no dissections of the square n X n into smaller squares.A092179
Number of partitions of n^2 into squares providing no dissections of the square n X n into smaller squares.
- Permutation of primes generated by triangle shown below.A092180
Permutation of primes generated by triangle shown below.
- Figurate numbers based on the 24-cell (4-D polytope with Schlaefli symbol {3,4,3}).A092181
Figurate numbers based on the 24-cell (4-D polytope with Schlaefli symbol {3,4,3}).
- Figurate numbers based on the 600-cell (4-D polytope with Schlaefli symbol {3,3,5}).A092182
Figurate numbers based on the 600-cell (4-D polytope with Schlaefli symbol {3,3,5}).
- Figurate numbers based on the 120-cell (4-D polytope with Schlaefli symbol {5,3,3}).A092183
Figurate numbers based on the 120-cell (4-D polytope with Schlaefli symbol {5,3,3}).
- Sequence S_6 of the S_r family.A092184
Sequence S_6 of the S_r family.
- a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.A092185
a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.
- a(n) = 2(m!)^2 for n = 2m and m!(m+1)! for n = 2m+1.A092186
a(n) = 2(m!)^2 for n = 2m and m!(m+1)! for n = 2m+1.
- A092186(n)/2.A092187
A092186(n)/2.
- a(n) = smallest positive integer m such that 2^3^4^5^...^n == m (mod n).A092188
a(n) = smallest positive integer m such that 2^3^4^5^...^n == m (mod n).
- Numbers k such that the sum of the first k semiprimes is a semiprime.A092189
Numbers k such that the sum of the first k semiprimes is a semiprime.
- Semiprimes that are the sum of the first n semiprimes for some n.A092190
Semiprimes that are the sum of the first n semiprimes for some n.
- Numbers n such that sum of n-th and (n+1)-th semiprimes is a semiprime.A092191
Numbers n such that sum of n-th and (n+1)-th semiprimes is a semiprime.
- Semiprimes that are the sum of two successive semiprimes.A092192
Semiprimes that are the sum of two successive semiprimes.
- Number of generations for which prime(n) divides A001008(k) for some k.A092193
Number of generations for which prime(n) divides A001008(k) for some k.
- Primes p that divide A001008(k), the numerator of the k-th harmonic number H(k), for some k < p-1.A092194
Primes p that divide A001008(k), the numerator of the k-th harmonic number H(k), for some k < p-1.
- Primes p that do not divide A001008(k), the numerator of the k-th harmonic number H(k), for any k < p-1.A092195
Primes p that do not divide A001008(k), the numerator of the k-th harmonic number H(k), for any k < p-1.
- Number of letters in "old style" Roman numeral representation of n (e.g., IIII rather than IV).A092196
Number of letters in "old style" Roman numeral representation of n (e.g., IIII rather than IV).
- Brevity advantage of "new style" over "old style" Roman numerals.A092197
Brevity advantage of "new style" over "old style" Roman numerals.
- Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).A092198
Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).
- Number of Ore graphs on n nodes using Skiena's nonstandard definition > n (instead of the usual >= n).A092199
Number of Ore graphs on n nodes using Skiena's nonstandard definition > n (instead of the usual >= n).
- Expansion of (1+2x)/((1-x)(1-x^3)).A092200
Expansion of (1+2x)/((1-x)(1-x^3)).
- Molien series for 16-dimensional group of structure O_{4}^{+}(2) and order 72, corresponding to genus 2 complete weight enumerators of Hermitian self-dual GF(2)-linear codes over GF(4).A092201
Molien series for 16-dimensional group of structure O_{4}^{+}(2) and order 72, corresponding to genus 2 complete weight enumerators of Hermitian self-dual GF(2)-linear codes over GF(4).
- Expansion of (x - x^3) / (1 - x^5) in powers of x.A092202
Expansion of (x - x^3) / (1 - x^5) in powers of x.
- Molien series for 16-dimensional group of structure 2^4.O_{4}^{+}(F_2) = 2^4.(S_3 X S_3).2 and order 1152, corresponding to genus 2 complete weight enumerators of Hermitian self-dual GF(2)-linear codes over GF(4) containing the all-ones vector.A092203
Molien series for 16-dimensional group of structure 2^4.O_{4}^{+}(F_2) = 2^4.(S_3 X S_3).2 and order 1152, corresponding to genus 2 complete weight enumerators of Hermitian self-dual GF(2)-linear codes over GF(4) containing the all-ones vector.
- Least number that can be expressed as the difference of the squares of primes in exactly n distinct ways.A092204
Least number that can be expressed as the difference of the squares of primes in exactly n distinct ways.
- Number of units in the imaginary quadratic field Q(sqrt(-n)).A092205
Number of units in the imaginary quadratic field Q(sqrt(-n)).
- Positive integers that are not of the form n^2 or 3n^2.A092206
Positive integers that are not of the form n^2 or 3n^2.
- Semiprimes k such that k+2 is also a semiprime.A092207
Semiprimes k such that k+2 is also a semiprime.
- Duplicate of A082919.A092208
Duplicate of A082919.
- Smallest number k such that k, k+2, k+4, ..., k+2n are semiprimes.A092209
Smallest number k such that k, k+2, k+4, ..., k+2n are semiprimes.
- Positive integers n such that the trajectory of n under the Reverse and Add! operation carried out in base 2 (presumably) does not join the trajectory of any m < n.A092210
Positive integers n such that the trajectory of n under the Reverse and Add! operation carried out in base 2 (presumably) does not join the trajectory of any m < n.