Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093467 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(i)-a(1), i = 1 to n}. +0
2
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; listen)
OFFSET

1,2

LINKS

Joerg Arndt, Fxtbook

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: A099968 A010357 A002995 this_sequence A080408 A001420 A049339

Adjacent sequences: A093464 A093465 A093466 this_sequence 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

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research