login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093467 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(i)-a(1), i = 1 to n}. 1
1, 2, 3, 6, 14, 35, 90, 234, 611, 1598, 4182, 10947, 28658, 75026, 196419, 514230, 1346270, 3524579, 9227466, 24157818, 63245987, 165580142, 433494438, 1134903171, 2971215074, 7778742050, 20365011075, 53316291174, 139583862446 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n) = 3*a(n-1)-a(n-2)-1, n > 3. - Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 08 2004

MATHEMATICA

a[1] = 1; a[2] = 2; a[n_] := a[n] = a[n - 1] + Sum[a[i] - a[1], {i, n - 1}]; Table[ a[n], {n, 30}]

CROSSREFS

Cf. A093468.

Essentially the same as A032908.

Sequence in context: A010357 A190166 A002995 * A080408 A001420 A049339

Adjacent sequences:  A093464 A093465 A093466 * A093468 A093469 A093470

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:13 EST 2012. Contains 206050 sequences.