Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 231922
2 votes
0 answers
50 views

$R$-recursion for A006351

Let $a(n)$ be A006351 (i.e., number of series-parallel networks with n labeled edges. Also called yoke-chains by Cayley and MacMahon). Here exponential generating function is $A(x)$ such that $B(x) = …
2 votes
0 answers
47 views

$R$-recursion for A338193

Let $a(n)$ be A338193. Here generating function is $A(x)$ such that $$ A(x) = 1 + \int\frac{\left(\frac{x}{A(x)}\right)'}{\left(\frac{x}{(A(x))^2}\right)'} \, dx. $$ Let $$ R(n, q) = \begin{cases} 1 …
1 vote
1 answer
64 views

Equivalence of sequences related to A033264

Let $a(n)$ be A033264 (i.e., number of blocks of $\{1,0\}$ in the binary expansion of $n$). Here $$ a(4n) = a(4n+1) = a(2n), \\ a(4n+2) = a(n)+1, \\ a(4n+3) = a(n), \\ a(0) = 0. $$ Let $$ \ell(n) = \ …
2 votes
0 answers
43 views

Recursion for A129179 similar to recursion for Pascal's triangle

Let $T(n,k)$ be A129179 (i.e., triangle read by rows: $T(n, k)$ is the number of Schroeder paths of semilength $n$ such that the area between the $x$-axis and the path is $k$ ($n \geqslant 0, 0 \leqs …
2 votes
0 answers
45 views

On A088352 as an antidiagonal sums of A129179

Let $a(n)$ be A088352. Here $a(n)$ is an integer sequence with generating function $A(x)$ such that $$ A(x) = \cfrac{1}{1-x-\cfrac{x^2}{1-x^3-\cfrac{x^4}{1-x^5-\cfrac{x^6}{1-x^7-\cfrac{x^8}{\ddots}}} …
2 votes
2 answers
312 views

5 different ways to define the same family of integer sequences

Let ${n \brace k}$ be a Stirling number of the second kind. Let $A_n(x)$ be an Eulerian polynomial. Here $$ A_n(x) = \sum_{i=0}^{n}i!{n \brace i}(x-1)^{n-i}. $$ Let $a_1(n,p,q)$ be the family of inte …
1 vote
0 answers
105 views

Simpler recursion for the A358612

Let $T(n,k)$ be an integer coefficients (A358612) such that $$ T(2n+1, k) = kT(n, k) + T(n, k-1), \\ T(2n, k) = kT(n, k) + T(n, k-1) - \frac{T(2n, k-1) + T(n, k-1)}{k-1}, \\ T(n, 1) = T(0, 2) = 1 $$ …
3 votes
1 answer
134 views

$R$-recursion for unsigned Genocchi numbers (of first kind) of even index

Let $G_n$ be A036968 (i.e., Genocchi numbers). Here $$ \frac{2t}{1+e^t}=\sum\limits_{n=0}^{\infty}G_n\frac{t^n}{n!}. $$ Also $$ t\tan\left(\frac{t}{2}\right)=\sum\limits_{n=1}^{\infty}(-1)^n G_{2n}\f …
1 vote
0 answers
31 views

On a A347205 and related row polynomials

Let $a(n)$ be A347205. Here $$ a(2^m(2k+1)) = \sum\limits_{j=0}^{m}a(2^j k), \\ a(0) = 1. $$ Let $\nu_2(n)$ be A007814 (i.e., number of trailing zeros in the binary expansion of $n$). Here $$ \nu_2(2 …
5 votes
1 answer
154 views

On a generating function and vector $\nu$ of length $n$

Let $f(n)$ be an arbitrary function with integer values. Let $a(n)$ be an integer sequence such that $$ \frac{1}{1-x}=\sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n+1}(1-f(k)x) $$ Start with …
1 vote
0 answers
63 views

On a A162326 and vector $\nu$ of length $n$

Let $a(n)$ be A162326. Here $$ a(n) = \frac{1}{n}(2(5n-7)a(n-1) - 9(n-2)a(n-2)), \\ a(0) = a(1) = 1. $$ Also ordinary generating function is $$ \frac{5 - \sqrt{\frac{1-9x}{1-x}}}{4}. $$ Let $b(n)$ be …
1 vote
0 answers
89 views

Closed form for the A357990 using A329369 and generalised A373183

Let $$ \ell(n) = \left\lfloor\log_2 n\right\rfloor, \\ \ell(0) = -1 $$ Let $$ f(n) = \ell(n) - \ell(n-2^{\ell(n)}) - 1 $$ Here $f(n)$ is A290255. Let $A(n,k)$ be a square array such that $$ A(n, …
3 votes
0 answers
87 views

Recursion for reversed rows of the A373183 using unsigned Stirling numbers of the first kind

Let $\left[{n \atop k}\right]$ be unsigned Stirling numbers of the first kind. Here $$ \left[{n \atop k}\right] = (n-1)\left[{n-1 \atop k}\right] + \left[{n-1 \atop k-1}\right], \\ \left[{n \atop 0} …
0 votes
0 answers
135 views

Integer coefficients and continued fractions

Let $a(n,p,q)$ be the family of integer sequences such that ordinary generating functions for it are $\frac{1}{G_1(0,x)}$ where $G_1(0,x)$ are continued fractions such that $$ G_1(j,x)=1-\cfrac{(qj+1 …
1 vote
0 answers
167 views

Integer coefficients and integrals

Let $a(n,p,q)$ be the family of integer sequences such that exponential generating functions for it satisfy $$ A_1(x)=\exp\left(x + p\int\int (A_1(x))^q \, dx \, dx\right). $$ Let $b(n,p,q)$ be the …

1
2 3 4 5
7
15 30 50 per page