The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A102038

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A102038

a(n+1) = n*a(n) + a(n-1), a(1)=1, a(2)=2.
(history; published version)

#33 by Alois P. Heinz at Sat Aug 31 19:20:09 EDT 2024

STATUS

proposed

approved

#32 by Jason Yuen at Sat Aug 31 19:01:11 EDT 2024

STATUS

editing

proposed

#31 by Jason Yuen at Sat Aug 31 19:01:06 EDT 2024

FORMULA

a(n+1) = Sum_{k=0..n} k!*C(floor((n+k)/2),k)*C(floor((n+k+1)/2),k)).

STATUS

approved

editing

#30 by Charles R Greathouse IV at Thu Sep 08 08:45:16 EDT 2022

PROG

(MAGMAMagma) I:=[1, 2]; [n le 2 select I[n] else (n-1)*Self(n-1) +Self(n-2): n in [1..30]]; // G. C. Greubel, Feb 23 2019

Discussion

Thu Sep 08

08:45

OEIS Server: https://oeis.org/edit/global/2944

#29 by Joerg Arndt at Thu Mar 26 02:24:05 EDT 2020

STATUS

proposed

approved

#28 by Michel Marcus at Thu Mar 26 01:10:21 EDT 2020

STATUS

editing

proposed

#27 by Michel Marcus at Thu Mar 26 01:10:18 EDT 2020

LINKS

Juan S. Auli and Sergi Elizalde, <a href="https://arxiv.org/abs/2003.11533">Wilf equivalences between vincular patterns in inversion sequences</a>, arXiv:2003.11533 [math.CO], 2020.

STATUS

approved

editing

#26 by N. J. A. Sloane at Mon Nov 11 18:35:32 EST 2019

STATUS

proposed

approved

#25 by Michel Marcus at Mon Nov 11 17:18:02 EST 2019

STATUS

editing

proposed

#24 by Michel Marcus at Mon Nov 11 17:17:57 EST 2019

FORMULA

A102038a(n) = A001040(n) + A001053(n) for n>1.

PROG

(PARI) a(n)=sum(k=0, n, k!*binomial((n+k)\2, k)*binomial((n+k+1)\2, k)) - _\\ _Paul D. Hanna_, Oct 31 2006

STATUS

proposed

editing