# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a001063
Showing 1-1 of 1

%I A001063 #25 Apr 10 2018 02:36:35
%S A001063 1,1,1,3,15,111,1131,15081,253473,5220225,128886921,3749014251,
%T A001063 126648293391,4909623331023,216189866951235,10718939718977121,
%U A001063 593865369943409601,36520856568972350721,2478236630512178688273,184588566642520989171795,15020141103053997234030351
%N A001063 E.g.f. satisfies A'(x) = A(x/(1-x)).
%C A001063 Sequence shifts left when x is replaced by x/(1-x) in e.g.f.
%H A001063 Alois P. Heinz, <a href="/A001063/b001063.txt">Table of n, a(n) for n = 0..300</a>
%H A001063 P. J. Cameron, <a href="http://dx.doi.org/10.1016/0024-3795(95)00352-R">Sequence operators from groups</a>, Linear Alg. Applic., 226-228 (1995), 109-113.
%F A001063 a(n+1) = Sum_{k=0..n} n!/k!*binomial(n-1, k-1)*a(k). - _Vladeta Jovovic_, Sep 03 2005
%p A001063 a:= proc(n) option remember; `if`(n=0, 1, add(
%p A001063       (n-1)!/k!*binomial(n-2, k-1)*a(k), k=0..n-1))
%p A001063     end:
%p A001063 seq(a(n), n=0..20);  # _Alois P. Heinz_, Feb 10 2015
%t A001063 nmax=20; b = ConstantArray[0,nmax+2]; b[[1]]=1; Do[b[[n+2]] = Sum[n!/k!*Binomial[n-1,k-1]*b[[k+1]],{k,0,n}],{n,0,nmax}]; b (* _Vaclav Kotesovec_, Mar 02 2014 *)
%K A001063 nonn,eigen
%O A001063 0,4
%A A001063 _Peter J. Cameron_
%E A001063 More terms from _Christian G. Bower_, Mar 15 1999

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE