Sequences
392,541 sequences
- a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.A058361
a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.
- Initial primes of sets of 6 consecutive primes in arithmetic progression.A058362
Initial primes of sets of 6 consecutive primes in arithmetic progression.
- Numbers whose reduced system of residues forms an arithmetic progression. It consists of primes, twice primes, and powers of 2.A058363
Numbers whose reduced system of residues forms an arithmetic progression. It consists of primes, twice primes, and powers of 2.
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 9 sites wide.A058364
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 9 sites wide.
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 8 sites wide.A058365
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 8 sites wide.
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.A058366
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide.
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide.A058367
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide.
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 5 sites wide.A058368
Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 5 sites wide.
- Numbers k such that k and k^2 have same digit sum.A058369
Numbers k such that k and k^2 have same digit sum.
- Primes p such that p and p^2 have same digit sum.A058370
Primes p such that p and p^2 have same digit sum.
- The sequence S defined in A058540.A058371
The sequence S defined in A058540.
- a(n) = -(n + 1)*(2*n^2 + n - 12)/6.A058372
a(n) = -(n + 1)*(2*n^2 + n - 12)/6.
- a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).A058373
a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).
- a(1) = 1; a(n+1) = sum{k=1 to n}[a(k)^a(n+1-k)].A058374
a(1) = 1; a(n+1) = sum{k=1 to n}[a(k)^a(n+1-k)].
- Palindromic primes with just two distinct prime digits.A058375
Palindromic primes with just two distinct prime digits.
- Where the race of the count of final nonzero digit of k! changes, starting at k=2.A058376
Where the race of the count of final nonzero digit of k! changes, starting at k=2.
- Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.A058377
Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.
- Number of trivalent 2-connected planar graphs with 2n nodes.A058378
Number of trivalent 2-connected planar graphs with 2n nodes.
- Essentially parallel series-parallel networks with n labeled edges, multiple edges not allowed.A058379
Essentially parallel series-parallel networks with n labeled edges, multiple edges not allowed.
- Essentially series series-parallel networks with n labeled edges, multiple edges not allowed.A058380
Essentially series series-parallel networks with n labeled edges, multiple edges not allowed.
- Number of series-parallel networks with n labeled edges, multiple edges not allowed.A058381
Number of series-parallel networks with n labeled edges, multiple edges not allowed.
- Continued fraction for Pie (A001355: digits of Pi and e interlaced).A058382
Continued fraction for Pie (A001355: digits of Pi and e interlaced).
- Primes of form 1+(2^a)*(3^b), a>0, b>0.A058383
Primes of form 1+(2^a)*(3^b), a>0, b>0.
- Largest power of 2 which is a divisor of p(n)-1, where p(n) = n-th prime.A058384
Largest power of 2 which is a divisor of p(n)-1, where p(n) = n-th prime.
- Number of essentially parallel series-parallel networks with n unlabeled edges, multiple edges not allowed.A058385
Number of essentially parallel series-parallel networks with n unlabeled edges, multiple edges not allowed.
- Essentially series series-parallel networks with n unlabeled edges, multiple edges not allowed.A058386
Essentially series series-parallel networks with n unlabeled edges, multiple edges not allowed.
- Number of series-parallel networks with n unlabeled edges, multiple edges not allowed.A058387
Number of series-parallel networks with n unlabeled edges, multiple edges not allowed.
- Total number of interior nodes in all essentially parallel series-parallel networks with n labeled edges, multiple edges not allowed.A058388
Total number of interior nodes in all essentially parallel series-parallel networks with n labeled edges, multiple edges not allowed.
- Number of 3 X 3 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.A058389
Number of 3 X 3 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.
- Number of 4 X 4 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.A058390
Number of 4 X 4 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.
- Number of 5 X 5 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.A058391
Number of 5 X 5 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.
- Number of 6 X 6 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.A058392
Number of 6 X 6 matrices with nonnegative integer entries and all row sums equal to n, up to row and column permutation.
- A square array based on 1^n (A000012) with each term being the sum of 2 consecutive terms in the previous row.A058393
A square array based on 1^n (A000012) with each term being the sum of 2 consecutive terms in the previous row.
- A square array based on natural numbers (A000027) with each term being the sum of 2 consecutive terms in the previous row.A058394
A square array based on natural numbers (A000027) with each term being the sum of 2 consecutive terms in the previous row.
- Square array read by antidiagonals. Based on triangular numbers (A000217) with each term being the sum of 2 consecutive terms in the previous row.A058395
Square array read by antidiagonals. Based on triangular numbers (A000217) with each term being the sum of 2 consecutive terms in the previous row.
- Expansion of ((1-x)/(1-2*x))^3.A058396
Expansion of ((1-x)/(1-2*x))^3.
- Row sums of partition triangle A026820.A058397
Row sums of partition triangle A026820.
- Partition triangle A008284 read from right to left.A058398
Partition triangle A008284 read from right to left.
- Triangle of partial row sums of partition triangle A008284.A058399
Triangle of partial row sums of partition triangle A008284.
- Triangle of partial row sums of partition triangle A058398.A058400
Triangle of partial row sums of partition triangle A058398.
- Triangle of partial row sums of partition triangle A026820.A058401
Triangle of partial row sums of partition triangle A026820.
- Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058403.A058402
Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058403.
- Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058402.A058403
Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058402.
- Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058405.A058404
Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058405.
- Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058404.A058405
Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058404.
- Total number of interior nodes in all series-parallel networks with n labeled edges, multiple edges not allowed.A058406
Total number of interior nodes in all series-parallel networks with n labeled edges, multiple edges not allowed.
- Number of 3 X n nonnegative integer matrices with all column sums 3, up to row and column permutation.A058407
Number of 3 X n nonnegative integer matrices with all column sums 3, up to row and column permutation.
- Number of 3 X n nonnegative integer matrices with all column sums 4, up to row and column permutation.A058408
Number of 3 X n nonnegative integer matrices with all column sums 4, up to row and column permutation.
- Number of 4 X n nonnegative integer matrices with all column sums 3, up to row and column permutation.A058409
Number of 4 X n nonnegative integer matrices with all column sums 3, up to row and column permutation.
- Number of 4 X n nonnegative integer matrices with all column sums 4, up to row and column permutation.A058410
Number of 4 X n nonnegative integer matrices with all column sums 4, up to row and column permutation.