[go: up one dir, main page]

login
Revision History for A290777 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = n-th Carlitz-Riordan q-Catalan number (recurrence version) for q = n.
(history; published version)
#24 by Michel Marcus at Sat May 09 02:41:07 EDT 2020
STATUS

reviewed

approved

#23 by Joerg Arndt at Sat May 09 02:33:28 EDT 2020
STATUS

proposed

reviewed

#22 by F. Chapoton at Sat May 09 02:32:19 EDT 2020
STATUS

editing

proposed

#21 by F. Chapoton at Sat May 09 02:32:06 EDT 2020
PROG

def b(n, k):

if n == 0:

return 1

def b(n, k): return 1 if n==0 else sum([b(j, k) * b(n - j - 1, k) * k**j for j in range(n)])

print map([a, (n) for n in range(16)]) # Indranil Ghosh, Aug 10 2017

STATUS

approved

editing

Discussion
Sat May 09
02:32
F. Chapoton: simplify python code
#20 by N. J. A. Sloane at Sat Dec 07 12:33:53 EST 2019
PROG

print map(a, xrangerange(16)) # Indranil Ghosh, Aug 10 2017

Discussion
Sat Dec 07
12:33
OEIS Server: https://oeis.org/edit/global/2838
#19 by N. J. A. Sloane at Sat Dec 07 12:18:29 EST 2019
PROG

def b(n, k): return 1 if n==0 else sum([b(j, k)*b(n - j - 1, k)*k**j for j in xrangerange(n)])

Discussion
Sat Dec 07
12:18
OEIS Server: https://oeis.org/edit/global/2837
#18 by Vaclav Kotesovec at Sat Aug 19 06:42:34 EDT 2017
STATUS

editing

approved

#17 by Vaclav Kotesovec at Sat Aug 19 06:42:23 EDT 2017
FORMULA

a(n) ~ n^(n*(n-1)/2). - Vaclav Kotesovec, Aug 19 2017

STATUS

approved

editing

#16 by Alois P. Heinz at Thu Aug 10 20:05:18 EDT 2017
STATUS

editing

approved

#15 by Alois P. Heinz at Thu Aug 10 20:05:14 EDT 2017
FORMULA

a(n) = [x^n] 1/(1-x/(1-kn*x/(1-kn^2*x/(1-kn^3*x/(1-kn^4*x/(1- ... )))))).

STATUS

approved

editing