Search: seq:1,0,3,0,20,0,154,0,1260,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.
|
| |
| |
| |
|
|
| |
| |
| | Transformations to other sequences
| |
|
These sequences match transformations of the original query.
a(n) for odd n
= 1, 3, 20, 154, 1260
- A126596 a(n) = binomial(4*n,n)*(2*n+1)/(3*n+1).
(1, 3, 20, 154, 1260)
a(n) for even n
= 0, 0, 0, 0, 0
- A000004 The zero sequence.
(0, 0, 0, 0, 0)
- A000007 The characteristic function of {0}: a(n) = 0^n.
(0, 0, 0, 0, 0)
- A000038 Twice A000007.
(0, 0, 0, 0, 0)
- A000086 Number of solutions to x^2 - x + 1 == 0 (mod n).
(0, 0, 0, 0, 0)
- A000089 Number of solutions to x^2 + 1 == 0 (mod n).
(0, 0, 0, 0, 0)
- ... 11630 total
deltas matching: a(n) for even n
= 0, 0, 0, 0, 0
- A000006 Integer part of square root of n-th prime.
(15, 15, 15, 15, 15, 15)
- A000012 The simplest sequence of positive numbers: the all 1's sequence.
(1, 1, 1, 1, 1, 1)
- A000015 Smallest prime power >= n.
(59, 59, 59, 59, 59, 59)
- A000030 Initial digit of n.
(1, 1, 1, 1, 1, 1)
- A000146 From von Staudt-Clausen representation of Bernoulli numbers: a(n) = Bernoulli(2n) + Sum_{(p-1)|2n} 1/p.
(1, 1, 1, 1, 1, 1)
- ... 11186 total
|
Search completed in 1.759 seconds
|
