Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015083
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015083 q-Catalan numbers (recurrence version) for q=2. +0
10
1, 1, 3, 17, 171, 3113, 106419, 7035649, 915028347, 236101213721, 121358941877763, 124515003203007345, 255256125633703622475, 1046039978882750301409545, 8571252355254982356001107795 (list; graph; listen)
OFFSET

1,3

COMMENT

Limit_{n->inf} a(n)/2^((n-1)(n-2)/2) = Product{k=1..inf} 1/(1-1/2^k) = 3.462746619455... (cf. A065446). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 24 2005

It appears that the Hankel transform is 2^A002412(n). [From Paul Barry (pbarry(AT)wit.ie), Aug 01 2008]

FORMULA

a(n) = sum_{i=1}^{n-1} q^{(i-1)} a(i) a(n-i).

G.f. satisfies: A(x) = 2*x/(2-A(2*x)) = x/(1-x/(1-2*x/(1-2^2*x/(1-2^3*x/(1-...))))) (continued fraction). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 24 2005

PROGRAM

(PARI) a(n)=if(n==1, 1, sum(i=1, n-1, 2^(i-1)*a(i)*a(n-i))) (Hanna)

(PARI) {a(n)=local(A); if(n<1, 0, A=vector(n); for(k=1, n, A[k]=if(k<2, 1, sum(i=1, k-1, 2^i*A[i]*A[k-i])/2)); A[n])} /* Michael Somos Jan 30 2005 */

(PARI) {a(n)=local(A); if(n<1, 0, A=O(x); for(k=1, n, A=x/(1-subst(A, x, 2*x)/2)); polcoeff(A, n))} /* Michael Somos Jan 30 2005 */

CROSSREFS

Cf. A065446.

Sequence in context: A163884 A052143 A069856 this_sequence A053934 A159592 A126443

Adjacent sequences: A015080 A015081 A015082 this_sequence A015084 A015085 A015086

KEYWORD

nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research