login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157528 Triangle read by rows: t(n,m) = 1 if n=m or m=1, otherwise t(n,m) = 2*m*(n-m). 1
1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 6, 8, 6, 1, 1, 8, 12, 12, 8, 1, 1, 10, 16, 18, 16, 10, 1, 1, 12, 20, 24, 24, 20, 12, 1, 1, 14, 24, 30, 32, 30, 24, 14, 1, 1, 16, 28, 36, 40, 40, 36, 28, 16, 1, 1, 18, 32, 42, 48, 50, 48, 42, 32, 18, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Row sums are 1, 2, 4, 10, 22, 42, 72, 114, 170, 242, 332, ... which is (n+2)*(n^2-2n+3)/3 if n > 0.

LINKS

Table of n, a(n) for n=0..65.

EXAMPLE

Triangle begins

  1;

  1,  1;

  1,  2,  1;

  1,  4,  4,  1;

  1,  6,  8,  6,  1;

  1,  8, 12, 12,  8,  1;

  1, 10, 16, 18, 16, 10,  1;

  1, 12, 20, 24, 24, 20, 12,  1;

  1, 14, 24, 30, 32, 30, 24, 14,  1;

  1, 16, 28, 36, 40, 40, 36, 28, 16,  1;

  1, 18, 32, 42, 48, 50, 48, 42, 32, 18,  1;

MAPLE

A157528 := proc(n, m) if m=0 or n =m then 1; else 2*m*(n-m) ; end if; end proc: # R. J. Mathar, Sep 14 2011

MATHEMATICA

k = 2;

t[n_, m_] = If[n*m*(n - m) == 0, 1, n^k - (m^k + (n - m)^k)];

Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];

Flatten[%]

CROSSREFS

Sequence in context: A147532 A283796 A156580 * A132731 A128966 A055907

Adjacent sequences:  A157525 A157526 A157527 * A157529 A157530 A157531

KEYWORD

nonn,tabl,easy

AUTHOR

Roger L. Bagula, Mar 02 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 16:46 EDT 2019. Contains 328373 sequences. (Running on oeis4.)