A089411 Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.
1, 1, 1, 1, 3, 4, 4, 11, 9, 6, 8, 14, 14, 12, 14, 19, 17, 16, 24, 26, 30
Offset: 0
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
A089849:= func< n | n eq 0 select 1 else ((1+(-1)^n)*Binomial(n,Floor(n/2))+(1-(-1)^n)*Catalan(Floor((n-1)/2)))/2 >; [A089849(n): n in [0..50]]; // G. C. Greubel, Feb 22 2025
a[n_] := If[EvenQ[n], Binomial[n, n/2], CatalanNumber[(n-1)/2]]; Table[a[n], {n, 0, 35}] (* Jean-François Alcover, Mar 09 2023 *)
def A089849(n): return binomial(n, n//2) if n%2==0 else catalan_number((n-1)//2) print([A089849(n) for n in range(51)]) # G. C. Greubel, Feb 22 2025
(define (A089849 n) (if (even? n) (A000984 (/ n 2)) (A000108 (/ (- n 1) 2))))
{a(n)=local(A=1+x+x*O(x^n));for(i=0,n,A=(1 + x*A^2)*(1+x)/(1+x+2*x^2));polcoeff(A,n)}
A079440 := n -> floor((n+1)/3) + `if`((n>=14),floor((n-10)/4)+floor((n-14)/8),0);
Comments