Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118601 Partial sums of A058129. +0
2
1, 3, 10, 45, 273, 2510, 34069, 1703066 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = SUM[i=1..n] A058129(i). a(n) = SUM[i=1..n] (2*A058133(i) - A058132(i)).

CROSSREFS

Cf. A001329, A001423, A001426, A023814, A027851, A029851, A058108, A058132, A058133, A063756, A079173, A118581.

Sequence in context: A077002 A003704 A000250 this_sequence A005143 A121138 A074508

Adjacent sequences: A118598 A118599 A118600 this_sequence A118602 A118603 A118604

KEYWORD

hard,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), May 08 2006

EXTENSIONS

One more term from Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 20 2009

Edited by N. J. A. Sloane, Jul 25 2009

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research