Sequences
392,541 sequences
- Number of primes of the form 12k + 1 less than 10^n.A091161
Number of primes of the form 12k + 1 less than 10^n.
- Number of primes of the form 12k + 5 less than 10^n.A091162
Number of primes of the form 12k + 5 less than 10^n.
- Number of primes of the form 12k + 7 less than 10^n.A091163
Number of primes of the form 12k + 7 less than 10^n.
- Number of primes of the form 12k + 11 less than 10^n.A091164
Number of primes of the form 12k + 11 less than 10^n.
- Number of primes of the form 30k + 1 less than 10^n.A091165
Number of primes of the form 30k + 1 less than 10^n.
- Number of primes of the form 30k + 7 less than 10^n.A091166
Number of primes of the form 30k + 7 less than 10^n.
- Number of primes of the form 30k + 11 less than 10^n.A091167
Number of primes of the form 30k + 11 less than 10^n.
- Number of primes of the form 30k + 13 less than 10^n.A091168
Number of primes of the form 30k + 13 less than 10^n.
- Number of primes of the form 30k + 17 less than 10^n.A091169
Number of primes of the form 30k + 17 less than 10^n.
- Number of primes of the form 30k + 19 less than 10^n.A091170
Number of primes of the form 30k + 19 less than 10^n.
- Number of primes of the form 30k + 23 less than 10^n.A091171
Number of primes of the form 30k + 23 less than 10^n.
- Number of primes of the form 30k + 29 less than 10^n.A091172
Number of primes of the form 30k + 29 less than 10^n.
- Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence.A091173
Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence.
- Leftmost column of triangle A091173, in which the n-th row lists the coefficients of the polynomial that generates the n-th diagonal.A091174
Leftmost column of triangle A091173, in which the n-th row lists the coefficients of the polynomial that generates the n-th diagonal.
- Row sums of triangle A091173, in which the n-th row lists the coefficients of the polynomial that generates the n-th diagonal.A091175
Row sums of triangle A091173, in which the n-th row lists the coefficients of the polynomial that generates the n-th diagonal.
- Numbers n such that prime(n) is of the form 2*k^2 - 1.A091176
Numbers n such that prime(n) is of the form 2*k^2 - 1.
- Numbers m such that the m-th prime is of the form 3*k-1.A091177
Numbers m such that the m-th prime is of the form 3*k-1.
- Numbers k such that k-th prime is of the form 6*m+1.A091178
Numbers k such that k-th prime is of the form 6*m+1.
- A088878 indexed by A000040.A091179
A088878 indexed by A000040.
- Primes of the form 3*p - 2 such that p is a prime.A091180
Primes of the form 3*p - 2 such that p is a prime.
- A091180 indexed by A000040.A091181
A091180 indexed by A000040.
- Number of ways to write n = x + y (x >= y > 0) with xy - 1 and xy + 1 both prime.A091182
Number of ways to write n = x + y (x >= y > 0) with xy - 1 and xy + 1 both prime.
- Index of first occurrence of n in A091182.A091183
Index of first occurrence of n in A091182.
- a(n) = (least prime beginning with prime(n) and having as many digits) - (least integer beginning with prime(n) and having as many digits).A091184
a(n) = (least prime beginning with prime(n) and having as many digits) - (least integer beginning with prime(n) and having as many digits).
- a(n) = A090938(n)/n.A091185
a(n) = A090938(n)/n.
- Triangle read by rows, in which n-th row gives expansion of x^n/((1-x)(1-x-x^2)^n).A091186
Triangle read by rows, in which n-th row gives expansion of x^n/((1-x)(1-x-x^2)^n).
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and k branches.A091187
Triangle read by rows: T(n,k) is the number of ordered trees with n edges and k branches.
- G.f. A(x) satisfies both A(-x)*A(x) = A(x^2) and xA(x)^2 = B(xA(x^2)) where B(x) = x*(1+x)/(1-x).A091188
G.f. A(x) satisfies both A(-x)*A(x) = A(x^2) and xA(x)^2 = B(xA(x^2)) where B(x) = x*(1+x)/(1-x).
- Primes of the form 20*R_k + 1, where R_k is the repunit (A002275) of length k.A091189
Primes of the form 20*R_k + 1, where R_k is the repunit (A002275) of length k.
- G.f. A(x) satisfies x*A(x)^3 = B(x*A(x^3)) where B(x) = x/(1 - 3*x).A091190
G.f. A(x) satisfies x*A(x)^3 = B(x*A(x^3)) where B(x) = x/(1 - 3*x).
- Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor.A091191
Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor.
- Abundant numbers having at least one abundant proper divisor.A091192
Abundant numbers having at least one abundant proper divisor.
- Smallest number having n abundant divisors.A091193
Smallest number having n abundant divisors.
- Number of abundant numbers <= n.A091194
Number of abundant numbers <= n.
- Number of numbers <= n having only one abundant divisor (A091191).A091195
Number of numbers <= n having only one abundant divisor (A091191).
- Smallest abundant divisor of n-th abundant number.A091196
Smallest abundant divisor of n-th abundant number.
- Denominators of Taylor series expansion of 3*sin(2*x)/(2*(2+cos(2*x))) (with 0's omitted).A091197
Denominators of Taylor series expansion of 3*sin(2*x)/(2*(2+cos(2*x))) (with 0's omitted).
- Numerators of Taylor series expansion of 3*sin(2*x)/(2*(2+cos(2*x))) (with 0's omitted).A091198
Numerators of Taylor series expansion of 3*sin(2*x)/(2*(2+cos(2*x))) (with 0's omitted).
- Numbers k such that (6k-3)^2 + 2 is prime.A091199
Numbers k such that (6k-3)^2 + 2 is prime.
- G.f. A(x) satisfies xA(x)^5 = B(xA(x^5)) where B(x) = x/(1-5x).A091200
G.f. A(x) satisfies xA(x)^5 = B(xA(x^5)) where B(x) = x/(1-5x).
- Number of orbits of length n under the map whose periodic points are counted by A061688.A091201
Number of orbits of length n under the map whose periodic points are counted by A061688.
- Factorization-preserving isomorphism from nonnegative integers to binary codes for polynomials over GF(2).A091202
Factorization-preserving isomorphism from nonnegative integers to binary codes for polynomials over GF(2).
- Factorization-preserving isomorphism from binary codes of GF(2) polynomials to integers.A091203
Factorization-preserving isomorphism from binary codes of GF(2) polynomials to integers.
- Factorization and index-recursion preserving isomorphism from nonnegative integers to polynomials over GF(2).A091204
Factorization and index-recursion preserving isomorphism from nonnegative integers to polynomials over GF(2).
- Factorization and index-recursion preserving isomorphism from binary codes of GF(2) polynomials to integers.A091205
Factorization and index-recursion preserving isomorphism from binary codes of GF(2) polynomials to integers.
- Primes whose binary representation encodes a polynomial irreducible over GF(2).A091206
Primes whose binary representation encodes a polynomial irreducible over GF(2).
- Indices of primes that are also irreducible GF(2)[X]-polynomials.A091207
Indices of primes that are also irreducible GF(2)[X]-polynomials.
- A014580-indices of irreducible GF(2)[X]-polynomials that are also primes.A091208
A014580-indices of irreducible GF(2)[X]-polynomials that are also primes.
- Primes whose binary representation encodes a polynomial reducible over GF(2).A091209
Primes whose binary representation encodes a polynomial reducible over GF(2).
- Indices of primes that are composite GF(2)[X]-polynomials.A091210
Indices of primes that are composite GF(2)[X]-polynomials.