Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093468 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}. +0
2
1, 2, 3, 6, 18, 78, 438, 2958, 23118, 204558, 2018958, 21977358, 261478158, 3374988558, 46964134158, 700801318158, 11162196262158, 189005910310158, 3390192763174158, 64212742967590158, 1280663747055910158 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = A014288(n-1)+1. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 08 2004

MATHEMATICA

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}] (from Robert G. Wilson v Apr 08 2004)

CROSSREFS

Cf. A093467.

Sequence in context: A083563 A038056 A072241 this_sequence A114302 A000304 A000614

Adjacent sequences: A093465 A093466 A093467 this_sequence A093469 A093470 A093471

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 07 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 08 2004

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research