This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100345 Triangle read by rows: T(n,k) = n*(n+k), 0<=k<=n. 9

%I

%S 0,1,2,4,6,8,9,12,15,18,16,20,24,28,32,25,30,35,40,45,50,36,42,48,54,

%T 60,66,72,49,56,63,70,77,84,91,98,64,72,80,88,96,104,112,120,128,81,

%U 90,99,108,117,126,135,144,153,162,100,110,120,130,140,150,160,170,180,190

%N Triangle read by rows: T(n,k) = n*(n+k), 0<=k<=n.

%C T(n,0) = A000290(n);

%C T(n,1) = A002378(n) for n>0;

%C T(n,2) = A005563(n) for n>1;

%C T(n,3) = A028552(n) for n>2;

%C T(n,4) = A028347(n+2) for n>3;

%C T(n,5) = A028557(n) for n>4;

%C T(n,6) = A028560(n) for n>5;

%C T(n,7) = A028563(n) for n>6;

%C T(n,8) = A028566(n) for n>7;

%C T(n,9) = A028569(n) for n>8;

%C T(n,10) = A098603(n) for n>9;

%C T(n,n-5) = A071355(n-4) for n>4;

%C T(n,n-4) = A054000(n-1) for n>3;

%C T(n,n-3) = A014107(n) for n>2;

%C T(n,n-2) = A046092(n-1) for n>1;

%C T(n,n-1) = A000384(n) for n>0;

%C T(n,n) = A001105(n);

%C row-sums give A085789 for n>0.

%e 0

%e 1 2

%e 4 6 8

%e 9 12 15 18

%e 16 20 24 28 32

%e 25 30 35 40 45 50

%e 36 42 48 54 60 66 72

%e 49 56 63 70 77 84 91 98

%e 64 72 80 88 96 104 112 120 128

%t Table[n(n+k),{n,0,10},{k,0,n}]//Flatten (* _Harvey P. Dale_, Aug 16 2018 *)

%Y Distinct members (except 0) are in A071562. Numbers occurring at least twice are in A175040. [_Franklin T. Adams-Watters_, Apr 04 2010]

%K nonn,tabl,easy

%O 0,3

%A _Reinhard Zumkeller_, Nov 18 2004

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.

Last modified January 19 17:45 EST 2019. Contains 319309 sequences. (Running on oeis4.)