Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145729
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145729 Partial sums of A052379. +0
1
0, 8, 80, 664, 5344, 42792, 342384, 2739128, 21913088, 175304776, 1402438288, 11219506392, 89756051232, 718048409960, 5744387279792, 45955098238456, 367640785907776, 2941126287262344, 23529010298098896, 188232082384791320 (list; graph; listen)
OFFSET

0,2

COMMENT

In a C/C++ style of notation, the update from a(n-1) to a(n) can be formulated as a+=(a+=(a+=(a+=n))).

FORMULA

a(n) = sum_{i=0..n-1} A052379(i).

a(n) = 8*(8^(n+1)-7n-8)/49 = 8*A014831(n) = 2*A145730(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 21 2008

MATHEMATICA

lst={}; s=0; Do[s+=(s+=(s+=(s+=n))); AppendTo[lst, s], {n, 0, 5!}]; lst

CROSSREFS

Cf. A052379.

Sequence in context: A043035 A165760 A166157 this_sequence A024101 A155144 A136949

Adjacent sequences: A145726 A145727 A145728 this_sequence A145730 A145731 A145732

KEYWORD

nonn

AUTHOR

Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 17 2008

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 21 2008

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research