1,2

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

M. Abert and P. Diaconis, paper in preparation, 2002.

E. Lemoine, ``Note sur deux nouvelles d\'{e}compositions des nombres entiers,'' Assoc. fran\c{c}aise pour l'avancement des sciences. Vol. 29, pp. 72-74, 1900.

D. Parisse, The Tower of Hanoi and the Stern-Brocot-Array, Thesis, Munich, 1997.

Index entries for sequences related to Stern's sequences

Index entries for sequences related to rooted trees

a(n+1) = a(n)*(a(n)+3)/2, a(1)=1

a(0)=1, a(n)=sum(i=0, n-1, t(a(i)), where t(n)=n*(n+1)/2. E.g. a(4)=t(1)+t(1)+t(2)+t(5)=1+1+3+15=20 - Jon Perry (perry(AT)globalnet.co.uk), Feb 14 2004

A006893 := proc(n) option remember; if n=1 then 1 else A006893(n-1)*(A006893(n-1)+3)/2; fi; end;

Records in A057945.

A007501(n-1) - 1.

Sequence in context: A058109 A005331 A158872 this_sequence A003163 A088498 A039777

Adjacent sequences: A006890 A006891 A006892 this_sequence A006894 A006895 A006896

nonn

Jeffrey Shallit

Additional description from Andreas M. Hinz and Daniele Parisse (hinz(AT)appl-math.tu-muenchen.de).