Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007590
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007590 Floor(n^2/2).
(Formerly M1090)
+0
18
0, 0, 2, 4, 8, 12, 18, 24, 32, 40, 50, 60, 72, 84, 98, 112, 128, 144, 162, 180, 200, 220, 242, 264, 288, 312, 338, 364, 392, 420, 450, 480, 512, 544, 578, 612, 648, 684, 722, 760, 800, 840, 882, 924, 968, 1012, 1058, 1104, 1152, 1200, 1250, 1300, 1352, 1404 (list; graph; listen)
OFFSET

0,3

COMMENT

Arithmetic mean of a pair of successive triangular numbers. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 24 2005

Also the maximum sum of absolute values of differences of neighbors in a cyclic permutation of 1..n. For example, with n = 9, many permutations have a sum of 40, including 1 9 2 8 3 7 4 6 5: |1-9| + |9-2| + |2-8| + |8-3| + |3-7| + |7-4| + |4-6| + |6-5| + |5-1| = 40. - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Dec 15 2005

LINKS

T. D. Noe, Table of n, a(n) for n=0..1000

FORMULA

a(n) = a(n-1)+a(n-2)-a(n-3)+2 = 2*A002620(n) = A000217(n+1)+A004526(n) - Henry Bottomley (se16(AT)btinternet.com), Mar 08 2000

a(n+1) = Sum{k=1..n, k + mod(k,2)} for n >= 0. Therefore a(n) = Sum{k=1..n, 2*floor(k/2)} for n >= 0. - William A. Tedeschi (fynmun(AT)hotmail.com), Mar 19 2008

PROGRAM

(PARI) a(n)=n^2\2

CROSSREFS

Column 3 of triangle A094953.

For n>2: a(n) = sum of (n-1)-th row in triangle A101037.

Cf. A000290, A000212, A118015, A056827, A118013.

A080476 is essentially the same sequence.

Adjacent sequences: A007587 A007588 A007589 this_sequence A007591 A007592 A007593

Sequence in context: A046843 A100057 A080477 this_sequence A080476 A053799 A085891

KEYWORD

nonn,easy

AUTHOR

njas, R. K. Guy.

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research