Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116996
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116996 Partial sums of A116966. +0
1
0, 1, 4, 6, 10, 15, 22, 28, 36, 45, 56, 66, 78, 91, 106, 120, 136, 153, 172, 190, 210, 231, 254, 276, 300, 325, 352, 378, 406, 435, 466 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = SUM[i=1..n] A116966(n). a(n) = SUM[i=1..n] (n + {1,2,0,1} according as n == {0,1,2,3} mod 4). a(n) = A000217(n) = n*(n+1)/2 unless n == 2 mod 4 in which case a(n) = A000217(n)+1 = (n*(n+1)/2)+1.

EXAMPLE

a(1) = 1 = A000217(1).

a(2) = 1+3 = 4 = A000217(2)+1.

a(3) = 1+3+2 = 6 = A000217(3).

a(4) = 1+3+2+4 = 10 = A000217(4).

a(5) = 1+3+2+4+5 = 15 = A000217(5).

a(6) = 1+3+2+4+5+7 = 22 = A000217(6)+1.

a(27) = 1+3+2+4+5+7+6+8+9+11+10+12+13+15+14+16+17+19+18+20+21+23+22+24+25+27+26 = 378 = A000217(27).

CROSSREFS

Cf. A000217, A116966.

Adjacent sequences: A116993 A116994 A116995 this_sequence A116997 A116998 A116999

Sequence in context: A140611 A076957 A121214 this_sequence A004399 A028282 A024905

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.com), Apr 02 2006

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research