login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093468 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}. 2

%I #12 Jul 25 2015 01:10:24

%S 1,2,3,6,18,78,438,2958,23118,204558,2018958,21977358,261478158,

%T 3374988558,46964134158,700801318158,11162196262158,189005910310158,

%U 3390192763174158,64212742967590158,1280663747055910158

%N a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}.

%C Ignoring the different offsets, this is the partial sums of A001710. - _Jonathan Vos Post_ and _Franklin T. Adams-Watters_, May 12 2010

%F a(n) = A014288(n-1)+1. - _Vladeta Jovovic_, Apr 08 2004

%F a(n)=n*a(n-1)-(n-1)*a(n-2), n>3. - _Gary Detlefs_, Dec 30 2010

%t a[1] = 1; a[2] = 2; a[n_] := a[n] = a[n - 1] + Sum[a[n - 1] - a[i], {i, n - 1}]; Table[ a[n], {n, 21}] (* _Robert G. Wilson v_, Apr 08 2004 *)

%Y Cf. A093467.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Apr 07 2004

%E More terms from _Robert G. Wilson v_, Apr 08 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)