24540
domain: N
Appears in sequences
- Number of 4-voter voting schemes with n linearly ranked choices.at n=7A007010
- One-fourth of the fourth (m=3) column of triangle A060921 (bisection of Fibonacci triangle, odd part).at n=6A061183
- Duplicate of A089117.at n=13A089100
- Convoluted convolved Fibonacci numbers G_j^(4).at n=13A089117
- G.f.: 1/(1-x) = Sum_{n>=0} a(n)*x^n*Product_{k=1..n+1} (1-x^k).at n=30A209405
- a(n+1) = a(n) + p, where p is the largest prime less than a(n); a(1) = 3.at n=14A285010
- a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.at n=38A293517
- a(n) is the first number k such that there are exactly n pairs of primes p < q with p + q = k such that p*q - k and p*q + k are both prime.at n=47A358822
- Expansion of e.g.f. 1/(3 - 2*exp(x))^x.at n=6A367486
- G.f. A(x,y) satisfies 1/x = Sum_{n=-oo..+oo} A(x,y)^n * (A(x,y)^n + y)^(n+1), as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y), read by rows.at n=40A379200
- Central terms of triangle A379200; a(n) = A379200(2*n-1,n-1) for n >= 1.at n=4A379206