Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
57 views

Step back step forward algorithm for A108442

Let $a(n)$ be A108442. Here generating function is $\frac{1}{1-zA(z)}$ where $$ A(z) = 1 + z(A(z))^2 + z(A(z))^3. $$ Also $$ a(n) = \sum\limits_{k=1}^{n}\frac{k}{2n-k}\sum\limits_{i=0}^{n-k} \binom{2n-...
1 vote
0 answers
82 views

Generating functions related to generating function of Catalan numbers

Let $C_n$ be A000108 (i.e., Catalan numbers). Here generating function is $C(x)$ such that $$ C(x) = \frac{1-\sqrt{1-4x}}{2x}. $$ Let $a(n)$ be an integer sequence with generating function $A(x)$ such ...
2 votes
1 answer
310 views

Generating function for A300483 (related to Chebyshev polynomial of first kind)

Let $a(n)$ be A300483. Here $$ a(n) = 2\int\limits_{t \geqslant 0}T_n\left(\frac{t+1}{2}\right)\exp(-t)\,dt. $$ where $T_n(x)$ is $n$-th Chebyshev polynomial of first kind. Let $b(n)$ be an integer ...
10 votes
1 answer
625 views

Generating function for A261041

Let $a(n)$ be A261041 (i.e., number of partitions of subsets of $\{1,2,\dotsc,n\}$, where consecutive integers are required to be in different parts). Let $b(n)$ be an integer sequence with generating ...
2 votes
2 answers
315 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 ...
3 votes
1 answer
140 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}\...
2 votes
0 answers
64 views

On a $\sum\limits_{n=0}^{\infty}c_n x^n=\sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n+1}(1-f(k)x^k)$ (slightly different question)

Please note that this question differs from one of the previous questions of mine. Let $f(n)$ be an arbitrary function with integer values. Let $c_n$ be an arbitrary integer sequence. Let $a(n)$ be ...
5 votes
1 answer
168 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 ...
4 votes
2 answers
395 views

Non-linear recurrence for rational sequences with generating function with radicals?

Let $a(n)$ be a sequence of rational numbers with generating function $F(x)$. Assume $F(x)$ is composition of rational functions and radicals (roots). Is the following conjecture true: Conjecture 1: $...
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 $...
0 votes
0 answers
48 views

$R$-recursion for the A007165

Let $a(n)$ be A007165 i.e. number of $P$-graphs with $2n$ edges. Here ordinary generating function $A(x)$ satisfies $$ A(x) = \frac{(1 + xA(x))(1 + 2xA(x))}{1 + 2xA(x) - (xA(x))^2} $$ Let $$ R(n, q) = ...
1 vote
0 answers
49 views

$R$-recursion for the A036765

Let $a(n)$ be A036765 i.e. number of ordered rooted trees with $n$ non-root nodes and all outdegrees $\leqslant 3$. Here $$ a(n) = \frac{1}{n+1}\sum\limits_{j=0}^{\left\lfloor\frac{n}{2}\right\rfloor}\...
1 vote
1 answer
99 views

$R$-recursion for the A307389

Let $a(n)$ be A307389 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies $$ A(x)=\exp\left(\frac{\exp(2x)-2\exp(x)+2x+1}{2}\right) $$ The sequence begins with $$ 1,...
1 vote
1 answer
116 views

General case of the some $R$-recursions

Let $f(n)$ be an arbitrary function. Let $a(n)$ be an integer sequence such that its ordinary generating function satisfies $$ A(x)=\sum\limits_{i=0}^{\infty}\frac{x^i}{\prod\limits_{j=0}^{i}(1-f(j)x)...
3 votes
0 answers
70 views

$R$-recursion for the A249833 (similar to A235129)

Let $a(n)$ be A249833 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies $$ A(x) = 1 + \int A(x) + (A(x))^2\log A(x)\,dx $$ The sequence begins with $$ 1, 1, 2, 7, ...
2 votes
0 answers
103 views

$R$-recursion for the A235129

Let $a(n)$ be A235129 i.e. an integer sequence such that its exponential generating function $A(x)$ satisfies $$ A'(x) = 1 + A(x)\exp(A(x)) $$ The sequence begins with $$ 1, 1, 3, 12, 64, 424, 3358, ...
3 votes
1 answer
156 views

$q$-series and Stirling of the 1st kind

Denote the (unsigned) Stirling numbers of the $1^{st}$-kind by ${n \brack k}$ and define $$\mathbf{F}_a(q)=\sum_{m\geq1}\frac{q^{am}}{(1-q^m)^{2a}} \qquad \text{and} \qquad \mathbf{G}_b(q)=\sum_{m\...
1 vote
0 answers
89 views

Suitable recursion for the A234289

Let $a(n)$ be A234289 i.e. integer sequence with exponential generating function $$ A(x)=1+A(x)^2\int \frac{1}{A(x)}\,dx $$ The sequence begins with $$ 1, 1, 3, 17, 147, 1729, 25827, 468593, 10012083, ...
1 vote
0 answers
80 views

Recursion for the A006014 using difference of binomial coefficients

Let $a(n)$ be A006014 i.e. $$ a(n)=na(n-1)+\sum\limits_{j=1}^{n-2}a(j)a(n-j-1), \\ a(1)=1 $$ Also generating function $A(x)$ satisfies $$ A(x) = x(1 + A(x) + A(x)^2 + xA'(x)) $$ Let $$ R(n,q)=\sum\...
4 votes
0 answers
118 views

Something (which might be called multi-continued fraction) for the A112487

Let $a(n)$ be A112487 i.e. an integer sequence with exponential generating function $$ A(x)=\exp\left(\int (A(x)+A(x)^2)\,dx\right), \\ A(0)=1 $$ However, the definition in the name of the sequence is ...
0 votes
0 answers
100 views

Recursion for the A266328 by analogy with non-standard recursion for factorials

Let $a(n)$ be A266328 i.e. an integer sequence with exponential generating function $$ A(x)=\exp\int B(x) \,dx $$ such that $$ B(x)=\exp(-x)\exp\int A(x) \,dx $$ where the constant of integration is ...
0 votes
0 answers
181 views

Expansion of continued fraction using recursion

Let $f(n)$ be an arbitrary function such that $f(n)\in\mathbb{Z}$. Let $a(n)$ be an integer sequence with generating function $\frac{1}{G(0)}$ where $$ G(j)=1-\frac{f(j)x}{G(j+1)} $$ Here we have $$ G(...
1 vote
1 answer
344 views

Products involving exponents of tribonacci numbers

The Fibonacci numbers $F_n$ can be given by $$\sum_{k\geq0}F_kx^k=\frac{x}{1-x-x^2}.$$ Among many many properties of this sequence, consider the following two results: (1) the coefficients of the ...
0 votes
0 answers
73 views

Sequences that sum up to possible generalization of Euler or up/down numbers (A000111)

Let $a(n,m,k)$ be an integer sequence with e.g.f. $$A(x)=\operatorname{exp}\left(x + m\int\int (A(x))^k \, dx \, dx\right)$$ I don't know much about integrals, so here's a concrete example: $a(n,1,3)$...
1 vote
0 answers
93 views

Application of the series reversion

Let $f(n)$ be an arbitrary function such that $f(n)\in\mathbb{Z}$. Let $a(n)$ be an arbitrary integer sequence such that $a(0)=1$. Let $b(n)$ be an integer sequence such that $$b(2^m(2n+1))=\sum\...
0 votes
1 answer
163 views

Is there a closed form of $\sum_{i=1}^{n-k} {n-1-i\choose k-1}x^i$ in $x$?

I'm looking for the generating function of the sum $\sum_{i=1}^{n-k} {n-1-i\choose k-1}x^i$. One can compute this using the Euler-MacLauren formula but the remainder term is a little messy. Is there ...
14 votes
1 answer
963 views

Ramanujan's Lost Notebook page 1 first equation and OEIS sequence A260195

In the 1988 Narosa edition of Ramanujan's The Lost Notebook and Other Unpublished Papers, on the first line of page 1 is the following: $$ \Big(1+\frac1a\Big) \Bigg\{\frac{1}{(1-aq)(1-q/a)}+\frac{q(1+...
13 votes
2 answers
1k views

A mystery sequence

This question arose from the recent one, roots of a polynomial linked to mock theta function?. Let $$ g(x):=\sum_{k=0}^\infty x^k\prod_{j=1}^{k-1}(1 + x^j)^2\\=1+x+x^2+3 x^3+4 x^4+6 x^5+10 x^6+15 x^7+...
14 votes
1 answer
755 views

Generating function of the Thue-Morse sequence

Let $T$ be the generating function of the Thue-Morse sequence; thus, $T(x)=x+x^2+x^4+x^7+\dotsb$. It is known that $T$ satisfies the nice congruence $$ (1+x)^3 T^2(x) + (1+x)^2 T(x) + x \equiv 0 \...