Search: seq:1,0,0,2,3,0,0,14,20,0
|
|
Sorry, but the terms do not match anything in the table.
The following advanced matches exist for the numeric terms in your query.
If your sequence is of general interest, please submit it using the form provided and it will (probably) be added to the OEIS! Include a brief description and if possible enough terms to fill 3 lines on the screen. We need at least 4 terms.
|
| |
| |
| |
|
|
| |
| |
| | Approximate matches
| |
|
These sequences are 2 character edits (insertions, deletions, or replacements) away from the query.
- A063890 Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = n.
(1, 0, 0, 2, 3, 0, 0, 12, 21, 0)
- A234017 Inverse function for injection A055938.
(1, 0, 0, 2, 3, 0, 0, 4, 0, 0)
| |
| |
| | Transformations to other sequences
| |
|
These sequences match transformations of the original query.
a(n) for odd n
= 1, 0, 3, 0, 20
- A140581 Triangle read by rows, A054525 * A140256.
(1, 0, -3, 0, 20)
a(n) for even n
= 0, 2, 0, 14, 0
- A022898 Number of solutions to c(1)*prime(2)+...+c(n)*prime(n+1) = 1, where c(i) = +-1 for i > 1, c(1) = 1.
(0, 2, 0, 14, 0)
- A097798 Number of partitions of n into abundant numbers.
(0, 2, 0, 14, 0)
- A109578 a(n) = (pi(n+1)-pi(n)) * (prime(n+1)-prime(n)), where pi(k) is the number of prime numbers less than or equal to k (= A000720(k)) and prime(k) is the k-th prime number (= A000040(k)).
(0, 2, 0, 14, 0)
- A194669 Number of k in [1,n] for which <r^n>+<r^k> > 1, where < > = fractional part and r = sqrt(5).
(0, 2, 0, 14, 0)
- A225480 a(n) = B2(n) * C(n) where B2(n) are generalized Bernoulli numbers and C(n) the Clausen numbers.
(0, -2, 0, 14, 0)
- ... 11 total
deltas matching: a(n) for even n
= 0, 2, 0, 14, 0
- A065176 Site swap sequence associated with the permutation A065174 of Z.
(4, 4, 2, 2, 16, 16)
- A109579 Sum([pi(j+1)-pi(j)][prime(j+1)-prime(j)],j=1..n), where pi(k) is the number of prime numbers less than or equal to k and prime(k) is the k-th prime.
(33, 33, 35, 35, 49, 49)
- A172008 Number of minimal SNUSP programs using +, @ and # that yield n.
(2, 2, 4, 4, 18, 18)
- A226115 Least positive integer not of the form p_m - p_{m-1} + ... +(-1)^(m-k)*p_k with 0 < k < m <= n, where p_j denotes the j-th prime.
(78, 78, 80, 80, 94, 94)
- A226610 Irregular array read by rows. a(n) is the number of odd elements in the primitive 3x+k cycle associated with A226607(n).
(1, 1, 3, 3, 17, 17)
- ... 17 total
|
Search completed in 1.010 seconds
|
