Skip to main content
added 90 characters in body
Source Link
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$a(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $\mathcal{H}(n,k)$ is nonzero only when $n-k$ is odd, in which case its value is given by $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$a(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$a(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $\mathcal{H}(n,k)$ is nonzero only when $n-k$ is odd, in which case its value is given by $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

deleted 15 characters in body
Source Link
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$\mathrm{A260695}(n) = \mathcal{H}(n,1+(n\bmod 2)).$$$$a(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$\mathrm{A260695}(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$a(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

deleted 2 characters in body
Source Link
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$\mathrm{A260695}(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k+1)}{\binom{n+2}2},$$$$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$\mathrm{A260695}(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k+1)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

The sequence OEIS A260695 can be seen as the interweaving of nonzero Hultman numbers $\mathcal{H}(n,k)$ for $k=1$ and $k=2$. Namely, $$\mathrm{A260695}(n) = \mathcal{H}(n,1+(n\bmod 2)).$$

It is known that $$\mathcal{H}(n,k) = \frac{c(n+2,k)}{\binom{n+2}2},$$ where $c(\cdot,\cdot)$ are unsigned Stirling numbers of first kind.

Noticing that $c(n+2,2)=(n+1)!H_{n+1}$, we obtain the same formulae as in Mikhail's answer.

added 96 characters in body
Source Link
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152
Loading
Source Link
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152
Loading